./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--block--xen-blkfront.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 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--block--xen-blkfront.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 dedd6e816706b4c34868dad2bcfd19a22eb16a791a20ccdf71875d228cd47b87 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 12:25:06,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 12:25:06,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 12:25:06,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 12:25:06,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 12:25:06,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 12:25:06,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 12:25:06,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 12:25:06,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 12:25:06,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 12:25:06,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 12:25:06,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 12:25:06,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 12:25:06,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 12:25:06,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 12:25:06,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 12:25:06,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 12:25:06,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 12:25:06,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 12:25:06,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 12:25:06,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 12:25:06,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 12:25:06,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 12:25:06,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 12:25:06,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 12:25:06,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 12:25:06,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 12:25:06,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 12:25:06,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 12:25:06,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 12:25:06,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 12:25:06,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 12:25:06,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 12:25:06,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 12:25:06,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 12:25:06,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 12:25:06,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 12:25:06,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 12:25:06,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 12:25:06,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 12:25:06,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 12:25:06,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 12:25:06,523 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 12:25:06,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 12:25:06,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 12:25:06,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 12:25:06,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 12:25:06,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 12:25:06,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 12:25:06,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 12:25:06,526 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 12:25:06,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 12:25:06,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 12:25:06,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 12:25:06,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 12:25:06,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 12:25:06,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 12:25:06,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 12:25:06,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 12:25:06,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 12:25:06,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 12:25:06,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 12:25:06,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 12:25:06,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:25:06,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 12:25:06,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 12:25:06,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 12:25:06,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 12:25:06,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 12:25:06,529 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 12:25:06,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 12:25:06,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 12:25:06,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 12:25:06,530 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 -> dedd6e816706b4c34868dad2bcfd19a22eb16a791a20ccdf71875d228cd47b87 [2021-11-17 12:25:06,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 12:25:06,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 12:25:06,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 12:25:06,743 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 12:25:06,743 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 12:25:06,744 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--block--xen-blkfront.ko.cil.i [2021-11-17 12:25:06,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6718aa458/9965c8e17b5145dfb74c42851d39c3de/FLAGf75fe77a5 [2021-11-17 12:25:07,412 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 12:25:07,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i [2021-11-17 12:25:07,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6718aa458/9965c8e17b5145dfb74c42851d39c3de/FLAGf75fe77a5 [2021-11-17 12:25:07,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6718aa458/9965c8e17b5145dfb74c42851d39c3de [2021-11-17 12:25:07,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 12:25:07,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 12:25:07,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 12:25:07,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 12:25:07,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 12:25:07,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:07" (1/1) ... [2021-11-17 12:25:07,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7234d4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:07, skipping insertion in model container [2021-11-17 12:25:07,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:07" (1/1) ... [2021-11-17 12:25:07,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 12:25:07,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 12:25:09,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373036,373049] [2021-11-17 12:25:09,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373181,373194] [2021-11-17 12:25:09,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373327,373340] [2021-11-17 12:25:09,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373492,373505] [2021-11-17 12:25:09,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373650,373663] [2021-11-17 12:25:09,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373808,373821] [2021-11-17 12:25:09,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373966,373979] [2021-11-17 12:25:09,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374126,374139] [2021-11-17 12:25:09,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374285,374298] [2021-11-17 12:25:09,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374424,374437] [2021-11-17 12:25:09,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374566,374579] [2021-11-17 12:25:09,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374715,374728] [2021-11-17 12:25:09,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374854,374867] [2021-11-17 12:25:09,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375009,375022] [2021-11-17 12:25:09,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375169,375182] [2021-11-17 12:25:09,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375320,375333] [2021-11-17 12:25:09,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375471,375484] [2021-11-17 12:25:09,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375623,375636] [2021-11-17 12:25:09,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375772,375785] [2021-11-17 12:25:09,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375920,375933] [2021-11-17 12:25:09,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376077,376090] [2021-11-17 12:25:09,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376226,376239] [2021-11-17 12:25:09,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376382,376395] [2021-11-17 12:25:09,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376535,376548] [2021-11-17 12:25:09,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376681,376694] [2021-11-17 12:25:09,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376824,376837] [2021-11-17 12:25:09,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376976,376989] [2021-11-17 12:25:09,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[377122,377135] [2021-11-17 12:25:09,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[377267,377280] [2021-11-17 12:25:09,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[377421,377434] [2021-11-17 12:25:09,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[377572,377585] [2021-11-17 12:25:09,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[377727,377740] [2021-11-17 12:25:09,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[377879,377892] [2021-11-17 12:25:09,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[378034,378047] [2021-11-17 12:25:09,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[378198,378211] [2021-11-17 12:25:09,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[378354,378367] [2021-11-17 12:25:09,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[378518,378531] [2021-11-17 12:25:09,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[378660,378673] [2021-11-17 12:25:09,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[378818,378831] [2021-11-17 12:25:09,774 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[378985,378998] [2021-11-17 12:25:09,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[379144,379157] [2021-11-17 12:25:09,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[379303,379316] [2021-11-17 12:25:09,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[379452,379465] [2021-11-17 12:25:09,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[379599,379612] [2021-11-17 12:25:09,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[379738,379751] [2021-11-17 12:25:09,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[379901,379914] [2021-11-17 12:25:09,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[380067,380080] [2021-11-17 12:25:09,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[380231,380244] [2021-11-17 12:25:09,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[380396,380409] [2021-11-17 12:25:09,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[380561,380574] [2021-11-17 12:25:09,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[380727,380740] [2021-11-17 12:25:09,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[380892,380905] [2021-11-17 12:25:09,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381059,381072] [2021-11-17 12:25:09,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381219,381232] [2021-11-17 12:25:09,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381381,381394] [2021-11-17 12:25:09,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381540,381553] [2021-11-17 12:25:09,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381686,381699] [2021-11-17 12:25:09,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381829,381842] [2021-11-17 12:25:09,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381973,381986] [2021-11-17 12:25:09,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382116,382129] [2021-11-17 12:25:09,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382260,382273] [2021-11-17 12:25:09,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382401,382414] [2021-11-17 12:25:09,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382539,382552] [2021-11-17 12:25:09,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382697,382710] [2021-11-17 12:25:09,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382856,382869] [2021-11-17 12:25:09,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383012,383025] [2021-11-17 12:25:09,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383161,383174] [2021-11-17 12:25:09,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383313,383326] [2021-11-17 12:25:09,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383464,383477] [2021-11-17 12:25:09,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383613,383626] [2021-11-17 12:25:09,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383765,383778] [2021-11-17 12:25:09,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383913,383926] [2021-11-17 12:25:09,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384066,384079] [2021-11-17 12:25:09,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384217,384230] [2021-11-17 12:25:09,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384367,384380] [2021-11-17 12:25:09,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384514,384527] [2021-11-17 12:25:09,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384665,384678] [2021-11-17 12:25:09,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384816,384829] [2021-11-17 12:25:09,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384964,384977] [2021-11-17 12:25:09,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385130,385143] [2021-11-17 12:25:09,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385299,385312] [2021-11-17 12:25:09,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385466,385479] [2021-11-17 12:25:09,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385634,385647] [2021-11-17 12:25:09,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385784,385797] [2021-11-17 12:25:09,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385931,385944] [2021-11-17 12:25:09,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386092,386105] [2021-11-17 12:25:09,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386262,386275] [2021-11-17 12:25:09,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386424,386437] [2021-11-17 12:25:09,801 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:25:09,818 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 12:25:10,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373036,373049] [2021-11-17 12:25:10,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373181,373194] [2021-11-17 12:25:10,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373327,373340] [2021-11-17 12:25:10,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373492,373505] [2021-11-17 12:25:10,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373650,373663] [2021-11-17 12:25:10,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373808,373821] [2021-11-17 12:25:10,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[373966,373979] [2021-11-17 12:25:10,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374126,374139] [2021-11-17 12:25:10,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374285,374298] [2021-11-17 12:25:10,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374424,374437] [2021-11-17 12:25:10,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374566,374579] [2021-11-17 12:25:10,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374715,374728] [2021-11-17 12:25:10,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[374854,374867] [2021-11-17 12:25:10,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375009,375022] [2021-11-17 12:25:10,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375169,375182] [2021-11-17 12:25:10,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375320,375333] [2021-11-17 12:25:10,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375471,375484] [2021-11-17 12:25:10,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375623,375636] [2021-11-17 12:25:10,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375772,375785] [2021-11-17 12:25:10,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375920,375933] [2021-11-17 12:25:10,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376077,376090] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[376226,376239] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[376382,376395] [2021-11-17 12:25:10,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376535,376548] [2021-11-17 12:25:10,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376681,376694] [2021-11-17 12:25:10,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376824,376837] [2021-11-17 12:25:10,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[376976,376989] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[377122,377135] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[377267,377280] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[377421,377434] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[377572,377585] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[377727,377740] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[377879,377892] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[378034,378047] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[378198,378211] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[378354,378367] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[378518,378531] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[378660,378673] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[378818,378831] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[378985,378998] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[379144,379157] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[379303,379316] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[379452,379465] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[379599,379612] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[379738,379751] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[379901,379914] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[380067,380080] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[380231,380244] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[380396,380409] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[380561,380574] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[380727,380740] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[380892,380905] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[381059,381072] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[381219,381232] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[381381,381394] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[381540,381553] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[381686,381699] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[381829,381842] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[381973,381986] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[382116,382129] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[382260,382273] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[382401,382414] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[382539,382552] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[382697,382710] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[382856,382869] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[383012,383025] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[383161,383174] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[383313,383326] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[383464,383477] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[383613,383626] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[383765,383778] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[383913,383926] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[384066,384079] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[384217,384230] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[384367,384380] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[384514,384527] [2021-11-17 12:25:10,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--block--xen-blkfront.ko.cil.i[384665,384678] [2021-11-17 12:25:10,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384816,384829] [2021-11-17 12:25:10,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384964,384977] [2021-11-17 12:25:10,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385130,385143] [2021-11-17 12:25:10,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385299,385312] [2021-11-17 12:25:10,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385466,385479] [2021-11-17 12:25:10,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385634,385647] [2021-11-17 12:25:10,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385784,385797] [2021-11-17 12:25:10,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385931,385944] [2021-11-17 12:25:10,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386092,386105] [2021-11-17 12:25:10,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386262,386275] [2021-11-17 12:25:10,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386424,386437] [2021-11-17 12:25:10,118 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 12:25:10,280 INFO L208 MainTranslator]: Completed translation [2021-11-17 12:25:10,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10 WrapperNode [2021-11-17 12:25:10,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 12:25:10,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 12:25:10,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 12:25:10,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 12:25:10,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,522 INFO L137 Inliner]: procedures = 675, calls = 2831, calls flagged for inlining = 316, calls inlined = 216, statements flattened = 5799 [2021-11-17 12:25:10,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 12:25:10,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 12:25:10,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 12:25:10,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 12:25:10,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 12:25:10,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 12:25:10,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 12:25:10,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 12:25:10,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (1/1) ... [2021-11-17 12:25:10,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 12:25:10,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:25:10,732 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) [2021-11-17 12:25:10,746 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 [2021-11-17 12:25:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_frontend_closed [2021-11-17 12:25:10,756 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_frontend_closed [2021-11-17 12:25:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2021-11-17 12:25:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:25:10,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 12:25:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 12:25:10,757 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 12:25:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 12:25:10,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 12:25:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:25:10,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 12:25:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_del_gendisk [2021-11-17 12:25:10,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_del_gendisk [2021-11-17 12:25:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 12:25:10,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 12:25:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure submit_bio [2021-11-17 12:25:10,758 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_bio [2021-11-17 12:25:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure queue_flag_set_unlocked [2021-11-17 12:25:10,758 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_flag_set_unlocked [2021-11-17 12:25:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_cancel_free_callback [2021-11-17 12:25:10,758 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_cancel_free_callback [2021-11-17 12:25:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:25:10,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 12:25:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_end_foreign_access [2021-11-17 12:25:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_end_foreign_access [2021-11-17 12:25:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:25:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 12:25:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure do_blkif_request [2021-11-17 12:25:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure do_blkif_request [2021-11-17 12:25:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_pages [2021-11-17 12:25:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_pages [2021-11-17 12:25:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 12:25:10,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 12:25:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure talk_to_blkback [2021-11-17 12:25:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure talk_to_blkback [2021-11-17 12:25:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 12:25:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 12:25:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:25:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 12:25:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure blkfront_setup_indirect [2021-11-17 12:25:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure blkfront_setup_indirect [2021-11-17 12:25:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 12:25:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure pfn_to_mfn [2021-11-17 12:25:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure pfn_to_mfn [2021-11-17 12:25:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-11-17 12:25:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-11-17 12:25:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:25:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 12:25:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure xlvbd_release_gendisk [2021-11-17 12:25:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure xlvbd_release_gendisk [2021-11-17 12:25:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure xlbd_release_minors [2021-11-17 12:25:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure xlbd_release_minors [2021-11-17 12:25:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 12:25:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure xlvbd_flush [2021-11-17 12:25:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure xlvbd_flush [2021-11-17 12:25:10,762 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2021-11-17 12:25:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2021-11-17 12:25:10,762 INFO L130 BoogieDeclarations]: Found specification of procedure sg_page [2021-11-17 12:25:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_page [2021-11-17 12:25:10,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 12:25:10,762 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_switch_state [2021-11-17 12:25:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_switch_state [2021-11-17 12:25:10,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-11-17 12:25:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-11-17 12:25:10,763 INFO L130 BoogieDeclarations]: Found specification of procedure flush_work [2021-11-17 12:25:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_work [2021-11-17 12:25:10,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 12:25:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 12:25:10,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2021-11-17 12:25:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2021-11-17 12:25:10,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:25:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 12:25:10,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 12:25:10,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:25:10,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 12:25:10,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-11-17 12:25:10,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-11-17 12:25:10,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 12:25:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 12:25:10,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:25:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 12:25:10,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-11-17 12:25:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-11-17 12:25:10,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 12:25:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 12:25:10,768 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2021-11-17 12:25:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2021-11-17 12:25:10,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:25:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 12:25:10,768 INFO L130 BoogieDeclarations]: Found specification of procedure get_grant [2021-11-17 12:25:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure get_grant [2021-11-17 12:25:10,769 INFO L130 BoogieDeclarations]: Found specification of procedure sg_next [2021-11-17 12:25:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_next [2021-11-17 12:25:10,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:25:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 12:25:10,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 12:25:10,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_calloc [2021-11-17 12:25:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_calloc [2021-11-17 12:25:10,769 INFO L130 BoogieDeclarations]: Found specification of procedure get_phys_to_machine [2021-11-17 12:25:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure get_phys_to_machine [2021-11-17 12:25:10,769 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-11-17 12:25:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-11-17 12:25:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 12:25:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_bd_mutex_of_block_device [2021-11-17 12:25:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_bd_mutex_of_block_device [2021-11-17 12:25:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 12:25:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 12:25:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 12:25:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure __blk_end_request_all [2021-11-17 12:25:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __blk_end_request_all [2021-11-17 12:25:10,770 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-17 12:25:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-11-17 12:25:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-11-17 12:25:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_io_lock_of_blkfront_info [2021-11-17 12:25:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_io_lock_of_blkfront_info [2021-11-17 12:25:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure kmap_atomic [2021-11-17 12:25:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap_atomic [2021-11-17 12:25:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_blkfront_mutex [2021-11-17 12:25:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_blkfront_mutex [2021-11-17 12:25:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure blkif_free [2021-11-17 12:25:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure blkif_free [2021-11-17 12:25:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:25:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 12:25:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2021-11-17 12:25:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2021-11-17 12:25:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 12:25:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 12:25:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_blkfront_info [2021-11-17 12:25:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_blkfront_info [2021-11-17 12:25:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure blk_stop_queue [2021-11-17 12:25:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_stop_queue [2021-11-17 12:25:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_blkfront_info [2021-11-17 12:25:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_blkfront_info [2021-11-17 12:25:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 12:25:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 12:25:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 12:25:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 12:25:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure bdput [2021-11-17 12:25:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure bdput [2021-11-17 12:25:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 12:25:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 12:25:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure del_gendisk [2021-11-17 12:25:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure del_gendisk [2021-11-17 12:25:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_transaction_end [2021-11-17 12:25:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_transaction_end [2021-11-17 12:25:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2021-11-17 12:25:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2021-11-17 12:25:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_sectors [2021-11-17 12:25:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_sectors [2021-11-17 12:25:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 12:25:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 12:25:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:25:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 12:25:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_pos [2021-11-17 12:25:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_pos [2021-11-17 12:25:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:25:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 12:25:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 12:25:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure __free_pages [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __free_pages [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_107 [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_107 [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_bd_mutex_of_block_device [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_bd_mutex_of_block_device [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure get_capacity [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure get_capacity [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_blkfront_mutex [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_blkfront_mutex [2021-11-17 12:25:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 12:25:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure blk_requeue_request [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_requeue_request [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure bio_segments [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_segments [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_io_lock_of_blkfront_info [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_io_lock_of_blkfront_info [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 12:25:10,813 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:25:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure kick_pending_request_queues [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure kick_pending_request_queues [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_96 [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_96 [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_97 [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_97 [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure bdget_disk [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure bdget_disk [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_merge [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_merge [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segments [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segments [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure encode_disk_name [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_disk_name [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 12:25:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2021-11-17 12:25:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2021-11-17 12:25:11,325 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 12:25:11,327 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 12:25:11,543 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 12:25:26,766 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 12:25:26,784 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 12:25:26,784 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-17 12:25:26,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:25:26 BoogieIcfgContainer [2021-11-17 12:25:26,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 12:25:26,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 12:25:26,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 12:25:26,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 12:25:26,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:25:07" (1/3) ... [2021-11-17 12:25:26,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e261c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:26, skipping insertion in model container [2021-11-17 12:25:26,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:10" (2/3) ... [2021-11-17 12:25:26,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e261c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:26, skipping insertion in model container [2021-11-17 12:25:26,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:25:26" (3/3) ... [2021-11-17 12:25:26,794 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i [2021-11-17 12:25:26,797 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 12:25:26,797 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-11-17 12:25:26,842 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 12:25:26,851 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 12:25:26,851 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-11-17 12:25:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1231 states have (on average 1.3249390739236393) internal successors, (1631), 1291 states have internal predecessors, (1631), 374 states have call successors, (374), 109 states have call predecessors, (374), 108 states have return successors, (370), 368 states have call predecessors, (370), 370 states have call successors, (370) [2021-11-17 12:25:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-17 12:25:26,895 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:26,896 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:25:26,896 INFO L402 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 32 more)] === [2021-11-17 12:25:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 978063183, now seen corresponding path program 1 times [2021-11-17 12:25:26,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:26,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80532213] [2021-11-17 12:25:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:26,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:27,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:25:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:25:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:25:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:25:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:25:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:25:27,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:27,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80532213] [2021-11-17 12:25:27,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80532213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:27,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:27,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:25:27,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180893049] [2021-11-17 12:25:27,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:27,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:25:27,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:27,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:25:27,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:25:27,456 INFO L87 Difference]: Start difference. First operand has 1748 states, 1231 states have (on average 1.3249390739236393) internal successors, (1631), 1291 states have internal predecessors, (1631), 374 states have call successors, (374), 109 states have call predecessors, (374), 108 states have return successors, (370), 368 states have call predecessors, (370), 370 states have call successors, (370) Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-17 12:25:28,991 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:33,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:37,571 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:38,679 INFO L93 Difference]: Finished difference Result 3440 states and 4793 transitions. [2021-11-17 12:25:38,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:25:38,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2021-11-17 12:25:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:38,699 INFO L225 Difference]: With dead ends: 3440 [2021-11-17 12:25:38,699 INFO L226 Difference]: Without dead ends: 1712 [2021-11-17 12:25:38,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:25:38,719 INFO L933 BasicCegarLoop]: 2105 mSDtfsCounter, 3543 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 1398 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3744 SdHoareTripleChecker+Valid, 4531 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1398 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:38,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3744 Valid, 4531 Invalid, 3051 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1398 Valid, 1651 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2021-11-17 12:25:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2021-11-17 12:25:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2021-11-17 12:25:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1202 states have (on average 1.2612312811980033) internal successors, (1516), 1258 states have internal predecessors, (1516), 370 states have call successors, (370), 108 states have call predecessors, (370), 107 states have return successors, (368), 366 states have call predecessors, (368), 368 states have call successors, (368) [2021-11-17 12:25:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2254 transitions. [2021-11-17 12:25:38,852 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2254 transitions. Word has length 50 [2021-11-17 12:25:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:38,855 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2254 transitions. [2021-11-17 12:25:38,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-17 12:25:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2254 transitions. [2021-11-17 12:25:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-17 12:25:38,862 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:38,862 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:25:38,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 12:25:38,862 INFO L402 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 32 more)] === [2021-11-17 12:25:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1447234358, now seen corresponding path program 1 times [2021-11-17 12:25:38,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:38,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981824091] [2021-11-17 12:25:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:38,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:25:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:25:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:25:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:25:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:25:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:25:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:25:39,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:39,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981824091] [2021-11-17 12:25:39,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981824091] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:39,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:39,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:25:39,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217769908] [2021-11-17 12:25:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:39,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:25:39,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:39,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:25:39,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:25:39,139 INFO L87 Difference]: Start difference. First operand 1712 states and 2254 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 12:25:46,577 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:50,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:53,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:57,709 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:25:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:25:59,302 INFO L93 Difference]: Finished difference Result 3371 states and 4447 transitions. [2021-11-17 12:25:59,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:25:59,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2021-11-17 12:25:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:25:59,319 INFO L225 Difference]: With dead ends: 3371 [2021-11-17 12:25:59,319 INFO L226 Difference]: Without dead ends: 3369 [2021-11-17 12:25:59,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:25:59,324 INFO L933 BasicCegarLoop]: 2324 mSDtfsCounter, 5227 mSDsluCounter, 3803 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 2419 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5419 SdHoareTripleChecker+Valid, 6127 SdHoareTripleChecker+Invalid, 5879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2419 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:25:59,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5419 Valid, 6127 Invalid, 5879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2419 Valid, 3456 Invalid, 4 Unknown, 0 Unchecked, 19.5s Time] [2021-11-17 12:25:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2021-11-17 12:25:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3175. [2021-11-17 12:25:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 2256 states have (on average 1.2650709219858156) internal successors, (2854), 2338 states have internal predecessors, (2854), 691 states have call successors, (691), 196 states have call predecessors, (691), 195 states have return successors, (697), 681 states have call predecessors, (697), 689 states have call successors, (697) [2021-11-17 12:25:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4242 transitions. [2021-11-17 12:25:59,459 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4242 transitions. Word has length 56 [2021-11-17 12:25:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:25:59,459 INFO L470 AbstractCegarLoop]: Abstraction has 3175 states and 4242 transitions. [2021-11-17 12:25:59,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 12:25:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4242 transitions. [2021-11-17 12:25:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-17 12:25:59,463 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:25:59,463 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:25:59,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 12:25:59,464 INFO L402 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 32 more)] === [2021-11-17 12:25:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:25:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash 129867478, now seen corresponding path program 1 times [2021-11-17 12:25:59,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:25:59,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611001424] [2021-11-17 12:25:59,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:25:59,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:25:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:25:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:25:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:25:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:25:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:25:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:25:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:25:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:25:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:25:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:25:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:25:59,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:25:59,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611001424] [2021-11-17 12:25:59,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611001424] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:25:59,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:25:59,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:25:59,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563320384] [2021-11-17 12:25:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:25:59,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:25:59,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:25:59,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:25:59,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:25:59,720 INFO L87 Difference]: Start difference. First operand 3175 states and 4242 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (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) [2021-11-17 12:26:06,098 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:11,694 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:15,534 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:17,625 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:18,737 INFO L93 Difference]: Finished difference Result 6309 states and 8436 transitions. [2021-11-17 12:26:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:26:18,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (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 62 [2021-11-17 12:26:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:18,764 INFO L225 Difference]: With dead ends: 6309 [2021-11-17 12:26:18,764 INFO L226 Difference]: Without dead ends: 6307 [2021-11-17 12:26:18,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 12:26:18,772 INFO L933 BasicCegarLoop]: 2348 mSDtfsCounter, 5253 mSDsluCounter, 3855 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 2435 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5446 SdHoareTripleChecker+Valid, 6203 SdHoareTripleChecker+Invalid, 5887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2435 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:18,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5446 Valid, 6203 Invalid, 5887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2435 Valid, 3448 Invalid, 4 Unknown, 0 Unchecked, 18.4s Time] [2021-11-17 12:26:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2021-11-17 12:26:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 6124. [2021-11-17 12:26:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 4377 states have (on average 1.2670779072424034) internal successors, (5546), 4510 states have internal predecessors, (5546), 1340 states have call successors, (1340), 375 states have call predecessors, (1340), 374 states have return successors, (1362), 1319 states have call predecessors, (1362), 1338 states have call successors, (1362) [2021-11-17 12:26:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 8248 transitions. [2021-11-17 12:26:19,017 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 8248 transitions. Word has length 62 [2021-11-17 12:26:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:19,017 INFO L470 AbstractCegarLoop]: Abstraction has 6124 states and 8248 transitions. [2021-11-17 12:26:19,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (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) [2021-11-17 12:26:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 8248 transitions. [2021-11-17 12:26:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-17 12:26:19,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:19,019 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:26:19,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 12:26:19,020 INFO L402 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 32 more)] === [2021-11-17 12:26:19,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash 77930130, now seen corresponding path program 1 times [2021-11-17 12:26:19,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:19,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033209520] [2021-11-17 12:26:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:19,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:26:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:26:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:26:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:26:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:26:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:26:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:26:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:26:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:26:19,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:19,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033209520] [2021-11-17 12:26:19,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033209520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:19,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:19,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:26:19,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175535033] [2021-11-17 12:26:19,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:19,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:26:19,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:19,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:26:19,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:26:19,227 INFO L87 Difference]: Start difference. First operand 6124 states and 8248 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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) [2021-11-17 12:26:21,242 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:27,456 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:28,880 INFO L93 Difference]: Finished difference Result 6124 states and 8248 transitions. [2021-11-17 12:26:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:26:28,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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 68 [2021-11-17 12:26:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:28,905 INFO L225 Difference]: With dead ends: 6124 [2021-11-17 12:26:28,905 INFO L226 Difference]: Without dead ends: 6122 [2021-11-17 12:26:28,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:26:28,910 INFO L933 BasicCegarLoop]: 2087 mSDtfsCounter, 3511 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3707 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:28,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3707 Valid, 4495 Invalid, 3031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1639 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2021-11-17 12:26:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6122 states. [2021-11-17 12:26:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6122 to 6122. [2021-11-17 12:26:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6122 states, 4376 states have (on average 1.2669104204753199) internal successors, (5544), 4508 states have internal predecessors, (5544), 1340 states have call successors, (1340), 375 states have call predecessors, (1340), 374 states have return successors, (1362), 1319 states have call predecessors, (1362), 1338 states have call successors, (1362) [2021-11-17 12:26:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6122 states to 6122 states and 8246 transitions. [2021-11-17 12:26:29,091 INFO L78 Accepts]: Start accepts. Automaton has 6122 states and 8246 transitions. Word has length 68 [2021-11-17 12:26:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:29,092 INFO L470 AbstractCegarLoop]: Abstraction has 6122 states and 8246 transitions. [2021-11-17 12:26:29,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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) [2021-11-17 12:26:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6122 states and 8246 transitions. [2021-11-17 12:26:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-17 12:26:29,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:29,095 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:26:29,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 12:26:29,095 INFO L402 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 32 more)] === [2021-11-17 12:26:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1629920272, now seen corresponding path program 1 times [2021-11-17 12:26:29,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:29,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160819816] [2021-11-17 12:26:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:29,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:26:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:26:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:26:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:26:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:26:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:26:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:26:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:26:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:26:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:26:29,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:29,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160819816] [2021-11-17 12:26:29,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160819816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:29,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:29,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:26:29,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150739601] [2021-11-17 12:26:29,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:29,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:26:29,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:29,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:26:29,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:26:29,337 INFO L87 Difference]: Start difference. First operand 6122 states and 8246 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (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) [2021-11-17 12:26:34,086 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:38,188 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:39,407 INFO L93 Difference]: Finished difference Result 6122 states and 8246 transitions. [2021-11-17 12:26:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:26:39,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (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 74 [2021-11-17 12:26:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:39,430 INFO L225 Difference]: With dead ends: 6122 [2021-11-17 12:26:39,430 INFO L226 Difference]: Without dead ends: 6120 [2021-11-17 12:26:39,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:26:39,433 INFO L933 BasicCegarLoop]: 2085 mSDtfsCounter, 3505 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3700 SdHoareTripleChecker+Valid, 4493 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:39,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3700 Valid, 4493 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1637 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2021-11-17 12:26:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2021-11-17 12:26:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 6120. [2021-11-17 12:26:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6120 states, 4375 states have (on average 1.2667428571428572) internal successors, (5542), 4506 states have internal predecessors, (5542), 1340 states have call successors, (1340), 375 states have call predecessors, (1340), 374 states have return successors, (1362), 1319 states have call predecessors, (1362), 1338 states have call successors, (1362) [2021-11-17 12:26:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 8244 transitions. [2021-11-17 12:26:39,598 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 8244 transitions. Word has length 74 [2021-11-17 12:26:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:39,599 INFO L470 AbstractCegarLoop]: Abstraction has 6120 states and 8244 transitions. [2021-11-17 12:26:39,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (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) [2021-11-17 12:26:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 8244 transitions. [2021-11-17 12:26:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-17 12:26:39,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:39,600 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:26:39,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 12:26:39,600 INFO L402 AbstractCegarLoop]: === Iteration 6 === 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 32 more)] === [2021-11-17 12:26:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1067365840, now seen corresponding path program 1 times [2021-11-17 12:26:39,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:39,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83361930] [2021-11-17 12:26:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:39,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:26:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:26:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:26:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:26:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:26:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:26:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:26:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:26:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:26:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:26:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:26:39,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:39,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83361930] [2021-11-17 12:26:39,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83361930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:39,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:39,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:26:39,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997891257] [2021-11-17 12:26:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:39,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:26:39,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:26:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:26:39,852 INFO L87 Difference]: Start difference. First operand 6120 states and 8244 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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) [2021-11-17 12:26:43,668 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:48,314 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:26:49,580 INFO L93 Difference]: Finished difference Result 6120 states and 8244 transitions. [2021-11-17 12:26:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:26:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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 80 [2021-11-17 12:26:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:26:49,601 INFO L225 Difference]: With dead ends: 6120 [2021-11-17 12:26:49,602 INFO L226 Difference]: Without dead ends: 6118 [2021-11-17 12:26:49,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:26:49,605 INFO L933 BasicCegarLoop]: 2083 mSDtfsCounter, 3499 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3693 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:26:49,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3693 Valid, 4491 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1635 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2021-11-17 12:26:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6118 states. [2021-11-17 12:26:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6118 to 6118. [2021-11-17 12:26:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6118 states, 4374 states have (on average 1.266575217192501) internal successors, (5540), 4504 states have internal predecessors, (5540), 1340 states have call successors, (1340), 375 states have call predecessors, (1340), 374 states have return successors, (1362), 1319 states have call predecessors, (1362), 1338 states have call successors, (1362) [2021-11-17 12:26:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6118 states to 6118 states and 8242 transitions. [2021-11-17 12:26:49,776 INFO L78 Accepts]: Start accepts. Automaton has 6118 states and 8242 transitions. Word has length 80 [2021-11-17 12:26:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:26:49,777 INFO L470 AbstractCegarLoop]: Abstraction has 6118 states and 8242 transitions. [2021-11-17 12:26:49,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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) [2021-11-17 12:26:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 6118 states and 8242 transitions. [2021-11-17 12:26:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-17 12:26:49,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:26:49,780 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:26:49,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 12:26:49,781 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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 32 more)] === [2021-11-17 12:26:49,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:26:49,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1911493740, now seen corresponding path program 1 times [2021-11-17 12:26:49,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:26:49,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14259751] [2021-11-17 12:26:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:26:49,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:26:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:26:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:26:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:26:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:26:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:26:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:26:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:26:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:26:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:26:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:26:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:26:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:50,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:26:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:26:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:26:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:26:50,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:26:50,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14259751] [2021-11-17 12:26:50,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14259751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:26:50,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:26:50,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:26:50,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088451721] [2021-11-17 12:26:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:26:50,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:26:50,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:26:50,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:26:50,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:26:50,031 INFO L87 Difference]: Start difference. First operand 6118 states and 8242 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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) [2021-11-17 12:26:52,049 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:26:54,137 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:00,194 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:01,321 INFO L93 Difference]: Finished difference Result 6118 states and 8242 transitions. [2021-11-17 12:27:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:27:01,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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 86 [2021-11-17 12:27:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:01,337 INFO L225 Difference]: With dead ends: 6118 [2021-11-17 12:27:01,337 INFO L226 Difference]: Without dead ends: 6116 [2021-11-17 12:27:01,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:27:01,339 INFO L933 BasicCegarLoop]: 2081 mSDtfsCounter, 3493 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 1390 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3686 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:01,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3686 Valid, 4489 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1632 Invalid, 3 Unknown, 0 Unchecked, 11.0s Time] [2021-11-17 12:27:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6116 states. [2021-11-17 12:27:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6116 to 6116. [2021-11-17 12:27:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6116 states, 4373 states have (on average 1.26640750057169) internal successors, (5538), 4502 states have internal predecessors, (5538), 1340 states have call successors, (1340), 375 states have call predecessors, (1340), 374 states have return successors, (1362), 1319 states have call predecessors, (1362), 1338 states have call successors, (1362) [2021-11-17 12:27:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6116 states to 6116 states and 8240 transitions. [2021-11-17 12:27:01,525 INFO L78 Accepts]: Start accepts. Automaton has 6116 states and 8240 transitions. Word has length 86 [2021-11-17 12:27:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:01,526 INFO L470 AbstractCegarLoop]: Abstraction has 6116 states and 8240 transitions. [2021-11-17 12:27:01,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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) [2021-11-17 12:27:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6116 states and 8240 transitions. [2021-11-17 12:27:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-17 12:27:01,529 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:01,529 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:27:01,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 12:27:01,530 INFO L402 AbstractCegarLoop]: === Iteration 8 === 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 32 more)] === [2021-11-17 12:27:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1715100088, now seen corresponding path program 1 times [2021-11-17 12:27:01,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:01,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538684688] [2021-11-17 12:27:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:01,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:27:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:27:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:27:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:27:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:27:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:27:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:27:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:27:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:27:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:27:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:27:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:27:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:27:01,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:01,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538684688] [2021-11-17 12:27:01,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538684688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:01,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:01,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:27:01,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83232738] [2021-11-17 12:27:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:01,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:27:01,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:27:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:27:01,756 INFO L87 Difference]: Start difference. First operand 6116 states and 8240 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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) [2021-11-17 12:27:03,675 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:07,607 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:11,077 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:14,290 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:15,441 INFO L93 Difference]: Finished difference Result 6548 states and 8750 transitions. [2021-11-17 12:27:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:27:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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 92 [2021-11-17 12:27:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:15,464 INFO L225 Difference]: With dead ends: 6548 [2021-11-17 12:27:15,464 INFO L226 Difference]: Without dead ends: 6546 [2021-11-17 12:27:15,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-17 12:27:15,469 INFO L933 BasicCegarLoop]: 2080 mSDtfsCounter, 3664 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 1465 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3858 SdHoareTripleChecker+Valid, 4509 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1465 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:15,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3858 Valid, 4509 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1465 Valid, 1771 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2021-11-17 12:27:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2021-11-17 12:27:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 6526. [2021-11-17 12:27:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6526 states, 4652 states have (on average 1.2622527944969906) internal successors, (5872), 4784 states have internal predecessors, (5872), 1416 states have call successors, (1416), 431 states have call predecessors, (1416), 430 states have return successors, (1438), 1391 states have call predecessors, (1438), 1414 states have call successors, (1438) [2021-11-17 12:27:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 8726 transitions. [2021-11-17 12:27:15,735 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 8726 transitions. Word has length 92 [2021-11-17 12:27:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:15,736 INFO L470 AbstractCegarLoop]: Abstraction has 6526 states and 8726 transitions. [2021-11-17 12:27:15,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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) [2021-11-17 12:27:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 8726 transitions. [2021-11-17 12:27:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-17 12:27:15,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:15,737 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-11-17 12:27:15,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 12:27:15,737 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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 32 more)] === [2021-11-17 12:27:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1274599851, now seen corresponding path program 1 times [2021-11-17 12:27:15,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:15,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427131484] [2021-11-17 12:27:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:15,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:27:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:27:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:27:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:27:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:27:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:16,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:27:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 12:27:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-17 12:27:16,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:16,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427131484] [2021-11-17 12:27:16,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427131484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:16,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:16,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:27:16,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134349825] [2021-11-17 12:27:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:16,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:27:16,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:27:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:27:16,076 INFO L87 Difference]: Start difference. First operand 6526 states and 8726 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 12:27:18,093 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:19,414 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:25,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:27,692 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:31,733 INFO L93 Difference]: Finished difference Result 13417 states and 18135 transitions. [2021-11-17 12:27:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:27:31,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2021-11-17 12:27:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:31,757 INFO L225 Difference]: With dead ends: 13417 [2021-11-17 12:27:31,757 INFO L226 Difference]: Without dead ends: 6918 [2021-11-17 12:27:31,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-17 12:27:31,779 INFO L933 BasicCegarLoop]: 2175 mSDtfsCounter, 2467 mSDsluCounter, 5330 mSDsCounter, 0 mSdLazyCounter, 2914 mSolverCounterSat, 628 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2729 SdHoareTripleChecker+Valid, 7505 SdHoareTripleChecker+Invalid, 3545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 2914 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:31,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2729 Valid, 7505 Invalid, 3545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 2914 Invalid, 3 Unknown, 0 Unchecked, 15.1s Time] [2021-11-17 12:27:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2021-11-17 12:27:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 6526. [2021-11-17 12:27:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6526 states, 4652 states have (on average 1.2605331040412726) internal successors, (5864), 4784 states have internal predecessors, (5864), 1416 states have call successors, (1416), 431 states have call predecessors, (1416), 430 states have return successors, (1438), 1391 states have call predecessors, (1438), 1414 states have call successors, (1438) [2021-11-17 12:27:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 8718 transitions. [2021-11-17 12:27:32,065 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 8718 transitions. Word has length 113 [2021-11-17 12:27:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:32,065 INFO L470 AbstractCegarLoop]: Abstraction has 6526 states and 8718 transitions. [2021-11-17 12:27:32,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 12:27:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 8718 transitions. [2021-11-17 12:27:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-17 12:27:32,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:32,067 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-11-17 12:27:32,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 12:27:32,068 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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 32 more)] === [2021-11-17 12:27:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1274659433, now seen corresponding path program 1 times [2021-11-17 12:27:32,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:32,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750601650] [2021-11-17 12:27:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:32,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:27:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:27:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:27:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:27:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:27:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:27:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 12:27:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:32,307 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-17 12:27:32,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:32,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750601650] [2021-11-17 12:27:32,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750601650] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:32,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:32,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 12:27:32,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460029432] [2021-11-17 12:27:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:32,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 12:27:32,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 12:27:32,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:27:32,309 INFO L87 Difference]: Start difference. First operand 6526 states and 8718 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-17 12:27:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:37,252 INFO L93 Difference]: Finished difference Result 6918 states and 9362 transitions. [2021-11-17 12:27:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 12:27:37,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2021-11-17 12:27:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:37,269 INFO L225 Difference]: With dead ends: 6918 [2021-11-17 12:27:37,269 INFO L226 Difference]: Without dead ends: 6916 [2021-11-17 12:27:37,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:27:37,273 INFO L933 BasicCegarLoop]: 2178 mSDtfsCounter, 546 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 6515 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:37,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 6515 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2021-11-17 12:27:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2021-11-17 12:27:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 6524. [2021-11-17 12:27:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6524 states, 4651 states have (on average 1.2588690604171147) internal successors, (5855), 4782 states have internal predecessors, (5855), 1416 states have call successors, (1416), 431 states have call predecessors, (1416), 430 states have return successors, (1438), 1391 states have call predecessors, (1438), 1414 states have call successors, (1438) [2021-11-17 12:27:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6524 states to 6524 states and 8709 transitions. [2021-11-17 12:27:37,563 INFO L78 Accepts]: Start accepts. Automaton has 6524 states and 8709 transitions. Word has length 113 [2021-11-17 12:27:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:37,563 INFO L470 AbstractCegarLoop]: Abstraction has 6524 states and 8709 transitions. [2021-11-17 12:27:37,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-17 12:27:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6524 states and 8709 transitions. [2021-11-17 12:27:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-17 12:27:37,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:37,565 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:27:37,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 12:27:37,566 INFO L402 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 32 more)] === [2021-11-17 12:27:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1056393611, now seen corresponding path program 1 times [2021-11-17 12:27:37,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:37,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175555301] [2021-11-17 12:27:37,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:37,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:27:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:27:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:27:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:27:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:27:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:27:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:27:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:27:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:27:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:27:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:27:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:27:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:27:37,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:37,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175555301] [2021-11-17 12:27:37,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175555301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:37,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:37,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:27:37,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261044590] [2021-11-17 12:27:37,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:37,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:27:37,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:27:37,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:27:37,756 INFO L87 Difference]: Start difference. First operand 6524 states and 8709 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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) [2021-11-17 12:27:39,774 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:43,441 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:47,444 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:49,933 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:51,210 INFO L93 Difference]: Finished difference Result 6524 states and 8709 transitions. [2021-11-17 12:27:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:27:51,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 [2021-11-17 12:27:51,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:51,229 INFO L225 Difference]: With dead ends: 6524 [2021-11-17 12:27:51,230 INFO L226 Difference]: Without dead ends: 6522 [2021-11-17 12:27:51,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:27:51,235 INFO L933 BasicCegarLoop]: 2074 mSDtfsCounter, 3470 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 1390 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3662 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:51,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3662 Valid, 4482 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1624 Invalid, 4 Unknown, 0 Unchecked, 13.1s Time] [2021-11-17 12:27:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6522 states. [2021-11-17 12:27:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6522 to 6522. [2021-11-17 12:27:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6522 states, 4650 states have (on average 1.258709677419355) internal successors, (5853), 4780 states have internal predecessors, (5853), 1416 states have call successors, (1416), 431 states have call predecessors, (1416), 430 states have return successors, (1438), 1391 states have call predecessors, (1438), 1414 states have call successors, (1438) [2021-11-17 12:27:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6522 states to 6522 states and 8707 transitions. [2021-11-17 12:27:51,478 INFO L78 Accepts]: Start accepts. Automaton has 6522 states and 8707 transitions. Word has length 94 [2021-11-17 12:27:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:51,479 INFO L470 AbstractCegarLoop]: Abstraction has 6522 states and 8707 transitions. [2021-11-17 12:27:51,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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) [2021-11-17 12:27:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6522 states and 8707 transitions. [2021-11-17 12:27:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-17 12:27:51,480 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:51,480 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-11-17 12:27:51,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 12:27:51,481 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:27:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1657990063, now seen corresponding path program 1 times [2021-11-17 12:27:51,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:51,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691762397] [2021-11-17 12:27:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:51,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:27:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:27:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:27:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:27:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:27:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:27:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:27:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:27:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-17 12:27:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-11-17 12:27:51,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:51,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691762397] [2021-11-17 12:27:51,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691762397] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:51,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:51,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 12:27:51,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699372349] [2021-11-17 12:27:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:51,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 12:27:51,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 12:27:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 12:27:51,666 INFO L87 Difference]: Start difference. First operand 6522 states and 8707 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 12:27:53,685 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:27:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:27:56,166 INFO L93 Difference]: Finished difference Result 13391 states and 18072 transitions. [2021-11-17 12:27:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 12:27:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2021-11-17 12:27:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:27:56,185 INFO L225 Difference]: With dead ends: 13391 [2021-11-17 12:27:56,185 INFO L226 Difference]: Without dead ends: 6896 [2021-11-17 12:27:56,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:27:56,204 INFO L933 BasicCegarLoop]: 2169 mSDtfsCounter, 2430 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 625 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2691 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:27:56,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2691 Valid, 3134 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 498 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2021-11-17 12:27:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6896 states. [2021-11-17 12:27:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6896 to 6504. [2021-11-17 12:27:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6504 states, 4633 states have (on average 1.2562054824088065) internal successors, (5820), 4762 states have internal predecessors, (5820), 1416 states have call successors, (1416), 431 states have call predecessors, (1416), 430 states have return successors, (1438), 1391 states have call predecessors, (1438), 1414 states have call successors, (1438) [2021-11-17 12:27:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 8674 transitions. [2021-11-17 12:27:56,449 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 8674 transitions. Word has length 117 [2021-11-17 12:27:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:27:56,451 INFO L470 AbstractCegarLoop]: Abstraction has 6504 states and 8674 transitions. [2021-11-17 12:27:56,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 12:27:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 8674 transitions. [2021-11-17 12:27:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-17 12:27:56,452 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:27:56,452 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:27:56,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 12:27:56,452 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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 32 more)] === [2021-11-17 12:27:56,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:27:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1910334215, now seen corresponding path program 1 times [2021-11-17 12:27:56,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:27:56,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825501853] [2021-11-17 12:27:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:27:56,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:27:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:27:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:27:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:27:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:27:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:27:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:27:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:27:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:27:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:27:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:27:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:27:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:27:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:27:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:27:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:27:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:27:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:27:56,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:27:56,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825501853] [2021-11-17 12:27:56,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825501853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:27:56,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:27:56,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:27:56,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567121926] [2021-11-17 12:27:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:27:56,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:27:56,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:27:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:27:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:27:56,644 INFO L87 Difference]: Start difference. First operand 6504 states and 8674 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 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) [2021-11-17 12:28:03,010 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:04,217 INFO L93 Difference]: Finished difference Result 6504 states and 8674 transitions. [2021-11-17 12:28:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:28:04,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 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 [2021-11-17 12:28:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:04,234 INFO L225 Difference]: With dead ends: 6504 [2021-11-17 12:28:04,234 INFO L226 Difference]: Without dead ends: 6502 [2021-11-17 12:28:04,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:28:04,237 INFO L933 BasicCegarLoop]: 2067 mSDtfsCounter, 3451 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 1390 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3642 SdHoareTripleChecker+Valid, 4475 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:04,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3642 Valid, 4475 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1620 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2021-11-17 12:28:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6502 states. [2021-11-17 12:28:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6502 to 6502. [2021-11-17 12:28:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6502 states, 4632 states have (on average 1.2560449050086355) internal successors, (5818), 4760 states have internal predecessors, (5818), 1416 states have call successors, (1416), 431 states have call predecessors, (1416), 430 states have return successors, (1438), 1391 states have call predecessors, (1438), 1414 states have call successors, (1438) [2021-11-17 12:28:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6502 states to 6502 states and 8672 transitions. [2021-11-17 12:28:04,475 INFO L78 Accepts]: Start accepts. Automaton has 6502 states and 8672 transitions. Word has length 100 [2021-11-17 12:28:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:04,476 INFO L470 AbstractCegarLoop]: Abstraction has 6502 states and 8672 transitions. [2021-11-17 12:28:04,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 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) [2021-11-17 12:28:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6502 states and 8672 transitions. [2021-11-17 12:28:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-17 12:28:04,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:04,477 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:28:04,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 12:28:04,478 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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 32 more)] === [2021-11-17 12:28:04,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1855653926, now seen corresponding path program 1 times [2021-11-17 12:28:04,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:04,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778914774] [2021-11-17 12:28:04,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:04,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:28:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:28:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:28:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:28:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:28:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 12:28:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 12:28:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:28:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:28:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:28:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:28:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-11-17 12:28:04,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:04,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778914774] [2021-11-17 12:28:04,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778914774] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:04,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:04,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:28:04,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72659406] [2021-11-17 12:28:04,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:04,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:28:04,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:04,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:28:04,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:28:04,825 INFO L87 Difference]: Start difference. First operand 6502 states and 8672 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:28:16,468 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:18,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:20,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:22,790 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:24,893 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:26,690 INFO L93 Difference]: Finished difference Result 7463 states and 9892 transitions. [2021-11-17 12:28:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:28:26,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2021-11-17 12:28:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:26,704 INFO L225 Difference]: With dead ends: 7463 [2021-11-17 12:28:26,704 INFO L226 Difference]: Without dead ends: 7461 [2021-11-17 12:28:26,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-11-17 12:28:26,706 INFO L933 BasicCegarLoop]: 2095 mSDtfsCounter, 4354 mSDsluCounter, 4285 mSDsCounter, 0 mSdLazyCounter, 3824 mSolverCounterSat, 2211 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4548 SdHoareTripleChecker+Valid, 6380 SdHoareTripleChecker+Invalid, 6040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2211 IncrementalHoareTripleChecker+Valid, 3824 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:26,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4548 Valid, 6380 Invalid, 6040 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2211 Valid, 3824 Invalid, 5 Unknown, 0 Unchecked, 21.1s Time] [2021-11-17 12:28:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2021-11-17 12:28:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7027. [2021-11-17 12:28:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7027 states, 4963 states have (on average 1.2448116058835381) internal successors, (6178), 5094 states have internal predecessors, (6178), 1506 states have call successors, (1506), 535 states have call predecessors, (1506), 534 states have return successors, (1528), 1478 states have call predecessors, (1528), 1504 states have call successors, (1528) [2021-11-17 12:28:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7027 states to 7027 states and 9212 transitions. [2021-11-17 12:28:26,936 INFO L78 Accepts]: Start accepts. Automaton has 7027 states and 9212 transitions. Word has length 147 [2021-11-17 12:28:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:26,936 INFO L470 AbstractCegarLoop]: Abstraction has 7027 states and 9212 transitions. [2021-11-17 12:28:26,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 12:28:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 7027 states and 9212 transitions. [2021-11-17 12:28:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-17 12:28:26,937 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:26,938 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:28:26,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 12:28:26,938 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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 32 more)] === [2021-11-17 12:28:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:26,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1613407075, now seen corresponding path program 1 times [2021-11-17 12:28:26,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:26,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436599761] [2021-11-17 12:28:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:26,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:28:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:28:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:28:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:28:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:28:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:28:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:28:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:28:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:28:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:28:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:28:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:28:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:28:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:28:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:28:27,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:27,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436599761] [2021-11-17 12:28:27,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436599761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:27,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:27,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:28:27,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835409615] [2021-11-17 12:28:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:27,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:28:27,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:27,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:28:27,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:28:27,148 INFO L87 Difference]: Start difference. First operand 7027 states and 9212 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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) [2021-11-17 12:28:28,547 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:33,987 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:36,486 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:37,648 INFO L93 Difference]: Finished difference Result 7027 states and 9212 transitions. [2021-11-17 12:28:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:28:37,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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 [2021-11-17 12:28:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:37,666 INFO L225 Difference]: With dead ends: 7027 [2021-11-17 12:28:37,666 INFO L226 Difference]: Without dead ends: 7025 [2021-11-17 12:28:37,671 INFO L932 BasicCegarLoop]: 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 [2021-11-17 12:28:37,673 INFO L933 BasicCegarLoop]: 2065 mSDtfsCounter, 3445 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3635 SdHoareTripleChecker+Valid, 4473 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:37,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3635 Valid, 4473 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1617 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2021-11-17 12:28:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2021-11-17 12:28:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7025. [2021-11-17 12:28:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7025 states, 4962 states have (on average 1.2446594115276097) internal successors, (6176), 5092 states have internal predecessors, (6176), 1506 states have call successors, (1506), 535 states have call predecessors, (1506), 534 states have return successors, (1528), 1478 states have call predecessors, (1528), 1504 states have call successors, (1528) [2021-11-17 12:28:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 9210 transitions. [2021-11-17 12:28:37,898 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 9210 transitions. Word has length 106 [2021-11-17 12:28:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:37,898 INFO L470 AbstractCegarLoop]: Abstraction has 7025 states and 9210 transitions. [2021-11-17 12:28:37,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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) [2021-11-17 12:28:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 9210 transitions. [2021-11-17 12:28:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-17 12:28:37,900 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:37,900 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:28:37,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 12:28:37,900 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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 32 more)] === [2021-11-17 12:28:37,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:37,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1782742789, now seen corresponding path program 1 times [2021-11-17 12:28:37,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:37,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71212403] [2021-11-17 12:28:37,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:37,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:28:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:28:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:28:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:28:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:28:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:28:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:28:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:28:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:28:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:28:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:28:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:28:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:28:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:28:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:28:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:28:38,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:38,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71212403] [2021-11-17 12:28:38,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71212403] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:38,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:38,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:28:38,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158569188] [2021-11-17 12:28:38,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:38,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:28:38,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:38,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:28:38,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:28:38,161 INFO L87 Difference]: Start difference. First operand 7025 states and 9210 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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) [2021-11-17 12:28:39,970 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:41,204 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:45,065 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:49,077 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:28:50,247 INFO L93 Difference]: Finished difference Result 7025 states and 9210 transitions. [2021-11-17 12:28:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:28:50,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 112 [2021-11-17 12:28:50,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:28:50,261 INFO L225 Difference]: With dead ends: 7025 [2021-11-17 12:28:50,261 INFO L226 Difference]: Without dead ends: 7023 [2021-11-17 12:28:50,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:28:50,263 INFO L933 BasicCegarLoop]: 2063 mSDtfsCounter, 3439 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3628 SdHoareTripleChecker+Valid, 4471 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:28:50,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3628 Valid, 4471 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1615 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2021-11-17 12:28:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2021-11-17 12:28:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 7023. [2021-11-17 12:28:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7023 states, 4961 states have (on average 1.2445071558153598) internal successors, (6174), 5090 states have internal predecessors, (6174), 1506 states have call successors, (1506), 535 states have call predecessors, (1506), 534 states have return successors, (1528), 1478 states have call predecessors, (1528), 1504 states have call successors, (1528) [2021-11-17 12:28:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 9208 transitions. [2021-11-17 12:28:50,485 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 9208 transitions. Word has length 112 [2021-11-17 12:28:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:28:50,485 INFO L470 AbstractCegarLoop]: Abstraction has 7023 states and 9208 transitions. [2021-11-17 12:28:50,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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) [2021-11-17 12:28:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 9208 transitions. [2021-11-17 12:28:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-17 12:28:50,487 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:28:50,487 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2021-11-17 12:28:50,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 12:28:50,487 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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 32 more)] === [2021-11-17 12:28:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:28:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1112358725, now seen corresponding path program 1 times [2021-11-17 12:28:50,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:28:50,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443734202] [2021-11-17 12:28:50,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:28:50,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:28:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:28:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:28:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:28:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:28:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:28:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:28:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 12:28:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 12:28:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:28:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:28:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:28:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:28:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:28:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:28:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:28:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:28:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:28:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-11-17 12:28:50,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:28:50,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443734202] [2021-11-17 12:28:50,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443734202] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:28:50,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:28:50,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:28:50,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782163129] [2021-11-17 12:28:50,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:28:50,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:28:50,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:28:50,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:28:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:28:50,892 INFO L87 Difference]: Start difference. First operand 7023 states and 9208 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:28:52,909 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:54,402 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:28:56,514 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:02,510 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:04,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:07,121 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:09,208 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:14,805 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:17,286 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:19,294 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:21,328 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:29:23,728 INFO L93 Difference]: Finished difference Result 7896 states and 10347 transitions. [2021-11-17 12:29:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:29:23,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 159 [2021-11-17 12:29:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:29:23,743 INFO L225 Difference]: With dead ends: 7896 [2021-11-17 12:29:23,743 INFO L226 Difference]: Without dead ends: 7894 [2021-11-17 12:29:23,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-11-17 12:29:23,746 INFO L933 BasicCegarLoop]: 2061 mSDtfsCounter, 5427 mSDsluCounter, 4873 mSDsCounter, 0 mSdLazyCounter, 3937 mSolverCounterSat, 2856 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5622 SdHoareTripleChecker+Valid, 6934 SdHoareTripleChecker+Invalid, 6802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2856 IncrementalHoareTripleChecker+Valid, 3937 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:29:23,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5622 Valid, 6934 Invalid, 6802 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2856 Valid, 3937 Invalid, 9 Unknown, 0 Unchecked, 32.0s Time] [2021-11-17 12:29:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7894 states. [2021-11-17 12:29:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7894 to 7324. [2021-11-17 12:29:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7324 states, 5158 states have (on average 1.239046141915471) internal successors, (6391), 5288 states have internal predecessors, (6391), 1553 states have call successors, (1553), 592 states have call predecessors, (1553), 591 states have return successors, (1575), 1524 states have call predecessors, (1575), 1551 states have call successors, (1575) [2021-11-17 12:29:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 9519 transitions. [2021-11-17 12:29:23,985 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 9519 transitions. Word has length 159 [2021-11-17 12:29:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:29:23,985 INFO L470 AbstractCegarLoop]: Abstraction has 7324 states and 9519 transitions. [2021-11-17 12:29:23,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:29:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 9519 transitions. [2021-11-17 12:29:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:29:23,987 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:29:23,987 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:29:23,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 12:29:23,987 INFO L402 AbstractCegarLoop]: === Iteration 18 === 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 32 more)] === [2021-11-17 12:29:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:29:23,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1114967044, now seen corresponding path program 1 times [2021-11-17 12:29:23,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:29:23,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755843191] [2021-11-17 12:29:23,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:29:23,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:29:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:29:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:29:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:29:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:29:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:29:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:29:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 12:29:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 12:29:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:29:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:29:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:29:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:29:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:29:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:29:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:29:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:29:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:29:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-11-17 12:29:24,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:29:24,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755843191] [2021-11-17 12:29:24,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755843191] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:29:24,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:29:24,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:29:24,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093344070] [2021-11-17 12:29:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:29:24,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:29:24,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:29:24,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:29:24,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:29:24,425 INFO L87 Difference]: Start difference. First operand 7324 states and 9519 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2021-11-17 12:29:26,441 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:29,356 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:35,091 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:39,480 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:45,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:48,527 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:50,938 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:52,948 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:54,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:29:57,017 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:00,023 INFO L93 Difference]: Finished difference Result 7758 states and 10190 transitions. [2021-11-17 12:30:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-17 12:30:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2021-11-17 12:30:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:00,041 INFO L225 Difference]: With dead ends: 7758 [2021-11-17 12:30:00,041 INFO L226 Difference]: Without dead ends: 7756 [2021-11-17 12:30:00,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-11-17 12:30:00,045 INFO L933 BasicCegarLoop]: 2173 mSDtfsCounter, 3549 mSDsluCounter, 5604 mSDsCounter, 0 mSdLazyCounter, 5485 mSolverCounterSat, 2432 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3562 SdHoareTripleChecker+Valid, 7777 SdHoareTripleChecker+Invalid, 7926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2432 IncrementalHoareTripleChecker+Valid, 5485 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:00,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3562 Valid, 7777 Invalid, 7926 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2432 Valid, 5485 Invalid, 9 Unknown, 0 Unchecked, 34.8s Time] [2021-11-17 12:30:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7756 states. [2021-11-17 12:30:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7756 to 7324. [2021-11-17 12:30:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7324 states, 5158 states have (on average 1.2382706475378054) internal successors, (6387), 5288 states have internal predecessors, (6387), 1553 states have call successors, (1553), 592 states have call predecessors, (1553), 591 states have return successors, (1575), 1524 states have call predecessors, (1575), 1551 states have call successors, (1575) [2021-11-17 12:30:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 9515 transitions. [2021-11-17 12:30:00,324 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 9515 transitions. Word has length 160 [2021-11-17 12:30:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:00,325 INFO L470 AbstractCegarLoop]: Abstraction has 7324 states and 9515 transitions. [2021-11-17 12:30:00,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2021-11-17 12:30:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 9515 transitions. [2021-11-17 12:30:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-17 12:30:00,326 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:00,326 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:30:00,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 12:30:00,326 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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 32 more)] === [2021-11-17 12:30:00,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1350917253, now seen corresponding path program 1 times [2021-11-17 12:30:00,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:00,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888332752] [2021-11-17 12:30:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:00,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:30:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:30:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:30:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:30:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:30:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:30:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:30:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:30:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:30:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:30:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:30:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:30:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:30:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:30:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:30:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:30:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:30:00,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:00,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888332752] [2021-11-17 12:30:00,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888332752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:00,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:00,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:30:00,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346997492] [2021-11-17 12:30:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:00,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:30:00,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:00,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:30:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:30:00,532 INFO L87 Difference]: Start difference. First operand 7324 states and 9515 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (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) [2021-11-17 12:30:02,550 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:04,112 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:07,750 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:12,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:13,645 INFO L93 Difference]: Finished difference Result 7324 states and 9515 transitions. [2021-11-17 12:30:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:30:13,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (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 118 [2021-11-17 12:30:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:13,662 INFO L225 Difference]: With dead ends: 7324 [2021-11-17 12:30:13,662 INFO L226 Difference]: Without dead ends: 7322 [2021-11-17 12:30:13,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:30:13,665 INFO L933 BasicCegarLoop]: 2061 mSDtfsCounter, 3433 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 1390 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3621 SdHoareTripleChecker+Valid, 4469 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:13,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3621 Valid, 4469 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1612 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2021-11-17 12:30:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7322 states. [2021-11-17 12:30:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7322 to 7322. [2021-11-17 12:30:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7322 states, 5157 states have (on average 1.2381229396936204) internal successors, (6385), 5286 states have internal predecessors, (6385), 1553 states have call successors, (1553), 592 states have call predecessors, (1553), 591 states have return successors, (1575), 1524 states have call predecessors, (1575), 1551 states have call successors, (1575) [2021-11-17 12:30:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7322 states to 7322 states and 9513 transitions. [2021-11-17 12:30:13,924 INFO L78 Accepts]: Start accepts. Automaton has 7322 states and 9513 transitions. Word has length 118 [2021-11-17 12:30:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:13,924 INFO L470 AbstractCegarLoop]: Abstraction has 7322 states and 9513 transitions. [2021-11-17 12:30:13,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (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) [2021-11-17 12:30:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7322 states and 9513 transitions. [2021-11-17 12:30:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-17 12:30:13,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:13,926 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:30:13,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 12:30:13,927 INFO L402 AbstractCegarLoop]: === Iteration 20 === 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 32 more)] === [2021-11-17 12:30:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2110545786, now seen corresponding path program 1 times [2021-11-17 12:30:13,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:13,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335155458] [2021-11-17 12:30:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:13,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:30:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:30:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:30:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:30:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:30:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:30:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:30:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:30:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:30:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:30:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:30:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:30:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:30:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:30:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:30:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:30:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:30:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:30:14,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:14,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335155458] [2021-11-17 12:30:14,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335155458] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:14,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:14,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:30:14,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223085503] [2021-11-17 12:30:14,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:14,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:30:14,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:30:14,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:30:14,115 INFO L87 Difference]: Start difference. First operand 7322 states and 9513 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (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) [2021-11-17 12:30:15,772 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:19,219 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:23,755 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:24,958 INFO L93 Difference]: Finished difference Result 7322 states and 9513 transitions. [2021-11-17 12:30:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:30:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (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 124 [2021-11-17 12:30:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:24,974 INFO L225 Difference]: With dead ends: 7322 [2021-11-17 12:30:24,974 INFO L226 Difference]: Without dead ends: 7320 [2021-11-17 12:30:24,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:30:24,976 INFO L933 BasicCegarLoop]: 2059 mSDtfsCounter, 3427 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3614 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:24,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3614 Valid, 4467 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1611 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2021-11-17 12:30:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2021-11-17 12:30:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 7320. [2021-11-17 12:30:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7320 states, 5156 states have (on average 1.2379751745539178) internal successors, (6383), 5284 states have internal predecessors, (6383), 1553 states have call successors, (1553), 592 states have call predecessors, (1553), 591 states have return successors, (1575), 1524 states have call predecessors, (1575), 1551 states have call successors, (1575) [2021-11-17 12:30:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7320 states to 7320 states and 9511 transitions. [2021-11-17 12:30:25,287 INFO L78 Accepts]: Start accepts. Automaton has 7320 states and 9511 transitions. Word has length 124 [2021-11-17 12:30:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:25,287 INFO L470 AbstractCegarLoop]: Abstraction has 7320 states and 9511 transitions. [2021-11-17 12:30:25,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (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) [2021-11-17 12:30:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 7320 states and 9511 transitions. [2021-11-17 12:30:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-17 12:30:25,289 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:25,290 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2021-11-17 12:30:25,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 12:30:25,290 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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 32 more)] === [2021-11-17 12:30:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 879317444, now seen corresponding path program 1 times [2021-11-17 12:30:25,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:25,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702700239] [2021-11-17 12:30:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:25,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:30:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:30:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:30:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:30:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:30:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 12:30:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 12:30:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:30:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:30:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:30:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:30:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:30:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:30:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:30:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-17 12:30:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2021-11-17 12:30:25,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:25,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702700239] [2021-11-17 12:30:25,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702700239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:25,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:25,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 12:30:25,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25522956] [2021-11-17 12:30:25,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:25,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 12:30:25,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 12:30:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:30:25,787 INFO L87 Difference]: Start difference. First operand 7320 states and 9511 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (22), 8 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2021-11-17 12:30:34,248 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:36,337 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:38,417 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:46,624 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:48,691 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:50,702 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:52,727 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:30:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:30:55,788 INFO L93 Difference]: Finished difference Result 7752 states and 10181 transitions. [2021-11-17 12:30:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 12:30:55,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (22), 8 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 172 [2021-11-17 12:30:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:30:55,804 INFO L225 Difference]: With dead ends: 7752 [2021-11-17 12:30:55,804 INFO L226 Difference]: Without dead ends: 7750 [2021-11-17 12:30:55,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-11-17 12:30:55,807 INFO L933 BasicCegarLoop]: 2170 mSDtfsCounter, 4403 mSDsluCounter, 6252 mSDsCounter, 0 mSdLazyCounter, 5637 mSolverCounterSat, 3041 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4408 SdHoareTripleChecker+Valid, 8422 SdHoareTripleChecker+Invalid, 8685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3041 IncrementalHoareTripleChecker+Valid, 5637 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:30:55,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4408 Valid, 8422 Invalid, 8685 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3041 Valid, 5637 Invalid, 7 Unknown, 0 Unchecked, 29.1s Time] [2021-11-17 12:30:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7750 states. [2021-11-17 12:30:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7750 to 7320. [2021-11-17 12:30:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7320 states, 5156 states have (on average 1.236423584173778) internal successors, (6375), 5284 states have internal predecessors, (6375), 1553 states have call successors, (1553), 592 states have call predecessors, (1553), 591 states have return successors, (1575), 1524 states have call predecessors, (1575), 1551 states have call successors, (1575) [2021-11-17 12:30:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7320 states to 7320 states and 9503 transitions. [2021-11-17 12:30:56,121 INFO L78 Accepts]: Start accepts. Automaton has 7320 states and 9503 transitions. Word has length 172 [2021-11-17 12:30:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:30:56,122 INFO L470 AbstractCegarLoop]: Abstraction has 7320 states and 9503 transitions. [2021-11-17 12:30:56,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (22), 8 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2021-11-17 12:30:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 7320 states and 9503 transitions. [2021-11-17 12:30:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-17 12:30:56,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:30:56,123 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:30:56,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-17 12:30:56,124 INFO L402 AbstractCegarLoop]: === Iteration 22 === 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 32 more)] === [2021-11-17 12:30:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:30:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash -918574393, now seen corresponding path program 1 times [2021-11-17 12:30:56,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:30:56,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199849144] [2021-11-17 12:30:56,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:30:56,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:30:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:30:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:30:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:30:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:30:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:30:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:30:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:30:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:30:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:30:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:30:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:30:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:30:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:30:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:30:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:30:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:30:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:30:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:30:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:30:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:30:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:30:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:30:56,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:30:56,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199849144] [2021-11-17 12:30:56,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199849144] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:30:56,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:30:56,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:30:56,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448438616] [2021-11-17 12:30:56,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:30:56,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:30:56,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:30:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:30:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:30:56,358 INFO L87 Difference]: Start difference. First operand 7320 states and 9503 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (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) [2021-11-17 12:30:58,543 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:02,577 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:06,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:08,543 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:10,871 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:12,154 INFO L93 Difference]: Finished difference Result 7320 states and 9503 transitions. [2021-11-17 12:31:12,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:31:12,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (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 130 [2021-11-17 12:31:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:12,166 INFO L225 Difference]: With dead ends: 7320 [2021-11-17 12:31:12,166 INFO L226 Difference]: Without dead ends: 7318 [2021-11-17 12:31:12,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:31:12,167 INFO L933 BasicCegarLoop]: 2057 mSDtfsCounter, 3421 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 1390 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3607 SdHoareTripleChecker+Valid, 4465 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:12,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3607 Valid, 4465 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1606 Invalid, 5 Unknown, 0 Unchecked, 15.3s Time] [2021-11-17 12:31:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7318 states. [2021-11-17 12:31:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7318 to 7318. [2021-11-17 12:31:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7318 states, 5155 states have (on average 1.2362754607177497) internal successors, (6373), 5282 states have internal predecessors, (6373), 1553 states have call successors, (1553), 592 states have call predecessors, (1553), 591 states have return successors, (1575), 1524 states have call predecessors, (1575), 1551 states have call successors, (1575) [2021-11-17 12:31:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7318 states to 7318 states and 9501 transitions. [2021-11-17 12:31:12,436 INFO L78 Accepts]: Start accepts. Automaton has 7318 states and 9501 transitions. Word has length 130 [2021-11-17 12:31:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:31:12,436 INFO L470 AbstractCegarLoop]: Abstraction has 7318 states and 9501 transitions. [2021-11-17 12:31:12,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (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) [2021-11-17 12:31:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 7318 states and 9501 transitions. [2021-11-17 12:31:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-17 12:31:12,438 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:31:12,438 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:31:12,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-17 12:31:12,439 INFO L402 AbstractCegarLoop]: === Iteration 23 === 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 32 more)] === [2021-11-17 12:31:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:31:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1479957857, now seen corresponding path program 1 times [2021-11-17 12:31:12,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:31:12,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918849132] [2021-11-17 12:31:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:31:12,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:31:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:31:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:31:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:31:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:31:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:31:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:31:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:31:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:31:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:31:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:31:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:31:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:31:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:31:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 12:31:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:31:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-11-17 12:31:12,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:31:12,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918849132] [2021-11-17 12:31:12,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918849132] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:31:12,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:31:12,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:31:12,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784836207] [2021-11-17 12:31:12,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:31:12,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:31:12,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:31:12,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:31:12,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:31:12,686 INFO L87 Difference]: Start difference. First operand 7318 states and 9501 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:31:17,872 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:20,795 INFO L93 Difference]: Finished difference Result 8162 states and 10585 transitions. [2021-11-17 12:31:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:31:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 157 [2021-11-17 12:31:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:20,813 INFO L225 Difference]: With dead ends: 8162 [2021-11-17 12:31:20,813 INFO L226 Difference]: Without dead ends: 8160 [2021-11-17 12:31:20,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:31:20,816 INFO L933 BasicCegarLoop]: 2176 mSDtfsCounter, 1983 mSDsluCounter, 4742 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 545 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 6918 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:20,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2203 Valid, 6918 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1890 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2021-11-17 12:31:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8160 states. [2021-11-17 12:31:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8160 to 7625. [2021-11-17 12:31:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7625 states, 5380 states have (on average 1.2340148698884759) internal successors, (6639), 5507 states have internal predecessors, (6639), 1568 states have call successors, (1568), 659 states have call predecessors, (1568), 658 states have return successors, (1590), 1539 states have call predecessors, (1590), 1566 states have call successors, (1590) [2021-11-17 12:31:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7625 states to 7625 states and 9797 transitions. [2021-11-17 12:31:21,137 INFO L78 Accepts]: Start accepts. Automaton has 7625 states and 9797 transitions. Word has length 157 [2021-11-17 12:31:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:31:21,138 INFO L470 AbstractCegarLoop]: Abstraction has 7625 states and 9797 transitions. [2021-11-17 12:31:21,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 12:31:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7625 states and 9797 transitions. [2021-11-17 12:31:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-17 12:31:21,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:31:21,139 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:31:21,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-17 12:31:21,140 INFO L402 AbstractCegarLoop]: === Iteration 24 === 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 32 more)] === [2021-11-17 12:31:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:31:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 986839772, now seen corresponding path program 1 times [2021-11-17 12:31:21,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:31:21,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789663977] [2021-11-17 12:31:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:31:21,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:31:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:31:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:31:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:31:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:31:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:31:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:31:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:31:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:31:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:31:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:31:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:31:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:31:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:31:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:31:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:31:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:31:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:31:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:31:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:31:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:31:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:31:21,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:31:21,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789663977] [2021-11-17 12:31:21,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789663977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:31:21,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:31:21,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:31:21,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042709356] [2021-11-17 12:31:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:31:21,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:31:21,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:31:21,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:31:21,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:31:21,339 INFO L87 Difference]: Start difference. First operand 7625 states and 9797 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (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) [2021-11-17 12:31:23,616 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:29,238 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:32,113 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:33,376 INFO L93 Difference]: Finished difference Result 7641 states and 9817 transitions. [2021-11-17 12:31:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 12:31:33,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (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 136 [2021-11-17 12:31:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:33,390 INFO L225 Difference]: With dead ends: 7641 [2021-11-17 12:31:33,390 INFO L226 Difference]: Without dead ends: 7639 [2021-11-17 12:31:33,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-17 12:31:33,392 INFO L933 BasicCegarLoop]: 2056 mSDtfsCounter, 3572 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 1465 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3759 SdHoareTripleChecker+Valid, 4485 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1465 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:33,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3759 Valid, 4485 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1465 Valid, 1743 Invalid, 3 Unknown, 0 Unchecked, 11.5s Time] [2021-11-17 12:31:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2021-11-17 12:31:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 7623. [2021-11-17 12:31:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7623 states, 5379 states have (on average 1.2338724670013013) internal successors, (6637), 5505 states have internal predecessors, (6637), 1568 states have call successors, (1568), 659 states have call predecessors, (1568), 658 states have return successors, (1590), 1539 states have call predecessors, (1590), 1566 states have call successors, (1590) [2021-11-17 12:31:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7623 states to 7623 states and 9795 transitions. [2021-11-17 12:31:33,670 INFO L78 Accepts]: Start accepts. Automaton has 7623 states and 9795 transitions. Word has length 136 [2021-11-17 12:31:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:31:33,671 INFO L470 AbstractCegarLoop]: Abstraction has 7623 states and 9795 transitions. [2021-11-17 12:31:33,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (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) [2021-11-17 12:31:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 7623 states and 9795 transitions. [2021-11-17 12:31:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-17 12:31:33,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:31:33,672 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:31:33,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-17 12:31:33,672 INFO L402 AbstractCegarLoop]: === Iteration 25 === 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 32 more)] === [2021-11-17 12:31:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:31:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash -965099567, now seen corresponding path program 1 times [2021-11-17 12:31:33,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:31:33,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346740772] [2021-11-17 12:31:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:31:33,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:31:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:31:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:31:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:31:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:31:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:31:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:31:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:31:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:31:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:31:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:31:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:31:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:31:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:31:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:31:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:31:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:31:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:31:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:31:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:31:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:31:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:31:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:31:33,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:31:33,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346740772] [2021-11-17 12:31:33,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346740772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:31:33,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:31:33,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:31:33,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728728185] [2021-11-17 12:31:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:31:33,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:31:33,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:31:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:31:33,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:31:33,889 INFO L87 Difference]: Start difference. First operand 7623 states and 9795 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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) [2021-11-17 12:31:37,792 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:42,446 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:31:43,778 INFO L93 Difference]: Finished difference Result 7623 states and 9795 transitions. [2021-11-17 12:31:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:31:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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 142 [2021-11-17 12:31:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:31:43,795 INFO L225 Difference]: With dead ends: 7623 [2021-11-17 12:31:43,795 INFO L226 Difference]: Without dead ends: 7621 [2021-11-17 12:31:43,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:31:43,799 INFO L933 BasicCegarLoop]: 2053 mSDtfsCounter, 3409 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3593 SdHoareTripleChecker+Valid, 4461 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:31:43,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3593 Valid, 4461 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1605 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2021-11-17 12:31:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7621 states. [2021-11-17 12:31:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7621 to 7621. [2021-11-17 12:31:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7621 states, 5378 states have (on average 1.2337300111565639) internal successors, (6635), 5503 states have internal predecessors, (6635), 1568 states have call successors, (1568), 659 states have call predecessors, (1568), 658 states have return successors, (1590), 1539 states have call predecessors, (1590), 1566 states have call successors, (1590) [2021-11-17 12:31:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7621 states to 7621 states and 9793 transitions. [2021-11-17 12:31:44,127 INFO L78 Accepts]: Start accepts. Automaton has 7621 states and 9793 transitions. Word has length 142 [2021-11-17 12:31:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:31:44,127 INFO L470 AbstractCegarLoop]: Abstraction has 7621 states and 9793 transitions. [2021-11-17 12:31:44,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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) [2021-11-17 12:31:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7621 states and 9793 transitions. [2021-11-17 12:31:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-17 12:31:44,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:31:44,129 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:31:44,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-17 12:31:44,130 INFO L402 AbstractCegarLoop]: === Iteration 26 === 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 32 more)] === [2021-11-17 12:31:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:31:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1796441848, now seen corresponding path program 1 times [2021-11-17 12:31:44,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:31:44,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400767568] [2021-11-17 12:31:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:31:44,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:31:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:31:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:31:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:31:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:31:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:31:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:31:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:31:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:31:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:31:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:31:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:31:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:31:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:31:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:31:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:31:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:31:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:31:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:31:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:31:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:31:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:31:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:31:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:31:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:31:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:31:44,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:31:44,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400767568] [2021-11-17 12:31:44,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400767568] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:31:44,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:31:44,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:31:44,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351277082] [2021-11-17 12:31:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:31:44,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:31:44,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:31:44,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:31:44,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:31:44,342 INFO L87 Difference]: Start difference. First operand 7621 states and 9793 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (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) [2021-11-17 12:31:46,358 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:49,988 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:52,249 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:56,570 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:31:58,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:00,866 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:32:02,143 INFO L93 Difference]: Finished difference Result 7621 states and 9793 transitions. [2021-11-17 12:32:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:32:02,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (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 148 [2021-11-17 12:32:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:32:02,158 INFO L225 Difference]: With dead ends: 7621 [2021-11-17 12:32:02,159 INFO L226 Difference]: Without dead ends: 7619 [2021-11-17 12:32:02,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:32:02,161 INFO L933 BasicCegarLoop]: 2051 mSDtfsCounter, 3403 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 1390 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3586 SdHoareTripleChecker+Valid, 4459 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:32:02,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3586 Valid, 4459 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1599 Invalid, 6 Unknown, 0 Unchecked, 17.3s Time] [2021-11-17 12:32:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7619 states. [2021-11-17 12:32:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7619 to 7619. [2021-11-17 12:32:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7619 states, 5377 states have (on average 1.2335875023247165) internal successors, (6633), 5501 states have internal predecessors, (6633), 1568 states have call successors, (1568), 659 states have call predecessors, (1568), 658 states have return successors, (1590), 1539 states have call predecessors, (1590), 1566 states have call successors, (1590) [2021-11-17 12:32:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7619 states to 7619 states and 9791 transitions. [2021-11-17 12:32:02,493 INFO L78 Accepts]: Start accepts. Automaton has 7619 states and 9791 transitions. Word has length 148 [2021-11-17 12:32:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:02,493 INFO L470 AbstractCegarLoop]: Abstraction has 7619 states and 9791 transitions. [2021-11-17 12:32:02,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (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) [2021-11-17 12:32:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7619 states and 9791 transitions. [2021-11-17 12:32:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-11-17 12:32:02,495 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:02,495 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:32:02,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-17 12:32:02,496 INFO L402 AbstractCegarLoop]: === Iteration 27 === 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 32 more)] === [2021-11-17 12:32:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1238573022, now seen corresponding path program 1 times [2021-11-17 12:32:02,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:02,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286883868] [2021-11-17 12:32:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:02,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:32:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:32:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:32:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:32:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:32:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:32:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:32:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:32:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:32:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:32:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:32:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:32:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:32:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:32:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:32:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:32:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:32:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:32:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:32:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:32:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:32:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:32:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:32:02,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:02,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286883868] [2021-11-17 12:32:02,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286883868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:02,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:02,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:32:02,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193699194] [2021-11-17 12:32:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:02,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:32:02,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:02,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:32:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:32:02,681 INFO L87 Difference]: Start difference. First operand 7619 states and 9791 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (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) [2021-11-17 12:32:06,459 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:11,213 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:32:12,374 INFO L93 Difference]: Finished difference Result 7619 states and 9791 transitions. [2021-11-17 12:32:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:32:12,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (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 154 [2021-11-17 12:32:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:32:12,388 INFO L225 Difference]: With dead ends: 7619 [2021-11-17 12:32:12,388 INFO L226 Difference]: Without dead ends: 7617 [2021-11-17 12:32:12,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:32:12,390 INFO L933 BasicCegarLoop]: 2049 mSDtfsCounter, 3397 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3579 SdHoareTripleChecker+Valid, 4457 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:32:12,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3579 Valid, 4457 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1601 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2021-11-17 12:32:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7617 states. [2021-11-17 12:32:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7617 to 7617. [2021-11-17 12:32:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7617 states, 5376 states have (on average 1.2334449404761905) internal successors, (6631), 5499 states have internal predecessors, (6631), 1568 states have call successors, (1568), 659 states have call predecessors, (1568), 658 states have return successors, (1590), 1539 states have call predecessors, (1590), 1566 states have call successors, (1590) [2021-11-17 12:32:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7617 states to 7617 states and 9789 transitions. [2021-11-17 12:32:12,732 INFO L78 Accepts]: Start accepts. Automaton has 7617 states and 9789 transitions. Word has length 154 [2021-11-17 12:32:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:12,732 INFO L470 AbstractCegarLoop]: Abstraction has 7617 states and 9789 transitions. [2021-11-17 12:32:12,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (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) [2021-11-17 12:32:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7617 states and 9789 transitions. [2021-11-17 12:32:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-17 12:32:12,734 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:12,734 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:32:12,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-17 12:32:12,735 INFO L402 AbstractCegarLoop]: === Iteration 28 === 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 32 more)] === [2021-11-17 12:32:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash 883056991, now seen corresponding path program 1 times [2021-11-17 12:32:12,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:12,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550004446] [2021-11-17 12:32:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:12,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:32:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:32:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:32:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:32:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:32:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:32:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:32:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:32:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:32:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:32:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:32:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:32:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:32:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:32:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:32:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:32:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:32:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:32:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:32:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:32:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:32:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:32:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:32:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:32:12,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:12,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550004446] [2021-11-17 12:32:12,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550004446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:12,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:12,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:32:12,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763243802] [2021-11-17 12:32:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:12,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:32:12,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:32:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:32:12,945 INFO L87 Difference]: Start difference. First operand 7617 states and 9789 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (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) [2021-11-17 12:32:19,363 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:32:20,679 INFO L93 Difference]: Finished difference Result 7617 states and 9789 transitions. [2021-11-17 12:32:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:32:20,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (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 160 [2021-11-17 12:32:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:32:20,693 INFO L225 Difference]: With dead ends: 7617 [2021-11-17 12:32:20,693 INFO L226 Difference]: Without dead ends: 7615 [2021-11-17 12:32:20,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:32:20,695 INFO L933 BasicCegarLoop]: 2047 mSDtfsCounter, 3391 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 1390 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3572 SdHoareTripleChecker+Valid, 4455 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:32:20,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3572 Valid, 4455 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1600 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2021-11-17 12:32:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7615 states. [2021-11-17 12:32:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7615 to 7615. [2021-11-17 12:32:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7615 states, 5375 states have (on average 1.2333023255813953) internal successors, (6629), 5497 states have internal predecessors, (6629), 1568 states have call successors, (1568), 659 states have call predecessors, (1568), 658 states have return successors, (1590), 1539 states have call predecessors, (1590), 1566 states have call successors, (1590) [2021-11-17 12:32:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7615 states to 7615 states and 9787 transitions. [2021-11-17 12:32:21,052 INFO L78 Accepts]: Start accepts. Automaton has 7615 states and 9787 transitions. Word has length 160 [2021-11-17 12:32:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:21,053 INFO L470 AbstractCegarLoop]: Abstraction has 7615 states and 9787 transitions. [2021-11-17 12:32:21,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (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) [2021-11-17 12:32:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7615 states and 9787 transitions. [2021-11-17 12:32:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-11-17 12:32:21,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:21,055 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:32:21,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-17 12:32:21,055 INFO L402 AbstractCegarLoop]: === Iteration 29 === 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 32 more)] === [2021-11-17 12:32:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1353205139, now seen corresponding path program 1 times [2021-11-17 12:32:21,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:21,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594064948] [2021-11-17 12:32:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:21,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:32:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:32:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:32:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:32:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:32:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:32:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 12:32:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-17 12:32:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-17 12:32:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-17 12:32:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-17 12:32:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-17 12:32:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-17 12:32:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-17 12:32:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:32:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-17 12:32:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:32:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-17 12:32:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-17 12:32:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-17 12:32:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-11-17 12:32:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:32:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:32:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-17 12:32:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 12:32:21,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:21,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594064948] [2021-11-17 12:32:21,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594064948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:21,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:21,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 12:32:21,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296838279] [2021-11-17 12:32:21,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:21,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 12:32:21,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 12:32:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:32:21,268 INFO L87 Difference]: Start difference. First operand 7615 states and 9787 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (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) [2021-11-17 12:32:28,191 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:30,609 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:32,997 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:32:34,369 INFO L93 Difference]: Finished difference Result 7615 states and 9787 transitions. [2021-11-17 12:32:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:32:34,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (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 166 [2021-11-17 12:32:34,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:32:34,386 INFO L225 Difference]: With dead ends: 7615 [2021-11-17 12:32:34,387 INFO L226 Difference]: Without dead ends: 7451 [2021-11-17 12:32:34,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 12:32:34,390 INFO L933 BasicCegarLoop]: 2046 mSDtfsCounter, 3382 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 1390 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3562 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2021-11-17 12:32:34,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3562 Valid, 4454 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1598 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2021-11-17 12:32:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2021-11-17 12:32:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7451. [2021-11-17 12:32:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7451 states, 5279 states have (on average 1.2365978405000948) internal successors, (6528), 5397 states have internal predecessors, (6528), 1522 states have call successors, (1522), 639 states have call predecessors, (1522), 637 states have return successors, (1542), 1495 states have call predecessors, (1542), 1518 states have call successors, (1542) [2021-11-17 12:32:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9592 transitions. [2021-11-17 12:32:34,724 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9592 transitions. Word has length 166 [2021-11-17 12:32:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:32:34,725 INFO L470 AbstractCegarLoop]: Abstraction has 7451 states and 9592 transitions. [2021-11-17 12:32:34,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (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) [2021-11-17 12:32:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9592 transitions. [2021-11-17 12:32:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-11-17 12:32:34,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:32:34,727 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:32:34,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-17 12:32:34,727 INFO L402 AbstractCegarLoop]: === Iteration 30 === 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 32 more)] === [2021-11-17 12:32:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:32:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash 799963522, now seen corresponding path program 1 times [2021-11-17 12:32:34,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:32:34,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080165332] [2021-11-17 12:32:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:32:34,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:32:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:32:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:32:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:32:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:32:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:32:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:32:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:32:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:32:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:32:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:32:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:32:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:32:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:32:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:32:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 12:32:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:32:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-11-17 12:32:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:32:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:32:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-11-17 12:32:34,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:32:34,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080165332] [2021-11-17 12:32:34,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080165332] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:32:34,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:32:34,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 12:32:34,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607361585] [2021-11-17 12:32:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:32:34,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 12:32:34,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:32:34,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 12:32:34,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:32:34,984 INFO L87 Difference]: Start difference. First operand 7451 states and 9592 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:32:37,155 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:40,564 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:42,664 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:44,893 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:47,003 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:49,357 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:54,658 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:57,007 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:32:59,120 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:01,220 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:03,847 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:05,877 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:33:08,604 INFO L93 Difference]: Finished difference Result 17602 states and 23347 transitions. [2021-11-17 12:33:08,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 12:33:08,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 190 [2021-11-17 12:33:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:33:08,625 INFO L225 Difference]: With dead ends: 17602 [2021-11-17 12:33:08,626 INFO L226 Difference]: Without dead ends: 10178 [2021-11-17 12:33:08,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:33:08,644 INFO L933 BasicCegarLoop]: 2778 mSDtfsCounter, 1842 mSDsluCounter, 3603 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 880 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 6381 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 880 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2021-11-17 12:33:08,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2128 Valid, 6381 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [880 Valid, 2391 Invalid, 12 Unknown, 0 Unchecked, 32.9s Time] [2021-11-17 12:33:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10178 states. [2021-11-17 12:33:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10178 to 7467. [2021-11-17 12:33:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7467 states, 5291 states have (on average 1.236061236061236) internal successors, (6540), 5409 states have internal predecessors, (6540), 1526 states have call successors, (1526), 639 states have call predecessors, (1526), 637 states have return successors, (1546), 1499 states have call predecessors, (1546), 1522 states have call successors, (1546) [2021-11-17 12:33:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 9612 transitions. [2021-11-17 12:33:09,074 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 9612 transitions. Word has length 190 [2021-11-17 12:33:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:33:09,075 INFO L470 AbstractCegarLoop]: Abstraction has 7467 states and 9612 transitions. [2021-11-17 12:33:09,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:33:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 9612 transitions. [2021-11-17 12:33:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 12:33:09,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:33:09,078 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:33:09,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-17 12:33:09,079 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_spinlock__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 32 more)] === [2021-11-17 12:33:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:33:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash -120022645, now seen corresponding path program 1 times [2021-11-17 12:33:09,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:33:09,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526316252] [2021-11-17 12:33:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:33:09,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:33:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:33:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:33:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:33:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:33:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:33:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:33:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:33:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:33:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:33:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:33:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:33:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-17 12:33:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:33:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:33:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:33:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:33:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-11-17 12:33:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-11-17 12:33:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-11-17 12:33:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2021-11-17 12:33:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2021-11-17 12:33:09,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:33:09,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526316252] [2021-11-17 12:33:09,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526316252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:33:09,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:33:09,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:33:09,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929211784] [2021-11-17 12:33:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:33:09,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:33:09,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:33:09,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:33:09,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:33:09,405 INFO L87 Difference]: Start difference. First operand 7467 states and 9612 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-17 12:33:10,850 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:15,642 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:17,752 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:19,871 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:21,990 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:24,228 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:26,343 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:28,821 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:33,628 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:38,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:40,395 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:42,410 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:33:45,238 INFO L93 Difference]: Finished difference Result 8005 states and 10451 transitions. [2021-11-17 12:33:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 12:33:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 206 [2021-11-17 12:33:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:33:45,257 INFO L225 Difference]: With dead ends: 8005 [2021-11-17 12:33:45,257 INFO L226 Difference]: Without dead ends: 8003 [2021-11-17 12:33:45,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-17 12:33:45,260 INFO L933 BasicCegarLoop]: 1965 mSDtfsCounter, 1609 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 3989 mSolverCounterSat, 1068 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 6427 SdHoareTripleChecker+Invalid, 5068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1068 IncrementalHoareTripleChecker+Valid, 3989 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:33:45,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1690 Valid, 6427 Invalid, 5068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1068 Valid, 3989 Invalid, 11 Unknown, 0 Unchecked, 35.1s Time] [2021-11-17 12:33:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8003 states. [2021-11-17 12:33:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8003 to 7479. [2021-11-17 12:33:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7479 states, 5297 states have (on average 1.2344723428355673) internal successors, (6539), 5421 states have internal predecessors, (6539), 1526 states have call successors, (1526), 639 states have call predecessors, (1526), 643 states have return successors, (1554), 1499 states have call predecessors, (1554), 1522 states have call successors, (1554) [2021-11-17 12:33:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 9619 transitions. [2021-11-17 12:33:45,673 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 9619 transitions. Word has length 206 [2021-11-17 12:33:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:33:45,674 INFO L470 AbstractCegarLoop]: Abstraction has 7479 states and 9619 transitions. [2021-11-17 12:33:45,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2021-11-17 12:33:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 9619 transitions. [2021-11-17 12:33:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-17 12:33:45,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:33:45,676 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:33:45,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-17 12:33:45,676 INFO L402 AbstractCegarLoop]: === Iteration 32 === 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 32 more)] === [2021-11-17 12:33:45,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:33:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1110947557, now seen corresponding path program 1 times [2021-11-17 12:33:45,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:33:45,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637656601] [2021-11-17 12:33:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:33:45,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:33:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:33:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:33:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:33:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:33:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:33:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:33:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:33:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:33:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:33:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:33:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:33:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:33:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:33:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:33:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 12:33:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:33:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 12:33:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:46,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-11-17 12:33:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:33:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:33:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2021-11-17 12:33:46,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:33:46,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637656601] [2021-11-17 12:33:46,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637656601] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:33:46,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:33:46,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:33:46,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128248736] [2021-11-17 12:33:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:33:46,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:33:46,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:33:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:33:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:33:46,160 INFO L87 Difference]: Start difference. First operand 7479 states and 9619 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:33:48,124 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:50,212 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:55,361 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:57,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:33:59,623 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:01,781 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:04,435 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:06,543 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:08,642 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:10,741 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:12,768 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:14,865 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:16,961 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:19,058 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:21,154 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:23,267 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:27,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:29,139 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:31,129 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:39,665 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:41,681 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:43,703 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:45,717 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:47,744 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:49,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:34:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:34:54,840 INFO L93 Difference]: Finished difference Result 17662 states and 23411 transitions. [2021-11-17 12:34:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 12:34:54,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) Word has length 206 [2021-11-17 12:34:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:34:54,863 INFO L225 Difference]: With dead ends: 17662 [2021-11-17 12:34:54,863 INFO L226 Difference]: Without dead ends: 10210 [2021-11-17 12:34:54,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-11-17 12:34:54,878 INFO L933 BasicCegarLoop]: 2773 mSDtfsCounter, 1843 mSDsluCounter, 11562 mSDsCounter, 0 mSdLazyCounter, 6314 mSolverCounterSat, 883 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 14335 SdHoareTripleChecker+Invalid, 7219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 883 IncrementalHoareTripleChecker+Valid, 6314 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.6s IncrementalHoareTripleChecker+Time [2021-11-17 12:34:54,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2129 Valid, 14335 Invalid, 7219 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [883 Valid, 6314 Invalid, 22 Unknown, 0 Unchecked, 67.6s Time] [2021-11-17 12:34:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10210 states. [2021-11-17 12:34:55,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10210 to 7503. [2021-11-17 12:34:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7503 states, 5313 states have (on average 1.2337662337662338) internal successors, (6555), 5437 states have internal predecessors, (6555), 1526 states have call successors, (1526), 639 states have call predecessors, (1526), 651 states have return successors, (1566), 1507 states have call predecessors, (1566), 1522 states have call successors, (1566) [2021-11-17 12:34:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7503 states to 7503 states and 9647 transitions. [2021-11-17 12:34:55,354 INFO L78 Accepts]: Start accepts. Automaton has 7503 states and 9647 transitions. Word has length 206 [2021-11-17 12:34:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:34:55,354 INFO L470 AbstractCegarLoop]: Abstraction has 7503 states and 9647 transitions. [2021-11-17 12:34:55,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 4 states have call predecessors, (25), 2 states have call successors, (25) [2021-11-17 12:34:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7503 states and 9647 transitions. [2021-11-17 12:34:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-11-17 12:34:55,358 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:34:55,358 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-17 12:34:55,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-17 12:34:55,359 INFO L402 AbstractCegarLoop]: === Iteration 33 === 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 32 more)] === [2021-11-17 12:34:55,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:34:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash -588709909, now seen corresponding path program 1 times [2021-11-17 12:34:55,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:34:55,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781261539] [2021-11-17 12:34:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:34:55,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:34:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:34:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:34:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:34:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:34:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:34:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:34:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:34:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:34:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:34:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:34:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:34:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:34:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:34:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:34:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 12:34:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:34:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 12:34:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 12:34:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:34:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:34:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-11-17 12:34:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:34:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:34:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2021-11-17 12:34:55,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:34:55,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781261539] [2021-11-17 12:34:55,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781261539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:34:55,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:34:55,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:34:55,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145958551] [2021-11-17 12:34:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:34:55,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:34:55,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:34:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:34:55,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:34:55,676 INFO L87 Difference]: Start difference. First operand 7503 states and 9647 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 12:35:00,311 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:02,790 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:04,896 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:12,416 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:14,441 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:16,456 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:35:18,755 INFO L93 Difference]: Finished difference Result 8191 states and 10538 transitions. [2021-11-17 12:35:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 12:35:18,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 222 [2021-11-17 12:35:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:35:18,771 INFO L225 Difference]: With dead ends: 8191 [2021-11-17 12:35:18,772 INFO L226 Difference]: Without dead ends: 8189 [2021-11-17 12:35:18,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-11-17 12:35:18,774 INFO L933 BasicCegarLoop]: 1973 mSDtfsCounter, 2890 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 1441 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 5502 SdHoareTripleChecker+Invalid, 4789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2021-11-17 12:35:18,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3053 Valid, 5502 Invalid, 4789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1441 Valid, 3342 Invalid, 6 Unknown, 0 Unchecked, 22.3s Time] [2021-11-17 12:35:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8189 states. [2021-11-17 12:35:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8189 to 7574. [2021-11-17 12:35:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7574 states, 5369 states have (on average 1.2311417396163158) internal successors, (6610), 5490 states have internal predecessors, (6610), 1516 states have call successors, (1516), 665 states have call predecessors, (1516), 677 states have return successors, (1556), 1499 states have call predecessors, (1556), 1512 states have call successors, (1556) [2021-11-17 12:35:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7574 states to 7574 states and 9682 transitions. [2021-11-17 12:35:19,175 INFO L78 Accepts]: Start accepts. Automaton has 7574 states and 9682 transitions. Word has length 222 [2021-11-17 12:35:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:35:19,175 INFO L470 AbstractCegarLoop]: Abstraction has 7574 states and 9682 transitions. [2021-11-17 12:35:19,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-11-17 12:35:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7574 states and 9682 transitions. [2021-11-17 12:35:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2021-11-17 12:35:19,178 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:35:19,178 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:35:19,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-17 12:35:19,178 INFO L402 AbstractCegarLoop]: === Iteration 34 === 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 32 more)] === [2021-11-17 12:35:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:35:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash -678173082, now seen corresponding path program 1 times [2021-11-17 12:35:19,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:35:19,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237412899] [2021-11-17 12:35:19,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:35:19,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:35:19,224 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 12:35:19,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1902116290] [2021-11-17 12:35:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:35:19,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:35:19,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:35:19,226 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) [2021-11-17 12:35:19,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 12:35:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:19,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 2564 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-17 12:35:19,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:35:20,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-17 12:35:20,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2021-11-17 12:35:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2021-11-17 12:35:20,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:35:20,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:35:20,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237412899] [2021-11-17 12:35:20,328 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-17 12:35:20,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902116290] [2021-11-17 12:35:20,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902116290] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:35:20,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:35:20,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 12:35:20,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478268536] [2021-11-17 12:35:20,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:35:20,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 12:35:20,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:35:20,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 12:35:20,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:35:20,330 INFO L87 Difference]: Start difference. First operand 7574 states and 9682 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:35:21,368 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:23,803 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:27,173 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:35:27,969 INFO L93 Difference]: Finished difference Result 15469 states and 19867 transitions. [2021-11-17 12:35:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:35:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 223 [2021-11-17 12:35:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:35:27,992 INFO L225 Difference]: With dead ends: 15469 [2021-11-17 12:35:27,992 INFO L226 Difference]: Without dead ends: 7922 [2021-11-17 12:35:28,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:35:28,007 INFO L933 BasicCegarLoop]: 2082 mSDtfsCounter, 49 mSDsluCounter, 5938 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 8020 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:35:28,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 8020 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 371 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2021-11-17 12:35:28,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2021-11-17 12:35:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7610. [2021-11-17 12:35:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7610 states, 5405 states have (on average 1.231822386679001) internal successors, (6658), 5526 states have internal predecessors, (6658), 1516 states have call successors, (1516), 665 states have call predecessors, (1516), 677 states have return successors, (1556), 1499 states have call predecessors, (1556), 1512 states have call successors, (1556) [2021-11-17 12:35:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7610 states to 7610 states and 9730 transitions. [2021-11-17 12:35:28,442 INFO L78 Accepts]: Start accepts. Automaton has 7610 states and 9730 transitions. Word has length 223 [2021-11-17 12:35:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:35:28,442 INFO L470 AbstractCegarLoop]: Abstraction has 7610 states and 9730 transitions. [2021-11-17 12:35:28,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-11-17 12:35:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 7610 states and 9730 transitions. [2021-11-17 12:35:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-11-17 12:35:28,445 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:35:28,445 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:35:28,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-17 12:35:28,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-17 12:35:28,660 INFO L402 AbstractCegarLoop]: === Iteration 35 === 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 32 more)] === [2021-11-17 12:35:28,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:35:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash -858096802, now seen corresponding path program 1 times [2021-11-17 12:35:28,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:35:28,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327791393] [2021-11-17 12:35:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:35:28,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:35:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:35:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:35:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:35:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:35:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:35:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:35:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:35:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:35:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:35:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:35:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:35:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:35:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:35:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:35:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:35:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:35:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:28,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:35:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:35:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 12:35:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-17 12:35:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-17 12:35:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 12:35:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:35:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:35:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-11-17 12:35:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 12:35:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:35:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-11-17 12:35:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:35:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2021-11-17 12:35:29,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:35:29,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327791393] [2021-11-17 12:35:29,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327791393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:35:29,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:35:29,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:35:29,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813657731] [2021-11-17 12:35:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:35:29,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:35:29,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:35:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:35:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:35:29,133 INFO L87 Difference]: Start difference. First operand 7610 states and 9730 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 12:35:32,242 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:36,921 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:39,031 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:41,133 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:44,707 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:46,822 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:53,651 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:56,549 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:35:58,898 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:01,004 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:03,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:05,033 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:36:08,284 INFO L93 Difference]: Finished difference Result 8028 states and 10379 transitions. [2021-11-17 12:36:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 12:36:08,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 240 [2021-11-17 12:36:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:36:08,302 INFO L225 Difference]: With dead ends: 8028 [2021-11-17 12:36:08,302 INFO L226 Difference]: Without dead ends: 8026 [2021-11-17 12:36:08,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-17 12:36:08,305 INFO L933 BasicCegarLoop]: 1922 mSDtfsCounter, 2405 mSDsluCounter, 4824 mSDsCounter, 0 mSdLazyCounter, 4639 mSolverCounterSat, 1714 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 6746 SdHoareTripleChecker+Invalid, 6365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1714 IncrementalHoareTripleChecker+Valid, 4639 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:36:08,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2409 Valid, 6746 Invalid, 6365 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1714 Valid, 4639 Invalid, 12 Unknown, 0 Unchecked, 38.2s Time] [2021-11-17 12:36:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8026 states. [2021-11-17 12:36:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8026 to 7608. [2021-11-17 12:36:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7608 states, 5404 states have (on average 1.2311250925240562) internal successors, (6653), 5524 states have internal predecessors, (6653), 1516 states have call successors, (1516), 665 states have call predecessors, (1516), 677 states have return successors, (1556), 1499 states have call predecessors, (1556), 1512 states have call successors, (1556) [2021-11-17 12:36:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7608 states to 7608 states and 9725 transitions. [2021-11-17 12:36:08,703 INFO L78 Accepts]: Start accepts. Automaton has 7608 states and 9725 transitions. Word has length 240 [2021-11-17 12:36:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:36:08,704 INFO L470 AbstractCegarLoop]: Abstraction has 7608 states and 9725 transitions. [2021-11-17 12:36:08,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-11-17 12:36:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7608 states and 9725 transitions. [2021-11-17 12:36:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-11-17 12:36:08,707 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:36:08,707 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:36:08,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-17 12:36:08,707 INFO L402 AbstractCegarLoop]: === Iteration 36 === 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 32 more)] === [2021-11-17 12:36:08,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:36:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1904125414, now seen corresponding path program 1 times [2021-11-17 12:36:08,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:36:08,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305592190] [2021-11-17 12:36:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:08,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:36:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:36:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:36:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:36:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:36:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:36:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:36:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:36:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:36:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:36:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:36:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:36:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:36:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:36:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:36:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:36:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:36:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:36:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:36:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 12:36:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:36:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:08,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 12:36:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:09,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-17 12:36:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 12:36:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 12:36:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:09,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:36:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:09,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-17 12:36:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-11-17 12:36:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2021-11-17 12:36:09,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:36:09,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305592190] [2021-11-17 12:36:09,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305592190] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:36:09,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:36:09,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 12:36:09,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454943493] [2021-11-17 12:36:09,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:36:09,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 12:36:09,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:36:09,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 12:36:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:36:09,040 INFO L87 Difference]: Start difference. First operand 7608 states and 9725 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:36:13,956 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:16,074 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:18,178 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:20,969 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:36:24,966 INFO L93 Difference]: Finished difference Result 16197 states and 21001 transitions. [2021-11-17 12:36:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 12:36:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 245 [2021-11-17 12:36:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:36:24,983 INFO L225 Difference]: With dead ends: 16197 [2021-11-17 12:36:24,983 INFO L226 Difference]: Without dead ends: 8616 [2021-11-17 12:36:24,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:36:24,995 INFO L933 BasicCegarLoop]: 2037 mSDtfsCounter, 903 mSDsluCounter, 5260 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 838 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 7297 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 838 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2021-11-17 12:36:24,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [997 Valid, 7297 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [838 Valid, 1995 Invalid, 4 Unknown, 0 Unchecked, 15.2s Time] [2021-11-17 12:36:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8616 states. [2021-11-17 12:36:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8616 to 7616. [2021-11-17 12:36:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7616 states, 5412 states have (on average 1.2300443458980044) internal successors, (6657), 5532 states have internal predecessors, (6657), 1516 states have call successors, (1516), 665 states have call predecessors, (1516), 677 states have return successors, (1556), 1499 states have call predecessors, (1556), 1512 states have call successors, (1556) [2021-11-17 12:36:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 9729 transitions. [2021-11-17 12:36:25,448 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 9729 transitions. Word has length 245 [2021-11-17 12:36:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:36:25,448 INFO L470 AbstractCegarLoop]: Abstraction has 7616 states and 9729 transitions. [2021-11-17 12:36:25,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 12:36:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 9729 transitions. [2021-11-17 12:36:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2021-11-17 12:36:25,452 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:36:25,452 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-17 12:36:25,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-17 12:36:25,452 INFO L402 AbstractCegarLoop]: === Iteration 37 === 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 32 more)] === [2021-11-17 12:36:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:36:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2034486027, now seen corresponding path program 1 times [2021-11-17 12:36:25,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:36:25,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110415668] [2021-11-17 12:36:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:25,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:36:25,496 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 12:36:25,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293322280] [2021-11-17 12:36:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:25,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:36:25,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:36:25,497 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) [2021-11-17 12:36:25,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 12:36:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:26,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 2924 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 12:36:26,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:36:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-17 12:36:26,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:36:26,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:36:26,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110415668] [2021-11-17 12:36:26,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-17 12:36:26,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293322280] [2021-11-17 12:36:26,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293322280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:36:26,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:36:26,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-17 12:36:26,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055601323] [2021-11-17 12:36:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:36:26,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 12:36:26,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:36:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 12:36:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 12:36:26,623 INFO L87 Difference]: Start difference. First operand 7616 states and 9729 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-17 12:36:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:36:27,066 INFO L93 Difference]: Finished difference Result 15213 states and 19441 transitions. [2021-11-17 12:36:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 12:36:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 317 [2021-11-17 12:36:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:36:27,084 INFO L225 Difference]: With dead ends: 15213 [2021-11-17 12:36:27,084 INFO L226 Difference]: Without dead ends: 7624 [2021-11-17 12:36:27,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 12:36:27,096 INFO L933 BasicCegarLoop]: 2067 mSDtfsCounter, 0 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:36:27,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 12:36:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7624 states. [2021-11-17 12:36:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7624 to 7624. [2021-11-17 12:36:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7624 states, 5420 states have (on average 1.2297047970479704) internal successors, (6665), 5540 states have internal predecessors, (6665), 1516 states have call successors, (1516), 665 states have call predecessors, (1516), 677 states have return successors, (1556), 1499 states have call predecessors, (1556), 1512 states have call successors, (1556) [2021-11-17 12:36:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7624 states to 7624 states and 9737 transitions. [2021-11-17 12:36:27,559 INFO L78 Accepts]: Start accepts. Automaton has 7624 states and 9737 transitions. Word has length 317 [2021-11-17 12:36:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:36:27,559 INFO L470 AbstractCegarLoop]: Abstraction has 7624 states and 9737 transitions. [2021-11-17 12:36:27,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-17 12:36:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 7624 states and 9737 transitions. [2021-11-17 12:36:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2021-11-17 12:36:27,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:36:27,564 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-17 12:36:27,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-17 12:36:27,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-17 12:36:27,765 INFO L402 AbstractCegarLoop]: === Iteration 38 === 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 32 more)] === [2021-11-17 12:36:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:36:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -797003887, now seen corresponding path program 1 times [2021-11-17 12:36:27,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:36:27,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767673077] [2021-11-17 12:36:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:27,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:36:27,807 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 12:36:27,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1162541563] [2021-11-17 12:36:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:27,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:36:27,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:36:27,808 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) [2021-11-17 12:36:27,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-17 12:36:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:28,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 12:36:28,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:36:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-17 12:36:28,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:36:28,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:36:28,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767673077] [2021-11-17 12:36:28,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-17 12:36:28,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162541563] [2021-11-17 12:36:28,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162541563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:36:28,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:36:28,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 12:36:28,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7639082] [2021-11-17 12:36:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:36:28,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 12:36:28,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:36:28,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 12:36:28,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 12:36:28,920 INFO L87 Difference]: Start difference. First operand 7624 states and 9737 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-17 12:36:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:36:29,404 INFO L93 Difference]: Finished difference Result 15245 states and 19473 transitions. [2021-11-17 12:36:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 12:36:29,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 319 [2021-11-17 12:36:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:36:29,423 INFO L225 Difference]: With dead ends: 15245 [2021-11-17 12:36:29,423 INFO L226 Difference]: Without dead ends: 7648 [2021-11-17 12:36:29,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:36:29,435 INFO L933 BasicCegarLoop]: 2065 mSDtfsCounter, 3 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6189 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:36:29,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6189 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 12:36:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7648 states. [2021-11-17 12:36:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7648 to 7640. [2021-11-17 12:36:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7640 states, 5436 states have (on average 1.229028697571744) internal successors, (6681), 5556 states have internal predecessors, (6681), 1516 states have call successors, (1516), 665 states have call predecessors, (1516), 677 states have return successors, (1556), 1499 states have call predecessors, (1556), 1512 states have call successors, (1556) [2021-11-17 12:36:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7640 states to 7640 states and 9753 transitions. [2021-11-17 12:36:29,869 INFO L78 Accepts]: Start accepts. Automaton has 7640 states and 9753 transitions. Word has length 319 [2021-11-17 12:36:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:36:29,869 INFO L470 AbstractCegarLoop]: Abstraction has 7640 states and 9753 transitions. [2021-11-17 12:36:29,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-17 12:36:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 7640 states and 9753 transitions. [2021-11-17 12:36:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2021-11-17 12:36:29,872 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:36:29,872 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-17 12:36:29,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-17 12:36:30,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:36:30,073 INFO L402 AbstractCegarLoop]: === Iteration 39 === 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 32 more)] === [2021-11-17 12:36:30,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:36:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash -373357165, now seen corresponding path program 1 times [2021-11-17 12:36:30,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:36:30,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961053885] [2021-11-17 12:36:30,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:30,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:36:30,113 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 12:36:30,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323540575] [2021-11-17 12:36:30,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:30,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:36:30,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:36:30,115 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:36:30,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-17 12:36:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:30,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 2939 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-17 12:36:30,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:36:31,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2021-11-17 12:36:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-17 12:36:31,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:36:31,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:36:31,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961053885] [2021-11-17 12:36:31,255 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-17 12:36:31,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323540575] [2021-11-17 12:36:31,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323540575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:36:31,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:36:31,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 12:36:31,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324186011] [2021-11-17 12:36:31,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:36:31,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 12:36:31,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:36:31,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 12:36:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:36:31,261 INFO L87 Difference]: Start difference. First operand 7640 states and 9753 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-17 12:36:35,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:38,659 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:40,675 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:42,757 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:36:43,534 INFO L93 Difference]: Finished difference Result 15481 states and 19813 transitions. [2021-11-17 12:36:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 12:36:43,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 319 [2021-11-17 12:36:43,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:36:43,555 INFO L225 Difference]: With dead ends: 15481 [2021-11-17 12:36:43,555 INFO L226 Difference]: Without dead ends: 7868 [2021-11-17 12:36:43,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 12:36:43,569 INFO L933 BasicCegarLoop]: 2079 mSDtfsCounter, 33 mSDsluCounter, 5661 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 7740 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2021-11-17 12:36:43,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 7740 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 622 Invalid, 4 Unknown, 0 Unchecked, 11.7s Time] [2021-11-17 12:36:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2021-11-17 12:36:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 7660. [2021-11-17 12:36:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7660 states, 5456 states have (on average 1.2289222873900294) internal successors, (6705), 5576 states have internal predecessors, (6705), 1516 states have call successors, (1516), 665 states have call predecessors, (1516), 677 states have return successors, (1556), 1499 states have call predecessors, (1556), 1512 states have call successors, (1556) [2021-11-17 12:36:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7660 states to 7660 states and 9777 transitions. [2021-11-17 12:36:44,025 INFO L78 Accepts]: Start accepts. Automaton has 7660 states and 9777 transitions. Word has length 319 [2021-11-17 12:36:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:36:44,026 INFO L470 AbstractCegarLoop]: Abstraction has 7660 states and 9777 transitions. [2021-11-17 12:36:44,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-11-17 12:36:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7660 states and 9777 transitions. [2021-11-17 12:36:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2021-11-17 12:36:44,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:36:44,029 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-17 12:36:44,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-17 12:36:44,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-17 12:36:44,230 INFO L402 AbstractCegarLoop]: === Iteration 40 === 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 32 more)] === [2021-11-17 12:36:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:36:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1402716463, now seen corresponding path program 1 times [2021-11-17 12:36:44,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:36:44,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919926029] [2021-11-17 12:36:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:44,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:36:44,278 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-17 12:36:44,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053621691] [2021-11-17 12:36:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:44,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:36:44,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:36:44,280 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:36:44,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-17 12:36:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:44,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-17 12:36:44,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:36:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2021-11-17 12:36:46,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:36:46,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:36:46,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919926029] [2021-11-17 12:36:46,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-17 12:36:46,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053621691] [2021-11-17 12:36:46,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053621691] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:36:46,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:36:46,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 12:36:46,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506664410] [2021-11-17 12:36:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:36:46,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 12:36:46,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:36:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 12:36:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 12:36:46,463 INFO L87 Difference]: Start difference. First operand 7660 states and 9777 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2021-11-17 12:36:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:36:46,938 INFO L93 Difference]: Finished difference Result 7692 states and 9801 transitions. [2021-11-17 12:36:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 12:36:46,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 319 [2021-11-17 12:36:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:36:46,952 INFO L225 Difference]: With dead ends: 7692 [2021-11-17 12:36:46,952 INFO L226 Difference]: Without dead ends: 7690 [2021-11-17 12:36:46,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 12:36:46,954 INFO L933 BasicCegarLoop]: 2072 mSDtfsCounter, 1814 mSDsluCounter, 4193 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 6265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 12:36:46,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1815 Valid, 6265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 12:36:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7690 states. [2021-11-17 12:36:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7690 to 7690. [2021-11-17 12:36:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7690 states, 5479 states have (on average 1.2265011863478736) internal successors, (6720), 5598 states have internal predecessors, (6720), 1516 states have call successors, (1516), 673 states have call predecessors, (1516), 685 states have return successors, (1556), 1499 states have call predecessors, (1556), 1512 states have call successors, (1556) [2021-11-17 12:36:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7690 states to 7690 states and 9792 transitions. [2021-11-17 12:36:47,394 INFO L78 Accepts]: Start accepts. Automaton has 7690 states and 9792 transitions. Word has length 319 [2021-11-17 12:36:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:36:47,395 INFO L470 AbstractCegarLoop]: Abstraction has 7690 states and 9792 transitions. [2021-11-17 12:36:47,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2021-11-17 12:36:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 7690 states and 9792 transitions. [2021-11-17 12:36:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-11-17 12:36:47,398 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:36:47,398 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:36:47,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-17 12:36:47,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-17 12:36:47,599 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_block_genhd_del_gendiskErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:36:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:36:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 518580465, now seen corresponding path program 1 times [2021-11-17 12:36:47,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:36:47,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654759642] [2021-11-17 12:36:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:36:47,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:36:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:36:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:36:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:36:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:36:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:36:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:36:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 12:36:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 12:36:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:36:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:36:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:36:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:36:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:36:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:36:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:36:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:36:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:36:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:36:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:36:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:36:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:36:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-17 12:36:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-11-17 12:36:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 12:36:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 12:36:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 12:36:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-11-17 12:36:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-17 12:36:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2021-11-17 12:36:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-17 12:36:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:36:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:36:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-11-17 12:36:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-17 12:36:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-17 12:36:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-11-17 12:36:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:36:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:36:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:36:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-11-17 12:36:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:36:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2021-11-17 12:36:48,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:36:48,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654759642] [2021-11-17 12:36:48,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654759642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:36:48,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:36:48,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-17 12:36:48,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353631326] [2021-11-17 12:36:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:36:48,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-17 12:36:48,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:36:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-17 12:36:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-11-17 12:36:48,321 INFO L87 Difference]: Start difference. First operand 7690 states and 9792 transitions. Second operand has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (44), 8 states have call predecessors, (44), 3 states have return successors, (42), 4 states have call predecessors, (42), 3 states have call successors, (42) [2021-11-17 12:36:50,098 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:51,442 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:53,509 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:36:55,593 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:02,397 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:04,498 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:06,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:08,702 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:10,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:12,914 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:15,017 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:17,119 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:19,222 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:21,329 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:32,914 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:35,088 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:37,258 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:39,419 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:41,587 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:44,935 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:46,951 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:48,993 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:51,010 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:53,021 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:55,025 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:37:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:37:59,174 INFO L93 Difference]: Finished difference Result 9811 states and 12525 transitions. [2021-11-17 12:37:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 12:37:59,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (44), 8 states have call predecessors, (44), 3 states have return successors, (42), 4 states have call predecessors, (42), 3 states have call successors, (42) Word has length 305 [2021-11-17 12:37:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:37:59,191 INFO L225 Difference]: With dead ends: 9811 [2021-11-17 12:37:59,191 INFO L226 Difference]: Without dead ends: 8526 [2021-11-17 12:37:59,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2021-11-17 12:37:59,195 INFO L933 BasicCegarLoop]: 2009 mSDtfsCounter, 4662 mSDsluCounter, 10167 mSDsCounter, 0 mSdLazyCounter, 7019 mSolverCounterSat, 3247 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 12176 SdHoareTripleChecker+Invalid, 10289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3247 IncrementalHoareTripleChecker+Valid, 7019 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:37:59,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4685 Valid, 12176 Invalid, 10289 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3247 Valid, 7019 Invalid, 23 Unknown, 0 Unchecked, 69.4s Time] [2021-11-17 12:37:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2021-11-17 12:37:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7718. [2021-11-17 12:37:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7718 states, 5499 states have (on average 1.225677395890162) internal successors, (6740), 5618 states have internal predecessors, (6740), 1516 states have call successors, (1516), 673 states have call predecessors, (1516), 693 states have return successors, (1564), 1507 states have call predecessors, (1564), 1512 states have call successors, (1564) [2021-11-17 12:37:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 9820 transitions. [2021-11-17 12:37:59,650 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 9820 transitions. Word has length 305 [2021-11-17 12:37:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:37:59,650 INFO L470 AbstractCegarLoop]: Abstraction has 7718 states and 9820 transitions. [2021-11-17 12:37:59,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (44), 8 states have call predecessors, (44), 3 states have return successors, (42), 4 states have call predecessors, (42), 3 states have call successors, (42) [2021-11-17 12:37:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 9820 transitions. [2021-11-17 12:37:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-11-17 12:37:59,654 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:37:59,654 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-17 12:37:59,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-17 12:37:59,655 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:37:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:37:59,655 INFO L85 PathProgramCache]: Analyzing trace with hash -672291616, now seen corresponding path program 1 times [2021-11-17 12:37:59,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:37:59,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222099584] [2021-11-17 12:37:59,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:37:59,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:37:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:37:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:37:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:37:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:37:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:37:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:37:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:37:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:37:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:37:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:37:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:37:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:37:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:37:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:37:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:37:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:37:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:37:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-17 12:37:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-17 12:37:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-11-17 12:37:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-11-17 12:37:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 12:37:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:37:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:37:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:37:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:37:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 12:37:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:38:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-17 12:38:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-11-17 12:38:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-11-17 12:38:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-11-17 12:38:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-11-17 12:38:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:38:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:38:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-17 12:38:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-11-17 12:38:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:38:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:38:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-11-17 12:38:00,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:38:00,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222099584] [2021-11-17 12:38:00,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222099584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:38:00,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:38:00,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-17 12:38:00,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674446754] [2021-11-17 12:38:00,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:38:00,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 12:38:00,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:38:00,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 12:38:00,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-17 12:38:00,101 INFO L87 Difference]: Start difference. First operand 7718 states and 9820 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (40), 5 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 3 states have call successors, (40) [2021-11-17 12:38:04,437 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:06,571 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:08,691 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:12,111 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:19,536 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:21,545 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:23,594 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:25,946 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:28,084 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 12:38:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:38:31,539 INFO L93 Difference]: Finished difference Result 18979 states and 25159 transitions. [2021-11-17 12:38:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 12:38:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (40), 5 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 3 states have call successors, (40) Word has length 363 [2021-11-17 12:38:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:38:31,564 INFO L225 Difference]: With dead ends: 18979 [2021-11-17 12:38:31,564 INFO L226 Difference]: Without dead ends: 11288 [2021-11-17 12:38:31,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-17 12:38:31,576 INFO L933 BasicCegarLoop]: 2653 mSDtfsCounter, 2357 mSDsluCounter, 5297 mSDsCounter, 0 mSdLazyCounter, 3754 mSolverCounterSat, 1480 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2620 SdHoareTripleChecker+Valid, 7950 SdHoareTripleChecker+Invalid, 5243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1480 IncrementalHoareTripleChecker+Valid, 3754 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2021-11-17 12:38:31,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2620 Valid, 7950 Invalid, 5243 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1480 Valid, 3754 Invalid, 9 Unknown, 0 Unchecked, 30.4s Time] [2021-11-17 12:38:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11288 states. [2021-11-17 12:38:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11288 to 7726. [2021-11-17 12:38:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7726 states, 5507 states have (on average 1.225349555111676) internal successors, (6748), 5626 states have internal predecessors, (6748), 1516 states have call successors, (1516), 673 states have call predecessors, (1516), 693 states have return successors, (1564), 1507 states have call predecessors, (1564), 1512 states have call successors, (1564) [2021-11-17 12:38:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7726 states to 7726 states and 9828 transitions. [2021-11-17 12:38:32,097 INFO L78 Accepts]: Start accepts. Automaton has 7726 states and 9828 transitions. Word has length 363 [2021-11-17 12:38:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:38:32,097 INFO L470 AbstractCegarLoop]: Abstraction has 7726 states and 9828 transitions. [2021-11-17 12:38:32,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 4 states have internal predecessors, (172), 3 states have call successors, (40), 5 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 3 states have call successors, (40) [2021-11-17 12:38:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7726 states and 9828 transitions. [2021-11-17 12:38:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-11-17 12:38:32,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:38:32,101 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 12:38:32,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-17 12:38:32,101 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_linux_block_genhd_del_gendiskErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:38:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:38:32,102 INFO L85 PathProgramCache]: Analyzing trace with hash -837083103, now seen corresponding path program 1 times [2021-11-17 12:38:32,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:38:32,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662932566] [2021-11-17 12:38:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:38:32,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:38:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:32,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:38:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:38:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:32,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:38:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-17 12:38:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:32,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-17 12:38:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:32,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 12:38:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-17 12:38:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 12:38:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:38:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:38:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 12:38:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:38:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:38:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 12:38:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:38:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:38:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-17 12:38:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:38:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:38:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-17 12:38:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-11-17 12:38:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-11-17 12:38:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-11-17 12:38:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-17 12:38:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-17 12:38:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-17 12:38:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-11-17 12:38:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-17 12:38:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-17 12:38:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 12:38:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 12:38:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-17 12:38:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-11-17 12:38:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:38:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:38:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-17 12:38:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-17 12:38:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-17 12:38:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2021-11-17 12:38:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:38:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:38:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-11-17 12:38:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2021-11-17 12:38:33,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:38:33,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662932566] [2021-11-17 12:38:33,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662932566] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 12:38:33,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868766107] [2021-11-17 12:38:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:38:33,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:38:33,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 12:38:33,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 12:38:33,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-17 12:38:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:33,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 2501 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-17 12:38:33,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 12:38:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-11-17 12:38:35,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 12:38:35,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868766107] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:38:35,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 12:38:35,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 22 [2021-11-17 12:38:35,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658965608] [2021-11-17 12:38:35,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:38:35,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-17 12:38:35,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:38:35,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-17 12:38:35,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2021-11-17 12:38:35,066 INFO L87 Difference]: Start difference. First operand 7726 states and 9828 transitions. Second operand has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 6 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) [2021-11-17 12:38:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 12:38:37,203 INFO L93 Difference]: Finished difference Result 8489 states and 10685 transitions. [2021-11-17 12:38:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 12:38:37,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 6 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) Word has length 321 [2021-11-17 12:38:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 12:38:37,225 INFO L225 Difference]: With dead ends: 8489 [2021-11-17 12:38:37,225 INFO L226 Difference]: Without dead ends: 7734 [2021-11-17 12:38:37,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2021-11-17 12:38:37,230 INFO L933 BasicCegarLoop]: 2037 mSDtfsCounter, 30 mSDsluCounter, 24384 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 26421 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 12:38:37,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 26421 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 12:38:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7734 states. [2021-11-17 12:38:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7734 to 7726. [2021-11-17 12:38:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7726 states, 5507 states have (on average 1.2248047938986744) internal successors, (6745), 5626 states have internal predecessors, (6745), 1516 states have call successors, (1516), 673 states have call predecessors, (1516), 693 states have return successors, (1564), 1507 states have call predecessors, (1564), 1512 states have call successors, (1564) [2021-11-17 12:38:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7726 states to 7726 states and 9825 transitions. [2021-11-17 12:38:37,686 INFO L78 Accepts]: Start accepts. Automaton has 7726 states and 9825 transitions. Word has length 321 [2021-11-17 12:38:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 12:38:37,687 INFO L470 AbstractCegarLoop]: Abstraction has 7726 states and 9825 transitions. [2021-11-17 12:38:37,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 6 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) [2021-11-17 12:38:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 7726 states and 9825 transitions. [2021-11-17 12:38:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2021-11-17 12:38:37,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 12:38:37,691 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-17 12:38:37,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-17 12:38:37,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 12:38:37,898 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_linux_block_genhd_del_gendiskErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2021-11-17 12:38:37,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 12:38:37,899 INFO L85 PathProgramCache]: Analyzing trace with hash 529711481, now seen corresponding path program 1 times [2021-11-17 12:38:37,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 12:38:37,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030361661] [2021-11-17 12:38:37,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 12:38:37,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 12:38:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:37,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 12:38:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:37,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 12:38:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 12:38:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 12:38:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:38:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:38:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:38:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:38:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:38:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:38:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 12:38:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 12:38:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-17 12:38:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-11-17 12:38:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-17 12:38:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-17 12:38:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-17 12:38:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-17 12:38:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-11-17 12:38:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-17 12:38:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:38:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:38:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 12:38:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 12:38:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 12:38:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 12:38:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 12:38:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:38:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:38:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 12:38:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-11-17 12:38:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-17 12:38:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-11-17 12:38:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-11-17 12:38:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:38:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:38:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-11-17 12:38:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-17 12:38:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-11-17 12:38:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2021-11-17 12:38:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 12:38:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-17 12:38:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 12:38:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2021-11-17 12:38:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 12:38:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2021-11-17 12:38:38,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 12:38:38,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030361661] [2021-11-17 12:38:38,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030361661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 12:38:38,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 12:38:38,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-17 12:38:38,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170253231] [2021-11-17 12:38:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 12:38:38,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-17 12:38:38,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 12:38:38,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-17 12:38:38,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-17 12:38:38,347 INFO L87 Difference]: Start difference. First operand 7726 states and 9825 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 4 states have internal predecessors, (143), 5 states have call successors, (47), 7 states have call predecessors, (47), 2 states have return successors, (45), 4 states have call predecessors, (45), 5 states have call successors, (45) [2021-11-17 12:38:46,500 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15