./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 c3fed411 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.2-tmp.no-commuhash-c3fed41 [2021-12-18 15:25:56,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 15:25:56,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 15:25:56,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 15:25:56,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 15:25:56,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 15:25:56,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 15:25:56,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 15:25:56,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 15:25:56,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 15:25:56,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 15:25:56,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 15:25:56,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 15:25:56,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 15:25:56,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 15:25:56,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 15:25:56,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 15:25:56,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 15:25:56,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 15:25:56,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 15:25:56,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 15:25:56,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 15:25:56,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 15:25:56,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 15:25:56,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 15:25:56,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 15:25:56,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 15:25:56,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 15:25:56,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 15:25:56,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 15:25:56,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 15:25:56,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 15:25:56,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 15:25:56,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 15:25:56,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 15:25:56,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 15:25:56,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 15:25:56,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 15:25:56,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 15:25:56,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 15:25:56,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 15:25:56,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 15:25:56,429 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 15:25:56,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 15:25:56,429 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 15:25:56,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 15:25:56,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 15:25:56,431 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 15:25:56,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 15:25:56,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 15:25:56,432 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 15:25:56,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 15:25:56,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 15:25:56,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 15:25:56,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 15:25:56,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 15:25:56,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 15:25:56,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 15:25:56,433 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 15:25:56,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 15:25:56,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 15:25:56,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 15:25:56,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 15:25:56,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 15:25:56,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 15:25:56,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 15:25:56,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 15:25:56,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 15:25:56,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 15:25:56,435 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 15:25:56,436 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 15:25:56,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 15:25:56,436 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 15:25:56,436 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-12-18 15:25:56,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 15:25:56,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 15:25:56,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 15:25:56,717 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 15:25:56,718 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 15:25:56,719 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-12-18 15:25:56,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720e5ec66/690a7b13e326405fb778bf92c70b0dbf/FLAG5fc670342 [2021-12-18 15:25:57,595 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 15:25:57,596 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-12-18 15:25:57,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720e5ec66/690a7b13e326405fb778bf92c70b0dbf/FLAG5fc670342 [2021-12-18 15:25:57,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/720e5ec66/690a7b13e326405fb778bf92c70b0dbf [2021-12-18 15:25:57,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 15:25:57,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 15:25:57,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 15:25:57,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 15:25:57,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 15:25:57,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:25:57" (1/1) ... [2021-12-18 15:25:57,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae4eb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:25:57, skipping insertion in model container [2021-12-18 15:25:57,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:25:57" (1/1) ... [2021-12-18 15:25:57,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 15:25:57,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 15:26:01,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[375009,375022] [2021-12-18 15:26:01,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,932 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:01,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 15:26:01,989 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 15:26:02,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-12-18 15:26:02,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[380727,380740] [2021-12-18 15:26:02,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[380892,380905] [2021-12-18 15:26:02,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381059,381072] [2021-12-18 15:26:02,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381219,381232] [2021-12-18 15:26:02,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381381,381394] [2021-12-18 15:26:02,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381540,381553] [2021-12-18 15:26:02,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381686,381699] [2021-12-18 15:26:02,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381829,381842] [2021-12-18 15:26:02,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[381973,381986] [2021-12-18 15:26:02,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382116,382129] [2021-12-18 15:26:02,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382260,382273] [2021-12-18 15:26:02,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382401,382414] [2021-12-18 15:26:02,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382539,382552] [2021-12-18 15:26:02,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382697,382710] [2021-12-18 15:26:02,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[382856,382869] [2021-12-18 15:26:02,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383012,383025] [2021-12-18 15:26:02,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383161,383174] [2021-12-18 15:26:02,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383313,383326] [2021-12-18 15:26:02,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383464,383477] [2021-12-18 15:26:02,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383613,383626] [2021-12-18 15:26:02,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383765,383778] [2021-12-18 15:26:02,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[383913,383926] [2021-12-18 15:26:02,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384066,384079] [2021-12-18 15:26:02,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384217,384230] [2021-12-18 15:26:02,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384367,384380] [2021-12-18 15:26:02,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384514,384527] [2021-12-18 15:26:02,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384665,384678] [2021-12-18 15:26:02,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384816,384829] [2021-12-18 15:26:02,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[384964,384977] [2021-12-18 15:26:02,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385130,385143] [2021-12-18 15:26:02,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385299,385312] [2021-12-18 15:26:02,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385466,385479] [2021-12-18 15:26:02,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385634,385647] [2021-12-18 15:26:02,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385784,385797] [2021-12-18 15:26:02,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[385931,385944] [2021-12-18 15:26:02,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386092,386105] [2021-12-18 15:26:02,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386262,386275] [2021-12-18 15:26:02,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i[386424,386437] [2021-12-18 15:26:02,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 15:26:02,635 INFO L208 MainTranslator]: Completed translation [2021-12-18 15:26:02,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02 WrapperNode [2021-12-18 15:26:02,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 15:26:02,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 15:26:02,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 15:26:02,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 15:26:02,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:02,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,006 INFO L137 Inliner]: procedures = 675, calls = 2831, calls flagged for inlining = 316, calls inlined = 216, statements flattened = 5804 [2021-12-18 15:26:03,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 15:26:03,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 15:26:03,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 15:26:03,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 15:26:03,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 15:26:03,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 15:26:03,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 15:26:03,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 15:26:03,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (1/1) ... [2021-12-18 15:26:03,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 15:26:03,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 15:26:03,341 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-12-18 15:26:03,364 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-12-18 15:26:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_frontend_closed [2021-12-18 15:26:03,388 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_frontend_closed [2021-12-18 15:26:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2021-12-18 15:26:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-18 15:26:03,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-18 15:26:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-18 15:26:03,388 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-18 15:26:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 15:26:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 15:26:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-18 15:26:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-18 15:26:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_del_gendisk [2021-12-18 15:26:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_del_gendisk [2021-12-18 15:26:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-18 15:26:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-18 15:26:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure submit_bio [2021-12-18 15:26:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_bio [2021-12-18 15:26:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure queue_flag_set_unlocked [2021-12-18 15:26:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_flag_set_unlocked [2021-12-18 15:26:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_cancel_free_callback [2021-12-18 15:26:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_cancel_free_callback [2021-12-18 15:26:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-18 15:26:03,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-18 15:26:03,391 INFO L130 BoogieDeclarations]: Found specification of procedure gnttab_end_foreign_access [2021-12-18 15:26:03,391 INFO L138 BoogieDeclarations]: Found implementation of procedure gnttab_end_foreign_access [2021-12-18 15:26:03,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-18 15:26:03,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-18 15:26:03,391 INFO L130 BoogieDeclarations]: Found specification of procedure do_blkif_request [2021-12-18 15:26:03,391 INFO L138 BoogieDeclarations]: Found implementation of procedure do_blkif_request [2021-12-18 15:26:03,392 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_pages [2021-12-18 15:26:03,392 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_pages [2021-12-18 15:26:03,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-18 15:26:03,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-18 15:26:03,392 INFO L130 BoogieDeclarations]: Found specification of procedure talk_to_blkback [2021-12-18 15:26:03,392 INFO L138 BoogieDeclarations]: Found implementation of procedure talk_to_blkback [2021-12-18 15:26:03,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-18 15:26:03,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-18 15:26:03,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-18 15:26:03,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-18 15:26:03,393 INFO L130 BoogieDeclarations]: Found specification of procedure blkfront_setup_indirect [2021-12-18 15:26:03,393 INFO L138 BoogieDeclarations]: Found implementation of procedure blkfront_setup_indirect [2021-12-18 15:26:03,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 15:26:03,393 INFO L130 BoogieDeclarations]: Found specification of procedure pfn_to_mfn [2021-12-18 15:26:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure pfn_to_mfn [2021-12-18 15:26:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-12-18 15:26:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-12-18 15:26:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-18 15:26:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-18 15:26:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure xlvbd_release_gendisk [2021-12-18 15:26:03,394 INFO L138 BoogieDeclarations]: Found implementation of procedure xlvbd_release_gendisk [2021-12-18 15:26:03,394 INFO L130 BoogieDeclarations]: Found specification of procedure xlbd_release_minors [2021-12-18 15:26:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure xlbd_release_minors [2021-12-18 15:26:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-18 15:26:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure xlvbd_flush [2021-12-18 15:26:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure xlvbd_flush [2021-12-18 15:26:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2021-12-18 15:26:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2021-12-18 15:26:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure sg_page [2021-12-18 15:26:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_page [2021-12-18 15:26:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-18 15:26:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_switch_state [2021-12-18 15:26:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_switch_state [2021-12-18 15:26:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-18 15:26:03,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-18 15:26:03,396 INFO L130 BoogieDeclarations]: Found specification of procedure flush_work [2021-12-18 15:26:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_work [2021-12-18 15:26:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-18 15:26:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-18 15:26:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2021-12-18 15:26:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2021-12-18 15:26:03,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-18 15:26:03,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-18 15:26:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 15:26:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-18 15:26:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-18 15:26:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-18 15:26:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-18 15:26:03,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 15:26:03,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 15:26:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-18 15:26:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-18 15:26:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-12-18 15:26:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-12-18 15:26:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-18 15:26:03,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-18 15:26:03,399 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2021-12-18 15:26:03,400 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2021-12-18 15:26:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-18 15:26:03,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-18 15:26:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure get_grant [2021-12-18 15:26:03,400 INFO L138 BoogieDeclarations]: Found implementation of procedure get_grant [2021-12-18 15:26:03,400 INFO L130 BoogieDeclarations]: Found specification of procedure sg_next [2021-12-18 15:26:03,400 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_next [2021-12-18 15:26:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-18 15:26:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-18 15:26:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 15:26:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_calloc [2021-12-18 15:26:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_calloc [2021-12-18 15:26:03,401 INFO L130 BoogieDeclarations]: Found specification of procedure get_phys_to_machine [2021-12-18 15:26:03,401 INFO L138 BoogieDeclarations]: Found implementation of procedure get_phys_to_machine [2021-12-18 15:26:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-12-18 15:26:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-12-18 15:26:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 15:26:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_bd_mutex_of_block_device [2021-12-18 15:26:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_bd_mutex_of_block_device [2021-12-18 15:26:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-18 15:26:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-18 15:26:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 15:26:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure __blk_end_request_all [2021-12-18 15:26:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __blk_end_request_all [2021-12-18 15:26:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-12-18 15:26:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-12-18 15:26:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-12-18 15:26:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_io_lock_of_blkfront_info [2021-12-18 15:26:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_io_lock_of_blkfront_info [2021-12-18 15:26:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure kmap_atomic [2021-12-18 15:26:03,404 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap_atomic [2021-12-18 15:26:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_blkfront_mutex [2021-12-18 15:26:03,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_blkfront_mutex [2021-12-18 15:26:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure blkif_free [2021-12-18 15:26:03,404 INFO L138 BoogieDeclarations]: Found implementation of procedure blkif_free [2021-12-18 15:26:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-18 15:26:03,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-18 15:26:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2021-12-18 15:26:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2021-12-18 15:26:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 15:26:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 15:26:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_blkfront_info [2021-12-18 15:26:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_blkfront_info [2021-12-18 15:26:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure blk_stop_queue [2021-12-18 15:26:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_stop_queue [2021-12-18 15:26:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_blkfront_info [2021-12-18 15:26:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_blkfront_info [2021-12-18 15:26:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 15:26:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 15:26:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-18 15:26:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-18 15:26:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure bdput [2021-12-18 15:26:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure bdput [2021-12-18 15:26:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-18 15:26:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-18 15:26:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure del_gendisk [2021-12-18 15:26:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure del_gendisk [2021-12-18 15:26:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure xenbus_transaction_end [2021-12-18 15:26:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure xenbus_transaction_end [2021-12-18 15:26:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2021-12-18 15:26:03,408 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2021-12-18 15:26:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_sectors [2021-12-18 15:26:03,408 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_sectors [2021-12-18 15:26:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-18 15:26:03,408 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-18 15:26:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-18 15:26:03,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-18 15:26:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_pos [2021-12-18 15:26:03,409 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_pos [2021-12-18 15:26:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-18 15:26:03,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-18 15:26:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 15:26:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-18 15:26:03,409 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-18 15:26:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-18 15:26:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-18 15:26:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 15:26:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure __free_pages [2021-12-18 15:26:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __free_pages [2021-12-18 15:26:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_107 [2021-12-18 15:26:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_107 [2021-12-18 15:26:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-12-18 15:26:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-12-18 15:26:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 15:26:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_bd_mutex_of_block_device [2021-12-18 15:26:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_bd_mutex_of_block_device [2021-12-18 15:26:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-18 15:26:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-18 15:26:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure get_capacity [2021-12-18 15:26:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure get_capacity [2021-12-18 15:26:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-18 15:26:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-18 15:26:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_blkfront_mutex [2021-12-18 15:26:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_blkfront_mutex [2021-12-18 15:26:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-18 15:26:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-18 15:26:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-18 15:26:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-18 15:26:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure blk_requeue_request [2021-12-18 15:26:03,413 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_requeue_request [2021-12-18 15:26:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2021-12-18 15:26:03,413 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2021-12-18 15:26:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure bio_segments [2021-12-18 15:26:03,413 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_segments [2021-12-18 15:26:03,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-18 15:26:03,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-18 15:26:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-18 15:26:03,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-18 15:26:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-18 15:26:03,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-18 15:26:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-18 15:26:03,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-18 15:26:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_io_lock_of_blkfront_info [2021-12-18 15:26:03,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_io_lock_of_blkfront_info [2021-12-18 15:26:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-18 15:26:03,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-18 15:26:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-18 15:26:03,415 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-18 15:26:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-18 15:26:03,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-18 15:26:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 15:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-18 15:26:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-18 15:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure kick_pending_request_queues [2021-12-18 15:26:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure kick_pending_request_queues [2021-12-18 15:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-18 15:26:03,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-18 15:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_96 [2021-12-18 15:26:03,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_96 [2021-12-18 15:26:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-18 15:26:03,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-18 15:26:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2021-12-18 15:26:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_97 [2021-12-18 15:26:03,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_97 [2021-12-18 15:26:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure bdget_disk [2021-12-18 15:26:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure bdget_disk [2021-12-18 15:26:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_merge [2021-12-18 15:26:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_merge [2021-12-18 15:26:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segments [2021-12-18 15:26:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segments [2021-12-18 15:26:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-18 15:26:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-18 15:26:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-18 15:26:03,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-18 15:26:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure encode_disk_name [2021-12-18 15:26:03,419 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_disk_name [2021-12-18 15:26:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2021-12-18 15:26:03,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2021-12-18 15:26:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 15:26:03,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2021-12-18 15:26:03,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2021-12-18 15:26:04,263 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 15:26:04,292 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 15:26:04,727 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-18 15:26:26,692 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 15:26:26,709 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 15:26:26,709 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-18 15:26:26,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:26:26 BoogieIcfgContainer [2021-12-18 15:26:26,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 15:26:26,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 15:26:26,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 15:26:26,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 15:26:26,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:25:57" (1/3) ... [2021-12-18 15:26:26,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce38f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:26:26, skipping insertion in model container [2021-12-18 15:26:26,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:26:02" (2/3) ... [2021-12-18 15:26:26,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce38f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:26:26, skipping insertion in model container [2021-12-18 15:26:26,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:26:26" (3/3) ... [2021-12-18 15:26:26,726 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--block--xen-blkfront.ko.cil.i [2021-12-18 15:26:26,732 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 15:26:26,732 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-18 15:26:26,794 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 15:26:26,811 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-12-18 15:26:26,812 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-18 15:26:26,863 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-12-18 15:26:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-18 15:26:26,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:26:26,871 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-12-18 15:26:26,872 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-12-18 15:26:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:26:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash 978063183, now seen corresponding path program 1 times [2021-12-18 15:26:26,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:26:26,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492515709] [2021-12-18 15:26:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:26:26,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:26:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:26:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:26:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:27,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:26:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:27,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:26:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:27,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:26:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:27,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:26:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:26:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:26:27,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:26:27,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492515709] [2021-12-18 15:26:27,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492515709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:26:27,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:26:27,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:26:27,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824522721] [2021-12-18 15:26:27,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:26:27,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:26:27,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:26:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:26:27,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:26:27,629 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-12-18 15:26:32,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:26:34,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:26:40,473 WARN L534 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-12-18 15:26:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:26:42,055 INFO L93 Difference]: Finished difference Result 3440 states and 4793 transitions. [2021-12-18 15:26:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:26:42,057 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-12-18 15:26:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:26:42,090 INFO L225 Difference]: With dead ends: 3440 [2021-12-18 15:26:42,090 INFO L226 Difference]: Without dead ends: 1712 [2021-12-18 15:26:42,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 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-12-18 15:26:42,110 INFO L933 BasicCegarLoop]: 2105 mSDtfsCounter, 3543 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 1398 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3744 SdHoareTripleChecker+Valid, 4531 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1398 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2021-12-18 15:26:42,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3744 Valid, 4531 Invalid, 3051 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1398 Valid, 1650 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2021-12-18 15:26:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2021-12-18 15:26:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2021-12-18 15:26:42,285 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-12-18 15:26:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2254 transitions. [2021-12-18 15:26:42,303 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2254 transitions. Word has length 50 [2021-12-18 15:26:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:26:42,305 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2254 transitions. [2021-12-18 15:26:42,305 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-12-18 15:26:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2254 transitions. [2021-12-18 15:26:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-18 15:26:42,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:26:42,313 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-12-18 15:26:42,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 15:26:42,314 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-12-18 15:26:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:26:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1447234358, now seen corresponding path program 1 times [2021-12-18 15:26:42,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:26:42,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081372511] [2021-12-18 15:26:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:26:42,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:26:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:26:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:26:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:26:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:26:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:26:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:26:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:26:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:26:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:26:42,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-12-18 15:26:42,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:26:42,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081372511] [2021-12-18 15:26:42,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081372511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:26:42,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:26:42,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:26:42,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622785530] [2021-12-18 15:26:42,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:26:42,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:26:42,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:26:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:26:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:26:42,683 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-12-18 15:26:50,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:26:55,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:00,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:27:02,954 INFO L93 Difference]: Finished difference Result 3371 states and 4447 transitions. [2021-12-18 15:27:02,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 15:27:02,955 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-12-18 15:27:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:27:02,980 INFO L225 Difference]: With dead ends: 3371 [2021-12-18 15:27:02,980 INFO L226 Difference]: Without dead ends: 3369 [2021-12-18 15:27:02,984 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-12-18 15:27:02,985 INFO L933 BasicCegarLoop]: 2324 mSDtfsCounter, 5227 mSDsluCounter, 3803 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 2419 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5419 SdHoareTripleChecker+Valid, 6127 SdHoareTripleChecker+Invalid, 5879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2419 IncrementalHoareTripleChecker+Valid, 3457 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2021-12-18 15:27:02,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5419 Valid, 6127 Invalid, 5879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2419 Valid, 3457 Invalid, 3 Unknown, 0 Unchecked, 19.5s Time] [2021-12-18 15:27:02,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2021-12-18 15:27:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3175. [2021-12-18 15:27:03,129 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-12-18 15:27:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4242 transitions. [2021-12-18 15:27:03,149 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4242 transitions. Word has length 56 [2021-12-18 15:27:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:27:03,150 INFO L470 AbstractCegarLoop]: Abstraction has 3175 states and 4242 transitions. [2021-12-18 15:27:03,150 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-12-18 15:27:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4242 transitions. [2021-12-18 15:27:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-18 15:27:03,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:27:03,152 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-12-18 15:27:03,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 15:27:03,152 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-12-18 15:27:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:27:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash 129867478, now seen corresponding path program 1 times [2021-12-18 15:27:03,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:27:03,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581541598] [2021-12-18 15:27:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:27:03,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:27:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:27:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:27:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:27:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:27:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:27:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:27:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:27:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:27:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:27:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:27:03,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:27:03,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581541598] [2021-12-18 15:27:03,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581541598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:27:03,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:27:03,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:27:03,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079847147] [2021-12-18 15:27:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:27:03,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:27:03,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:27:03,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:27:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:27:03,595 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-12-18 15:27:07,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:10,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:15,061 WARN L534 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-12-18 15:27:19,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:22,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:25,462 WARN L534 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-12-18 15:27:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:27:28,704 INFO L93 Difference]: Finished difference Result 6309 states and 8436 transitions. [2021-12-18 15:27:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 15:27:28,705 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-12-18 15:27:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:27:28,743 INFO L225 Difference]: With dead ends: 6309 [2021-12-18 15:27:28,743 INFO L226 Difference]: Without dead ends: 6307 [2021-12-18 15:27:28,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-18 15:27:28,750 INFO L933 BasicCegarLoop]: 2348 mSDtfsCounter, 5253 mSDsluCounter, 3855 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 2435 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5446 SdHoareTripleChecker+Valid, 6203 SdHoareTripleChecker+Invalid, 5887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2435 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:27:28,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5446 Valid, 6203 Invalid, 5887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2435 Valid, 3446 Invalid, 6 Unknown, 0 Unchecked, 24.4s Time] [2021-12-18 15:27:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2021-12-18 15:27:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 6124. [2021-12-18 15:27:28,975 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-12-18 15:27:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 8248 transitions. [2021-12-18 15:27:29,010 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 8248 transitions. Word has length 62 [2021-12-18 15:27:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:27:29,011 INFO L470 AbstractCegarLoop]: Abstraction has 6124 states and 8248 transitions. [2021-12-18 15:27:29,011 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-12-18 15:27:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 8248 transitions. [2021-12-18 15:27:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-18 15:27:29,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:27:29,014 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-12-18 15:27:29,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 15:27:29,015 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-12-18 15:27:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:27:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash 77930130, now seen corresponding path program 1 times [2021-12-18 15:27:29,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:27:29,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136149402] [2021-12-18 15:27:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:27:29,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:27:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:27:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:27:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:27:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:27:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:27:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:27:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:27:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:27:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:27:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:27:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:27:29,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:27:29,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136149402] [2021-12-18 15:27:29,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136149402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:27:29,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:27:29,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:27:29,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127925145] [2021-12-18 15:27:29,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:27:29,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:27:29,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:27:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:27:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:27:29,407 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-12-18 15:27:36,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:27:37,538 INFO L93 Difference]: Finished difference Result 6124 states and 8248 transitions. [2021-12-18 15:27:37,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:27:37,539 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-12-18 15:27:37,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:27:37,571 INFO L225 Difference]: With dead ends: 6124 [2021-12-18 15:27:37,571 INFO L226 Difference]: Without dead ends: 6122 [2021-12-18 15:27:37,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-12-18 15:27:37,577 INFO L933 BasicCegarLoop]: 2087 mSDtfsCounter, 3511 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 1390 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3707 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-12-18 15:27:37,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3707 Valid, 4495 Invalid, 3031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1640 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2021-12-18 15:27:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6122 states. [2021-12-18 15:27:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6122 to 6122. [2021-12-18 15:27:37,870 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-12-18 15:27:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6122 states to 6122 states and 8246 transitions. [2021-12-18 15:27:37,891 INFO L78 Accepts]: Start accepts. Automaton has 6122 states and 8246 transitions. Word has length 68 [2021-12-18 15:27:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:27:37,894 INFO L470 AbstractCegarLoop]: Abstraction has 6122 states and 8246 transitions. [2021-12-18 15:27:37,894 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-12-18 15:27:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 6122 states and 8246 transitions. [2021-12-18 15:27:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-18 15:27:37,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:27:37,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, 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-12-18 15:27:37,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 15:27:37,897 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-12-18 15:27:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:27:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1629920272, now seen corresponding path program 1 times [2021-12-18 15:27:37,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:27:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831117727] [2021-12-18 15:27:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:27:37,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:27:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:27:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:27:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:27:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:27:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:27:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:27:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:27:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:27:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:27:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:27:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:27:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:27:38,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:27:38,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831117727] [2021-12-18 15:27:38,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831117727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:27:38,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:27:38,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:27:38,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954924287] [2021-12-18 15:27:38,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:27:38,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:27:38,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:27:38,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:27:38,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:27:38,195 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-12-18 15:27:42,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:47,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:27:49,008 INFO L93 Difference]: Finished difference Result 6122 states and 8246 transitions. [2021-12-18 15:27:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:27:49,017 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-12-18 15:27:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:27:49,084 INFO L225 Difference]: With dead ends: 6122 [2021-12-18 15:27:49,084 INFO L226 Difference]: Without dead ends: 6120 [2021-12-18 15:27:49,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-12-18 15:27:49,091 INFO L933 BasicCegarLoop]: 2085 mSDtfsCounter, 3505 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s 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, 10.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:27:49,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3700 Valid, 4493 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1637 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2021-12-18 15:27:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2021-12-18 15:27:49,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 6120. [2021-12-18 15:27:49,460 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-12-18 15:27:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 8244 transitions. [2021-12-18 15:27:49,504 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 8244 transitions. Word has length 74 [2021-12-18 15:27:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:27:49,505 INFO L470 AbstractCegarLoop]: Abstraction has 6120 states and 8244 transitions. [2021-12-18 15:27:49,505 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-12-18 15:27:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 8244 transitions. [2021-12-18 15:27:49,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-18 15:27:49,508 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:27:49,509 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-12-18 15:27:49,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 15:27:49,519 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-12-18 15:27:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:27:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1067365840, now seen corresponding path program 1 times [2021-12-18 15:27:49,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:27:49,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120491785] [2021-12-18 15:27:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:27:49,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:27:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:27:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:27:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:27:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:27:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:27:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:27:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:27:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:27:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:27:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:27:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:27:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:27:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:27:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:27:49,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:27:49,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120491785] [2021-12-18 15:27:49,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120491785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:27:49,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:27:49,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:27:49,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870471269] [2021-12-18 15:27:49,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:27:49,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:27:49,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:27:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:27:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:27:49,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-12-18 15:27:54,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:56,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:27:58,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:03,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:28:05,245 INFO L93 Difference]: Finished difference Result 6120 states and 8244 transitions. [2021-12-18 15:28:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:28:05,246 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-12-18 15:28:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:28:05,273 INFO L225 Difference]: With dead ends: 6120 [2021-12-18 15:28:05,274 INFO L226 Difference]: Without dead ends: 6118 [2021-12-18 15:28:05,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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-12-18 15:28:05,278 INFO L933 BasicCegarLoop]: 2083 mSDtfsCounter, 3499 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 1390 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3693 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2021-12-18 15:28:05,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3693 Valid, 4491 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1633 Invalid, 4 Unknown, 0 Unchecked, 14.9s Time] [2021-12-18 15:28:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6118 states. [2021-12-18 15:28:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6118 to 6118. [2021-12-18 15:28:05,491 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-12-18 15:28:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6118 states to 6118 states and 8242 transitions. [2021-12-18 15:28:05,524 INFO L78 Accepts]: Start accepts. Automaton has 6118 states and 8242 transitions. Word has length 80 [2021-12-18 15:28:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:28:05,525 INFO L470 AbstractCegarLoop]: Abstraction has 6118 states and 8242 transitions. [2021-12-18 15:28:05,525 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-12-18 15:28:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 6118 states and 8242 transitions. [2021-12-18 15:28:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-18 15:28:05,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:28:05,528 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-12-18 15:28:05,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 15:28:05,529 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-12-18 15:28:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:28:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1911493740, now seen corresponding path program 1 times [2021-12-18 15:28:05,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:28:05,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748149543] [2021-12-18 15:28:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:28:05,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:28:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:28:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:28:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:28:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:28:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:28:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:28:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:28:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:28:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:28:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:28:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:28:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:28:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:28:05,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:28:05,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748149543] [2021-12-18 15:28:05,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748149543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:28:05,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:28:05,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:28:05,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158452636] [2021-12-18 15:28:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:28:05,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:28:05,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:28:05,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:28:05,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:28:05,892 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-12-18 15:28:10,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:12,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:15,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:17,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:21,653 WARN L534 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-12-18 15:28:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:28:23,003 INFO L93 Difference]: Finished difference Result 6118 states and 8242 transitions. [2021-12-18 15:28:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:28:23,003 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-12-18 15:28:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:28:23,025 INFO L225 Difference]: With dead ends: 6118 [2021-12-18 15:28:23,025 INFO L226 Difference]: Without dead ends: 6116 [2021-12-18 15:28:23,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-12-18 15:28:23,030 INFO L933 BasicCegarLoop]: 2081 mSDtfsCounter, 3493 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 1390 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3686 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 3025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2021-12-18 15:28:23,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3686 Valid, 4489 Invalid, 3025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1630 Invalid, 5 Unknown, 0 Unchecked, 16.6s Time] [2021-12-18 15:28:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6116 states. [2021-12-18 15:28:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6116 to 6116. [2021-12-18 15:28:23,245 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-12-18 15:28:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6116 states to 6116 states and 8240 transitions. [2021-12-18 15:28:23,270 INFO L78 Accepts]: Start accepts. Automaton has 6116 states and 8240 transitions. Word has length 86 [2021-12-18 15:28:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:28:23,270 INFO L470 AbstractCegarLoop]: Abstraction has 6116 states and 8240 transitions. [2021-12-18 15:28:23,271 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-12-18 15:28:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6116 states and 8240 transitions. [2021-12-18 15:28:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-18 15:28:23,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:28:23,272 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-12-18 15:28:23,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 15:28:23,273 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-12-18 15:28:23,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:28:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1715100088, now seen corresponding path program 1 times [2021-12-18 15:28:23,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:28:23,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825649414] [2021-12-18 15:28:23,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:28:23,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:28:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:28:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:28:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:28:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:28:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:28:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:28:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:28:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:28:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:28:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:28:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:28:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:28:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:28:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:28:23,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:28:23,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825649414] [2021-12-18 15:28:23,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825649414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:28:23,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:28:23,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:28:23,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031460705] [2021-12-18 15:28:23,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:28:23,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:28:23,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:28:23,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:28:23,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:28:23,574 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-12-18 15:28:27,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:32,578 WARN L534 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-12-18 15:28:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:28:33,812 INFO L93 Difference]: Finished difference Result 6116 states and 8240 transitions. [2021-12-18 15:28:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:28:33,813 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-12-18 15:28:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:28:33,830 INFO L225 Difference]: With dead ends: 6116 [2021-12-18 15:28:33,830 INFO L226 Difference]: Without dead ends: 6114 [2021-12-18 15:28:33,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 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-12-18 15:28:33,834 INFO L933 BasicCegarLoop]: 2079 mSDtfsCounter, 3491 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3683 SdHoareTripleChecker+Valid, 4487 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2021-12-18 15:28:33,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3683 Valid, 4487 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1627 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2021-12-18 15:28:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6114 states. [2021-12-18 15:28:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6114 to 6114. [2021-12-18 15:28:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6114 states, 4372 states have (on average 1.2662397072278133) internal successors, (5536), 4500 states have internal predecessors, (5536), 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-12-18 15:28:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 8238 transitions. [2021-12-18 15:28:34,075 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 8238 transitions. Word has length 92 [2021-12-18 15:28:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:28:34,076 INFO L470 AbstractCegarLoop]: Abstraction has 6114 states and 8238 transitions. [2021-12-18 15:28:34,076 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-12-18 15:28:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 8238 transitions. [2021-12-18 15:28:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-18 15:28:34,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:28:34,078 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-12-18 15:28:34,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 15:28:34,078 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-12-18 15:28:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:28:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1274599851, now seen corresponding path program 1 times [2021-12-18 15:28:34,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:28:34,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777314009] [2021-12-18 15:28:34,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:28:34,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:28:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:28:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:28:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:28:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:28:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:28:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:28:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:28:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:28:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:28:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:28:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:28:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:28:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:28:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 15:28:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-18 15:28:34,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:28:34,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777314009] [2021-12-18 15:28:34,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777314009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:28:34,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:28:34,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 15:28:34,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770248219] [2021-12-18 15:28:34,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:28:34,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 15:28:34,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:28:34,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 15:28:34,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 15:28:34,527 INFO L87 Difference]: Start difference. First operand 6114 states and 8238 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-12-18 15:28:41,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:46,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:28:48,794 INFO L93 Difference]: Finished difference Result 12549 states and 17087 transitions. [2021-12-18 15:28:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:28:48,794 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-12-18 15:28:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:28:48,827 INFO L225 Difference]: With dead ends: 12549 [2021-12-18 15:28:48,827 INFO L226 Difference]: Without dead ends: 6462 [2021-12-18 15:28:48,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-18 15:28:48,904 INFO L933 BasicCegarLoop]: 2178 mSDtfsCounter, 2467 mSDsluCounter, 5340 mSDsCounter, 0 mSdLazyCounter, 2918 mSolverCounterSat, 628 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2726 SdHoareTripleChecker+Valid, 7518 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 2918 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2021-12-18 15:28:48,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2726 Valid, 7518 Invalid, 3548 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [628 Valid, 2918 Invalid, 2 Unknown, 0 Unchecked, 13.7s Time] [2021-12-18 15:28:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2021-12-18 15:28:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 6114. [2021-12-18 15:28:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6114 states, 4372 states have (on average 1.2653247941445562) internal successors, (5532), 4500 states have internal predecessors, (5532), 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-12-18 15:28:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 8234 transitions. [2021-12-18 15:28:49,184 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 8234 transitions. Word has length 113 [2021-12-18 15:28:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:28:49,184 INFO L470 AbstractCegarLoop]: Abstraction has 6114 states and 8234 transitions. [2021-12-18 15:28:49,184 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-12-18 15:28:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 8234 transitions. [2021-12-18 15:28:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-18 15:28:49,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:28:49,188 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-12-18 15:28:49,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 15:28:49,188 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-12-18 15:28:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:28:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1274659433, now seen corresponding path program 1 times [2021-12-18 15:28:49,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:28:49,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725397818] [2021-12-18 15:28:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:28:49,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:28:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:28:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:28:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:28:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:28:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:28:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:28:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:28:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:28:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:28:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:28:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:28:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:28:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:28:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 15:28:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-18 15:28:49,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:28:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725397818] [2021-12-18 15:28:49,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725397818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:28:49,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:28:49,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 15:28:49,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989858903] [2021-12-18 15:28:49,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:28:49,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 15:28:49,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:28:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 15:28:49,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 15:28:49,528 INFO L87 Difference]: Start difference. First operand 6114 states and 8234 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-12-18 15:28:56,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:28:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:28:57,711 INFO L93 Difference]: Finished difference Result 6462 states and 8822 transitions. [2021-12-18 15:28:57,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 15:28:57,712 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-12-18 15:28:57,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:28:57,737 INFO L225 Difference]: With dead ends: 6462 [2021-12-18 15:28:57,738 INFO L226 Difference]: Without dead ends: 6460 [2021-12-18 15:28:57,743 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-12-18 15:28:57,745 INFO L933 BasicCegarLoop]: 2178 mSDtfsCounter, 546 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 393 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 6515 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2021-12-18 15:28:57,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 6515 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 1623 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2021-12-18 15:28:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2021-12-18 15:28:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6112. [2021-12-18 15:28:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6112 states, 4371 states have (on average 1.264470372912377) internal successors, (5527), 4498 states have internal predecessors, (5527), 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-12-18 15:28:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6112 states to 6112 states and 8229 transitions. [2021-12-18 15:28:58,033 INFO L78 Accepts]: Start accepts. Automaton has 6112 states and 8229 transitions. Word has length 113 [2021-12-18 15:28:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:28:58,034 INFO L470 AbstractCegarLoop]: Abstraction has 6112 states and 8229 transitions. [2021-12-18 15:28:58,034 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-12-18 15:28:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 6112 states and 8229 transitions. [2021-12-18 15:28:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-18 15:28:58,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:28:58,037 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-12-18 15:28:58,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 15:28:58,038 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-12-18 15:28:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:28:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1056393611, now seen corresponding path program 1 times [2021-12-18 15:28:58,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:28:58,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160418669] [2021-12-18 15:28:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:28:58,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:28:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:28:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:28:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:28:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:28:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:28:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:28:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:28:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:28:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:28:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:28:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:28:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:28:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:28:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:28:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:28:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:28:58,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:28:58,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160418669] [2021-12-18 15:28:58,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160418669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:28:58,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:28:58,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:28:58,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391033773] [2021-12-18 15:28:58,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:28:58,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:28:58,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:28:58,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:28:58,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:28:58,352 INFO L87 Difference]: Start difference. First operand 6112 states and 8229 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-12-18 15:29:02,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:07,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:29:08,830 INFO L93 Difference]: Finished difference Result 6112 states and 8229 transitions. [2021-12-18 15:29:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:29:08,831 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-12-18 15:29:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:29:08,853 INFO L225 Difference]: With dead ends: 6112 [2021-12-18 15:29:08,854 INFO L226 Difference]: Without dead ends: 6110 [2021-12-18 15:29:08,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 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-12-18 15:29:08,859 INFO L933 BasicCegarLoop]: 2074 mSDtfsCounter, 3470 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.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, 1626 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2021-12-18 15:29:08,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3662 Valid, 4482 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1626 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2021-12-18 15:29:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2021-12-18 15:29:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6110. [2021-12-18 15:29:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6110 states, 4370 states have (on average 1.2643020594965675) internal successors, (5525), 4496 states have internal predecessors, (5525), 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-12-18 15:29:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 8227 transitions. [2021-12-18 15:29:09,169 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 8227 transitions. Word has length 94 [2021-12-18 15:29:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:29:09,170 INFO L470 AbstractCegarLoop]: Abstraction has 6110 states and 8227 transitions. [2021-12-18 15:29:09,170 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-12-18 15:29:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 8227 transitions. [2021-12-18 15:29:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-18 15:29:09,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:29:09,172 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-12-18 15:29:09,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 15:29:09,173 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-12-18 15:29:09,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:29:09,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1657990063, now seen corresponding path program 1 times [2021-12-18 15:29:09,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:29:09,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912994618] [2021-12-18 15:29:09,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:29:09,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:29:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:29:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:29:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:29:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:29:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:29:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:29:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:29:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:29:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:29:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:29:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:29:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:29:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:29:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 15:29:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-18 15:29:09,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:29:09,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912994618] [2021-12-18 15:29:09,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912994618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:29:09,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:29:09,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 15:29:09,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279878204] [2021-12-18 15:29:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:29:09,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 15:29:09,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:29:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 15:29:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 15:29:09,435 INFO L87 Difference]: Start difference. First operand 6110 states and 8227 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-12-18 15:29:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:29:12,370 INFO L93 Difference]: Finished difference Result 12531 states and 17052 transitions. [2021-12-18 15:29:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 15:29:12,371 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-12-18 15:29:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:29:12,395 INFO L225 Difference]: With dead ends: 12531 [2021-12-18 15:29:12,395 INFO L226 Difference]: Without dead ends: 6448 [2021-12-18 15:29:12,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 15:29:12,420 INFO L933 BasicCegarLoop]: 2168 mSDtfsCounter, 2430 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2692 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-18 15:29:12,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2692 Valid, 3132 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [625 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-18 15:29:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6448 states. [2021-12-18 15:29:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6448 to 6100. [2021-12-18 15:29:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6100 states, 4361 states have (on average 1.263013070396698) internal successors, (5508), 4486 states have internal predecessors, (5508), 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-12-18 15:29:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6100 states to 6100 states and 8210 transitions. [2021-12-18 15:29:12,692 INFO L78 Accepts]: Start accepts. Automaton has 6100 states and 8210 transitions. Word has length 117 [2021-12-18 15:29:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:29:12,695 INFO L470 AbstractCegarLoop]: Abstraction has 6100 states and 8210 transitions. [2021-12-18 15:29:12,695 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-12-18 15:29:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6100 states and 8210 transitions. [2021-12-18 15:29:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-18 15:29:12,697 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:29:12,697 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-12-18 15:29:12,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 15:29:12,698 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-12-18 15:29:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:29:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1910334215, now seen corresponding path program 1 times [2021-12-18 15:29:12,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:29:12,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637766089] [2021-12-18 15:29:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:29:12,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:29:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:29:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:29:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:29:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:29:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:29:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:29:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:29:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:29:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:29:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:29:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:29:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:29:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:29:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:29:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:29:12,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:29:12,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637766089] [2021-12-18 15:29:12,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637766089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:29:12,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:29:12,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:29:12,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165845436] [2021-12-18 15:29:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:29:12,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:29:12,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:29:12,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:29:12,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:29:12,983 INFO L87 Difference]: Start difference. First operand 6100 states and 8210 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-12-18 15:29:16,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:22,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:29:23,563 INFO L93 Difference]: Finished difference Result 6100 states and 8210 transitions. [2021-12-18 15:29:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:29:23,564 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-12-18 15:29:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:29:23,587 INFO L225 Difference]: With dead ends: 6100 [2021-12-18 15:29:23,587 INFO L226 Difference]: Without dead ends: 6098 [2021-12-18 15:29:23,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 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-12-18 15:29:23,593 INFO L933 BasicCegarLoop]: 2067 mSDtfsCounter, 3451 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3642 SdHoareTripleChecker+Valid, 4475 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2021-12-18 15:29:23,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3642 Valid, 4475 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1619 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2021-12-18 15:29:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2021-12-18 15:29:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 6098. [2021-12-18 15:29:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6098 states, 4360 states have (on average 1.2628440366972478) internal successors, (5506), 4484 states have internal predecessors, (5506), 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-12-18 15:29:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 8208 transitions. [2021-12-18 15:29:23,955 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 8208 transitions. Word has length 100 [2021-12-18 15:29:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:29:23,956 INFO L470 AbstractCegarLoop]: Abstraction has 6098 states and 8208 transitions. [2021-12-18 15:29:23,956 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-12-18 15:29:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 8208 transitions. [2021-12-18 15:29:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-18 15:29:23,959 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:29:23,960 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-12-18 15:29:23,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 15:29:23,960 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-12-18 15:29:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:29:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1855653926, now seen corresponding path program 1 times [2021-12-18 15:29:23,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:29:23,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442156066] [2021-12-18 15:29:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:29:23,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:29:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:29:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:29:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:29:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:29:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:29:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:29:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 15:29:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 15:29:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:29:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:29:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 15:29:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:29:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:29:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 15:29:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:29:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:29:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:29:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:29:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:29:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-18 15:29:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-12-18 15:29:24,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:29:24,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442156066] [2021-12-18 15:29:24,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442156066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:29:24,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:29:24,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 15:29:24,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180015522] [2021-12-18 15:29:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:29:24,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 15:29:24,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:29:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 15:29:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 15:29:24,469 INFO L87 Difference]: Start difference. First operand 6098 states and 8208 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-12-18 15:29:30,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:32,201 WARN L534 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-12-18 15:29:35,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:43,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:45,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:47,762 WARN L534 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-12-18 15:29:49,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:29:52,910 INFO L93 Difference]: Finished difference Result 7015 states and 9372 transitions. [2021-12-18 15:29:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 15:29:52,911 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-12-18 15:29:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:29:52,931 INFO L225 Difference]: With dead ends: 7015 [2021-12-18 15:29:52,931 INFO L226 Difference]: Without dead ends: 7013 [2021-12-18 15:29:52,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-18 15:29:52,938 INFO L933 BasicCegarLoop]: 2095 mSDtfsCounter, 4354 mSDsluCounter, 4285 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 2202 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4548 SdHoareTripleChecker+Valid, 6380 SdHoareTripleChecker+Invalid, 6043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2202 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2021-12-18 15:29:52,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4548 Valid, 6380 Invalid, 6043 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2202 Valid, 3834 Invalid, 7 Unknown, 0 Unchecked, 27.5s Time] [2021-12-18 15:29:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7013 states. [2021-12-18 15:29:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7013 to 6623. [2021-12-18 15:29:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 4691 states have (on average 1.2504796418674056) internal successors, (5866), 4818 states have internal predecessors, (5866), 1430 states have call successors, (1430), 479 states have call predecessors, (1430), 478 states have return successors, (1452), 1406 states have call predecessors, (1452), 1428 states have call successors, (1452) [2021-12-18 15:29:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 8748 transitions. [2021-12-18 15:29:53,320 INFO L78 Accepts]: Start accepts. Automaton has 6623 states and 8748 transitions. Word has length 147 [2021-12-18 15:29:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:29:53,321 INFO L470 AbstractCegarLoop]: Abstraction has 6623 states and 8748 transitions. [2021-12-18 15:29:53,321 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-12-18 15:29:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6623 states and 8748 transitions. [2021-12-18 15:29:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-18 15:29:53,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:29:53,323 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-12-18 15:29:53,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 15:29:53,323 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-12-18 15:29:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:29:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1613407075, now seen corresponding path program 1 times [2021-12-18 15:29:53,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:29:53,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83998680] [2021-12-18 15:29:53,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:29:53,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:29:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:29:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:29:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:29:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:29:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:29:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:29:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:29:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:29:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:29:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:29:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:29:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:29:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:29:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:29:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:29:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:29:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:29:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:29:53,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:29:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83998680] [2021-12-18 15:29:53,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83998680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:29:53,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:29:53,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:29:53,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093841492] [2021-12-18 15:29:53,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:29:53,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:29:53,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:29:53,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:29:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:29:53,621 INFO L87 Difference]: Start difference. First operand 6623 states and 8748 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-12-18 15:29:57,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:29:59,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:04,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:07,961 WARN L534 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-12-18 15:30:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:30:09,664 INFO L93 Difference]: Finished difference Result 7043 states and 9232 transitions. [2021-12-18 15:30:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 15:30:09,665 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-12-18 15:30:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:30:09,685 INFO L225 Difference]: With dead ends: 7043 [2021-12-18 15:30:09,685 INFO L226 Difference]: Without dead ends: 7041 [2021-12-18 15:30:09,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 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-12-18 15:30:09,689 INFO L933 BasicCegarLoop]: 2066 mSDtfsCounter, 3602 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 1465 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3794 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 3221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1465 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:30:09,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3794 Valid, 4495 Invalid, 3221 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1465 Valid, 1752 Invalid, 4 Unknown, 0 Unchecked, 15.4s Time] [2021-12-18 15:30:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2021-12-18 15:30:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 7025. [2021-12-18 15:30:10,062 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-12-18 15:30:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 9210 transitions. [2021-12-18 15:30:10,086 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 9210 transitions. Word has length 106 [2021-12-18 15:30:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:30:10,087 INFO L470 AbstractCegarLoop]: Abstraction has 7025 states and 9210 transitions. [2021-12-18 15:30:10,087 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-12-18 15:30:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 9210 transitions. [2021-12-18 15:30:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-18 15:30:10,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:30:10,088 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-12-18 15:30:10,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 15:30:10,089 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-12-18 15:30:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:30:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1782742789, now seen corresponding path program 1 times [2021-12-18 15:30:10,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:30:10,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222255970] [2021-12-18 15:30:10,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:30:10,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:30:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:30:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:30:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:30:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:30:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:30:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:30:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:30:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:30:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:30:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:30:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:30:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:30:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:30:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:30:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:30:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:30:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:30:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:30:10,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:30:10,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222255970] [2021-12-18 15:30:10,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222255970] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:30:10,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:30:10,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:30:10,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982834268] [2021-12-18 15:30:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:30:10,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:30:10,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:30:10,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:30:10,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:30:10,435 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-12-18 15:30:14,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:16,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:19,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:23,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:26,168 WARN L534 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-12-18 15:30:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:30:27,763 INFO L93 Difference]: Finished difference Result 7025 states and 9210 transitions. [2021-12-18 15:30:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:30:27,763 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-12-18 15:30:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:30:27,777 INFO L225 Difference]: With dead ends: 7025 [2021-12-18 15:30:27,777 INFO L226 Difference]: Without dead ends: 7023 [2021-12-18 15:30:27,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 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-12-18 15:30:27,779 INFO L933 BasicCegarLoop]: 2063 mSDtfsCounter, 3439 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 1390 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3628 SdHoareTripleChecker+Valid, 4471 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2021-12-18 15:30:27,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3628 Valid, 4471 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1612 Invalid, 5 Unknown, 0 Unchecked, 16.8s Time] [2021-12-18 15:30:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7023 states. [2021-12-18 15:30:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7023 to 7023. [2021-12-18 15:30:28,077 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-12-18 15:30:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 9208 transitions. [2021-12-18 15:30:28,144 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 9208 transitions. Word has length 112 [2021-12-18 15:30:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:30:28,145 INFO L470 AbstractCegarLoop]: Abstraction has 7023 states and 9208 transitions. [2021-12-18 15:30:28,145 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-12-18 15:30:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 9208 transitions. [2021-12-18 15:30:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-18 15:30:28,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:30:28,147 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-12-18 15:30:28,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 15:30:28,147 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-12-18 15:30:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:30:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1112358725, now seen corresponding path program 1 times [2021-12-18 15:30:28,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:30:28,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113760000] [2021-12-18 15:30:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:30:28,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:30:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:30:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:30:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:30:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:30:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:30:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:30:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:30:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 15:30:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 15:30:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:30:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:30:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:30:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 15:30:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:30:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:30:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:30:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 15:30:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:30:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:30:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:30:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:30:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:30:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:30:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:30:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-18 15:30:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 15:30:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:30:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:30:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-12-18 15:30:28,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:30:28,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113760000] [2021-12-18 15:30:28,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113760000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:30:28,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:30:28,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 15:30:28,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218201922] [2021-12-18 15:30:28,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:30:28,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 15:30:28,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:30:28,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 15:30:28,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 15:30:28,711 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-12-18 15:30:35,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:37,140 WARN L534 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-12-18 15:30:39,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:48,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:50,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:52,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:55,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:30:57,402 WARN L534 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-12-18 15:30:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:30:59,977 INFO L93 Difference]: Finished difference Result 7896 states and 10347 transitions. [2021-12-18 15:30:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 15:30:59,977 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-12-18 15:30:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:31:00,004 INFO L225 Difference]: With dead ends: 7896 [2021-12-18 15:31:00,005 INFO L226 Difference]: Without dead ends: 7894 [2021-12-18 15:31:00,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-12-18 15:31:00,011 INFO L933 BasicCegarLoop]: 2063 mSDtfsCounter, 5427 mSDsluCounter, 4880 mSDsCounter, 0 mSdLazyCounter, 3951 mSolverCounterSat, 2848 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5621 SdHoareTripleChecker+Valid, 6943 SdHoareTripleChecker+Invalid, 6807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2848 IncrementalHoareTripleChecker+Valid, 3951 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2021-12-18 15:31:00,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5621 Valid, 6943 Invalid, 6807 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2848 Valid, 3951 Invalid, 8 Unknown, 0 Unchecked, 30.2s Time] [2021-12-18 15:31:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7894 states. [2021-12-18 15:31:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7894 to 7324. [2021-12-18 15:31:00,355 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-12-18 15:31:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 9519 transitions. [2021-12-18 15:31:00,374 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 9519 transitions. Word has length 159 [2021-12-18 15:31:00,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:31:00,375 INFO L470 AbstractCegarLoop]: Abstraction has 7324 states and 9519 transitions. [2021-12-18 15:31:00,375 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-12-18 15:31:00,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 9519 transitions. [2021-12-18 15:31:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-18 15:31:00,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:31:00,378 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-12-18 15:31:00,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 15:31:00,378 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-12-18 15:31:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:31:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1114967044, now seen corresponding path program 1 times [2021-12-18 15:31:00,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:31:00,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46919005] [2021-12-18 15:31:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:31:00,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:31:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:31:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:31:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:31:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:31:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:31:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:31:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:31:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 15:31:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 15:31:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:31:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:31:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:31:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 15:31:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:31:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:31:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:31:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 15:31:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:31:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:31:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:31:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:31:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:31:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:31:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:31:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-18 15:31:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 15:31:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:31:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2021-12-18 15:31:00,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:31:00,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46919005] [2021-12-18 15:31:00,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46919005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:31:00,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:31:00,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 15:31:00,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629000028] [2021-12-18 15:31:00,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:31:00,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 15:31:00,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:31:00,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 15:31:00,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 15:31:00,999 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-12-18 15:31:08,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:10,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:12,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:14,439 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:16,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:18,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:21,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:24,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:26,930 WARN L534 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-12-18 15:31:35,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:38,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:41,546 WARN L534 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-12-18 15:31:43,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:31:45,582 WARN L534 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-12-18 15:31:47,602 WARN L534 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-12-18 15:31:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:31:51,403 INFO L93 Difference]: Finished difference Result 7758 states and 10190 transitions. [2021-12-18 15:31:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 15:31:51,404 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-12-18 15:31:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:31:51,423 INFO L225 Difference]: With dead ends: 7758 [2021-12-18 15:31:51,423 INFO L226 Difference]: Without dead ends: 7756 [2021-12-18 15:31:51,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-12-18 15:31:51,427 INFO L933 BasicCegarLoop]: 2174 mSDtfsCounter, 3546 mSDsluCounter, 5611 mSDsCounter, 0 mSdLazyCounter, 5472 mSolverCounterSat, 2432 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3559 SdHoareTripleChecker+Valid, 7785 SdHoareTripleChecker+Invalid, 7919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2432 IncrementalHoareTripleChecker+Valid, 5472 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.3s IncrementalHoareTripleChecker+Time [2021-12-18 15:31:51,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3559 Valid, 7785 Invalid, 7919 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2432 Valid, 5472 Invalid, 15 Unknown, 0 Unchecked, 49.3s Time] [2021-12-18 15:31:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7756 states. [2021-12-18 15:31:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7756 to 7324. [2021-12-18 15:31:51,763 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-12-18 15:31:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 9515 transitions. [2021-12-18 15:31:51,783 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 9515 transitions. Word has length 160 [2021-12-18 15:31:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:31:51,783 INFO L470 AbstractCegarLoop]: Abstraction has 7324 states and 9515 transitions. [2021-12-18 15:31:51,783 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-12-18 15:31:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 9515 transitions. [2021-12-18 15:31:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-18 15:31:51,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:31:51,785 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-12-18 15:31:51,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 15:31:51,786 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-12-18 15:31:51,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:31:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1350917253, now seen corresponding path program 1 times [2021-12-18 15:31:51,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:31:51,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290615235] [2021-12-18 15:31:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:31:51,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:31:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:51,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:31:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:31:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:31:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:51,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:31:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:31:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:31:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:31:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:31:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:31:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:31:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:31:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:31:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:31:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:31:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:31:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:31:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:31:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:31:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:31:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:31:52,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:31:52,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290615235] [2021-12-18 15:31:52,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290615235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:31:52,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:31:52,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:31:52,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260464731] [2021-12-18 15:31:52,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:31:52,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:31:52,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:31:52,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:31:52,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:31:52,078 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-12-18 15:31:56,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:01,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:32:03,097 INFO L93 Difference]: Finished difference Result 7324 states and 9515 transitions. [2021-12-18 15:32:03,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:32:03,098 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-12-18 15:32:03,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:32:03,118 INFO L225 Difference]: With dead ends: 7324 [2021-12-18 15:32:03,118 INFO L226 Difference]: Without dead ends: 7322 [2021-12-18 15:32:03,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 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-12-18 15:32:03,123 INFO L933 BasicCegarLoop]: 2061 mSDtfsCounter, 3433 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3621 SdHoareTripleChecker+Valid, 4469 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:32:03,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3621 Valid, 4469 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1613 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2021-12-18 15:32:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7322 states. [2021-12-18 15:32:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7322 to 7322. [2021-12-18 15:32:03,457 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-12-18 15:32:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7322 states to 7322 states and 9513 transitions. [2021-12-18 15:32:03,476 INFO L78 Accepts]: Start accepts. Automaton has 7322 states and 9513 transitions. Word has length 118 [2021-12-18 15:32:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:32:03,477 INFO L470 AbstractCegarLoop]: Abstraction has 7322 states and 9513 transitions. [2021-12-18 15:32:03,477 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-12-18 15:32:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 7322 states and 9513 transitions. [2021-12-18 15:32:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-18 15:32:03,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:32:03,479 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-12-18 15:32:03,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 15:32:03,479 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-12-18 15:32:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:32:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2110545786, now seen corresponding path program 1 times [2021-12-18 15:32:03,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:32:03,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316962213] [2021-12-18 15:32:03,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:32:03,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:32:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:32:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:32:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:32:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:32:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:32:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:32:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:32:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:32:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:32:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:32:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:32:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:32:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:32:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:32:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:32:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:32:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:32:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:32:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:32:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:32:03,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:32:03,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316962213] [2021-12-18 15:32:03,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316962213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:32:03,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:32:03,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:32:03,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418999796] [2021-12-18 15:32:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:32:03,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:32:03,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:32:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:32:03,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:32:03,800 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-12-18 15:32:07,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:10,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:12,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:17,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:19,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:32:21,169 INFO L93 Difference]: Finished difference Result 7322 states and 9513 transitions. [2021-12-18 15:32:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:32:21,170 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-12-18 15:32:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:32:21,193 INFO L225 Difference]: With dead ends: 7322 [2021-12-18 15:32:21,193 INFO L226 Difference]: Without dead ends: 7320 [2021-12-18 15:32:21,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 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-12-18 15:32:21,198 INFO L933 BasicCegarLoop]: 2059 mSDtfsCounter, 3427 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 1390 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.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, 1608 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2021-12-18 15:32:21,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3614 Valid, 4467 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1608 Invalid, 5 Unknown, 0 Unchecked, 16.8s Time] [2021-12-18 15:32:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2021-12-18 15:32:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 7320. [2021-12-18 15:32:21,519 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-12-18 15:32:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7320 states to 7320 states and 9511 transitions. [2021-12-18 15:32:21,540 INFO L78 Accepts]: Start accepts. Automaton has 7320 states and 9511 transitions. Word has length 124 [2021-12-18 15:32:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:32:21,540 INFO L470 AbstractCegarLoop]: Abstraction has 7320 states and 9511 transitions. [2021-12-18 15:32:21,540 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-12-18 15:32:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7320 states and 9511 transitions. [2021-12-18 15:32:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-18 15:32:21,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:32:21,542 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-12-18 15:32:21,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 15:32:21,543 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-12-18 15:32:21,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:32:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash 879317444, now seen corresponding path program 1 times [2021-12-18 15:32:21,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:32:21,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061515330] [2021-12-18 15:32:21,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:32:21,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:32:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:32:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:32:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:32:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:32:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:32:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:32:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:32:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 15:32:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 15:32:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:32:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:32:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:32:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:21,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 15:32:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:32:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:32:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:32:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 15:32:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:32:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:32:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:32:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:32:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:32:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:32:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:32:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-18 15:32:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 15:32:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:32:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-18 15:32:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:32:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:32:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2021-12-18 15:32:22,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:32:22,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061515330] [2021-12-18 15:32:22,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061515330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:32:22,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:32:22,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 15:32:22,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065479246] [2021-12-18 15:32:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:32:22,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 15:32:22,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:32:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 15:32:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 15:32:22,202 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-12-18 15:32:29,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:31,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:35,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:37,963 WARN L534 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-12-18 15:32:41,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:43,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:51,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:53,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:32:56,708 WARN L534 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-12-18 15:32:58,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:00,742 WARN L534 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-12-18 15:33:02,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:05,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:07,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:33:11,021 INFO L93 Difference]: Finished difference Result 7752 states and 10181 transitions. [2021-12-18 15:33:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 15:33:11,022 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-12-18 15:33:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:33:11,043 INFO L225 Difference]: With dead ends: 7752 [2021-12-18 15:33:11,043 INFO L226 Difference]: Without dead ends: 7750 [2021-12-18 15:33:11,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-12-18 15:33:11,048 INFO L933 BasicCegarLoop]: 2169 mSDtfsCounter, 4403 mSDsluCounter, 6249 mSDsCounter, 0 mSdLazyCounter, 5606 mSolverCounterSat, 3049 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4409 SdHoareTripleChecker+Valid, 8418 SdHoareTripleChecker+Invalid, 8669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3049 IncrementalHoareTripleChecker+Valid, 5606 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.6s IncrementalHoareTripleChecker+Time [2021-12-18 15:33:11,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4409 Valid, 8418 Invalid, 8669 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3049 Valid, 5606 Invalid, 14 Unknown, 0 Unchecked, 47.6s Time] [2021-12-18 15:33:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7750 states. [2021-12-18 15:33:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7750 to 7320. [2021-12-18 15:33:11,377 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-12-18 15:33:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7320 states to 7320 states and 9503 transitions. [2021-12-18 15:33:11,397 INFO L78 Accepts]: Start accepts. Automaton has 7320 states and 9503 transitions. Word has length 172 [2021-12-18 15:33:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:33:11,397 INFO L470 AbstractCegarLoop]: Abstraction has 7320 states and 9503 transitions. [2021-12-18 15:33:11,397 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-12-18 15:33:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 7320 states and 9503 transitions. [2021-12-18 15:33:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-18 15:33:11,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:33:11,399 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-12-18 15:33:11,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-18 15:33:11,400 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-12-18 15:33:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:33:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash -918574393, now seen corresponding path program 1 times [2021-12-18 15:33:11,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:33:11,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441918452] [2021-12-18 15:33:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:33:11,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:33:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:33:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:33:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:33:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:33:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:33:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:33:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:33:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:33:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:33:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:33:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:33:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:33:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:33:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:33:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:33:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:33:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:33:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:33:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:33:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 15:33:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:33:11,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:33:11,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441918452] [2021-12-18 15:33:11,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441918452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:33:11,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:33:11,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:33:11,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351720088] [2021-12-18 15:33:11,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:33:11,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:33:11,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:33:11,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:33:11,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:33:11,764 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-12-18 15:33:15,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:18,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:23,259 WARN L534 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-12-18 15:33:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:33:24,783 INFO L93 Difference]: Finished difference Result 7320 states and 9503 transitions. [2021-12-18 15:33:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:33:24,785 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-12-18 15:33:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:33:24,804 INFO L225 Difference]: With dead ends: 7320 [2021-12-18 15:33:24,804 INFO L226 Difference]: Without dead ends: 7318 [2021-12-18 15:33:24,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 15:33:24,809 INFO L933 BasicCegarLoop]: 2057 mSDtfsCounter, 3421 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 1390 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3607 SdHoareTripleChecker+Valid, 4465 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:33:24,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3607 Valid, 4465 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1608 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2021-12-18 15:33:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7318 states. [2021-12-18 15:33:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7318 to 7318. [2021-12-18 15:33:25,129 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-12-18 15:33:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7318 states to 7318 states and 9501 transitions. [2021-12-18 15:33:25,150 INFO L78 Accepts]: Start accepts. Automaton has 7318 states and 9501 transitions. Word has length 130 [2021-12-18 15:33:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:33:25,151 INFO L470 AbstractCegarLoop]: Abstraction has 7318 states and 9501 transitions. [2021-12-18 15:33:25,151 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-12-18 15:33:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 7318 states and 9501 transitions. [2021-12-18 15:33:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-18 15:33:25,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:33:25,153 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-12-18 15:33:25,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-18 15:33:25,153 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-12-18 15:33:25,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:33:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1479957857, now seen corresponding path program 1 times [2021-12-18 15:33:25,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:33:25,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168804867] [2021-12-18 15:33:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:33:25,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:33:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:33:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:33:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:33:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:33:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:33:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:33:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:33:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:33:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:33:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:33:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:33:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:33:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:33:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:33:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:33:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:33:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:33:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:33:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:33:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 15:33:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 15:33:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 15:33:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 15:33:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 15:33:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 15:33:25,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:33:25,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168804867] [2021-12-18 15:33:25,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168804867] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:33:25,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:33:25,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:33:25,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832809532] [2021-12-18 15:33:25,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:33:25,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:33:25,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:33:25,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:33:25,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:33:25,606 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-12-18 15:33:31,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:35,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:33:37,274 INFO L93 Difference]: Finished difference Result 8162 states and 10585 transitions. [2021-12-18 15:33:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 15:33:37,275 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-12-18 15:33:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:33:37,292 INFO L225 Difference]: With dead ends: 8162 [2021-12-18 15:33:37,292 INFO L226 Difference]: Without dead ends: 8160 [2021-12-18 15:33:37,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-18 15:33:37,296 INFO L933 BasicCegarLoop]: 2176 mSDtfsCounter, 1983 mSDsluCounter, 4742 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 545 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 6918 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2021-12-18 15:33:37,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2203 Valid, 6918 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 1889 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2021-12-18 15:33:37,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8160 states. [2021-12-18 15:33:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8160 to 7625. [2021-12-18 15:33:37,636 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-12-18 15:33:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7625 states to 7625 states and 9797 transitions. [2021-12-18 15:33:37,655 INFO L78 Accepts]: Start accepts. Automaton has 7625 states and 9797 transitions. Word has length 157 [2021-12-18 15:33:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:33:37,655 INFO L470 AbstractCegarLoop]: Abstraction has 7625 states and 9797 transitions. [2021-12-18 15:33:37,655 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-12-18 15:33:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7625 states and 9797 transitions. [2021-12-18 15:33:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-18 15:33:37,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:33:37,657 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-12-18 15:33:37,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-18 15:33:37,657 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-12-18 15:33:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:33:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash 986839772, now seen corresponding path program 1 times [2021-12-18 15:33:37,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:33:37,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152013554] [2021-12-18 15:33:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:33:37,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:33:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:33:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:33:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:33:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:33:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:33:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:33:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:33:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:33:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:33:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:33:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:33:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:33:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:33:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:33:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:33:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:33:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:33:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:33:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:33:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 15:33:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-18 15:33:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:33:37,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:33:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152013554] [2021-12-18 15:33:37,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152013554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:33:37,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:33:37,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:33:37,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116847969] [2021-12-18 15:33:37,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:33:37,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:33:37,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:33:37,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:33:37,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:33:37,982 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-12-18 15:33:41,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:47,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:33:48,807 INFO L93 Difference]: Finished difference Result 7625 states and 9797 transitions. [2021-12-18 15:33:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:33:48,807 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-12-18 15:33:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:33:48,826 INFO L225 Difference]: With dead ends: 7625 [2021-12-18 15:33:48,826 INFO L226 Difference]: Without dead ends: 7623 [2021-12-18 15:33:48,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 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-12-18 15:33:48,831 INFO L933 BasicCegarLoop]: 2055 mSDtfsCounter, 3415 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3600 SdHoareTripleChecker+Valid, 4463 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2021-12-18 15:33:48,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3600 Valid, 4463 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1607 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2021-12-18 15:33:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2021-12-18 15:33:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 7623. [2021-12-18 15:33:49,176 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-12-18 15:33:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7623 states to 7623 states and 9795 transitions. [2021-12-18 15:33:49,196 INFO L78 Accepts]: Start accepts. Automaton has 7623 states and 9795 transitions. Word has length 136 [2021-12-18 15:33:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:33:49,197 INFO L470 AbstractCegarLoop]: Abstraction has 7623 states and 9795 transitions. [2021-12-18 15:33:49,197 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-12-18 15:33:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7623 states and 9795 transitions. [2021-12-18 15:33:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-18 15:33:49,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:33:49,198 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-12-18 15:33:49,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-18 15:33:49,199 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-12-18 15:33:49,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:33:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash -965099567, now seen corresponding path program 1 times [2021-12-18 15:33:49,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:33:49,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395886090] [2021-12-18 15:33:49,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:33:49,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:33:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:33:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:33:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:33:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:33:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:33:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:33:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:33:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:33:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:33:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:33:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:33:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:33:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:33:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:33:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:33:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:33:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:33:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:33:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:33:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 15:33:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-18 15:33:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 15:33:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:33:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:33:49,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:33:49,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395886090] [2021-12-18 15:33:49,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395886090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:33:49,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:33:49,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:33:49,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27928555] [2021-12-18 15:33:49,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:33:49,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:33:49,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:33:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:33:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:33:49,540 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-12-18 15:33:53,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:33:58,973 WARN L534 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-12-18 15:34:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:34:00,536 INFO L93 Difference]: Finished difference Result 7623 states and 9795 transitions. [2021-12-18 15:34:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:34:00,537 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-12-18 15:34:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:34:00,554 INFO L225 Difference]: With dead ends: 7623 [2021-12-18 15:34:00,555 INFO L226 Difference]: Without dead ends: 7621 [2021-12-18 15:34:00,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 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-12-18 15:34:00,559 INFO L933 BasicCegarLoop]: 2053 mSDtfsCounter, 3409 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s 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, 10.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:34:00,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3593 Valid, 4461 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1605 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2021-12-18 15:34:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7621 states. [2021-12-18 15:34:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7621 to 7621. [2021-12-18 15:34:00,918 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-12-18 15:34:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7621 states to 7621 states and 9793 transitions. [2021-12-18 15:34:00,938 INFO L78 Accepts]: Start accepts. Automaton has 7621 states and 9793 transitions. Word has length 142 [2021-12-18 15:34:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:34:00,939 INFO L470 AbstractCegarLoop]: Abstraction has 7621 states and 9793 transitions. [2021-12-18 15:34:00,939 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-12-18 15:34:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7621 states and 9793 transitions. [2021-12-18 15:34:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-12-18 15:34:00,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:34:00,942 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-12-18 15:34:00,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-18 15:34:00,942 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-12-18 15:34:00,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:34:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1796441848, now seen corresponding path program 1 times [2021-12-18 15:34:00,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:34:00,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453544677] [2021-12-18 15:34:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:34:00,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:34:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:34:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:34:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:34:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:34:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:34:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:34:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:34:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:34:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:34:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:34:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:34:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:34:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:34:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:34:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:34:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:34:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:34:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:34:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 15:34:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-18 15:34:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 15:34:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 15:34:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:34:01,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:34:01,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453544677] [2021-12-18 15:34:01,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453544677] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:34:01,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:34:01,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:34:01,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748228648] [2021-12-18 15:34:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:34:01,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:34:01,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:34:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:34:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:34:01,278 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-12-18 15:34:05,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:07,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:12,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:34:14,317 INFO L93 Difference]: Finished difference Result 7621 states and 9793 transitions. [2021-12-18 15:34:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:34:14,318 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-12-18 15:34:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:34:14,338 INFO L225 Difference]: With dead ends: 7621 [2021-12-18 15:34:14,338 INFO L226 Difference]: Without dead ends: 7619 [2021-12-18 15:34:14,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 15:34:14,343 INFO L933 BasicCegarLoop]: 2051 mSDtfsCounter, 3403 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 1390 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3586 SdHoareTripleChecker+Valid, 4459 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:34:14,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3586 Valid, 4459 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1602 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2021-12-18 15:34:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7619 states. [2021-12-18 15:34:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7619 to 7619. [2021-12-18 15:34:14,727 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-12-18 15:34:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7619 states to 7619 states and 9791 transitions. [2021-12-18 15:34:14,746 INFO L78 Accepts]: Start accepts. Automaton has 7619 states and 9791 transitions. Word has length 148 [2021-12-18 15:34:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:34:14,747 INFO L470 AbstractCegarLoop]: Abstraction has 7619 states and 9791 transitions. [2021-12-18 15:34:14,747 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-12-18 15:34:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7619 states and 9791 transitions. [2021-12-18 15:34:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-18 15:34:14,749 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:34:14,750 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-12-18 15:34:14,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-18 15:34:14,750 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-12-18 15:34:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:34:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1238573022, now seen corresponding path program 1 times [2021-12-18 15:34:14,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:34:14,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602077073] [2021-12-18 15:34:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:34:14,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:34:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:34:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:34:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:34:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:34:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:34:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:34:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:34:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:34:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:34:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:34:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:34:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:34:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:34:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:34:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:34:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:34:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:34:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:34:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 15:34:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-18 15:34:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 15:34:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 15:34:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 15:34:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:34:15,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:34:15,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602077073] [2021-12-18 15:34:15,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602077073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:34:15,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:34:15,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:34:15,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513396174] [2021-12-18 15:34:15,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:34:15,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:34:15,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:34:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:34:15,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:34:15,078 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-12-18 15:34:19,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:24,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:26,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:28,788 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:34:30,513 INFO L93 Difference]: Finished difference Result 7619 states and 9791 transitions. [2021-12-18 15:34:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:34:30,513 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-12-18 15:34:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:34:30,529 INFO L225 Difference]: With dead ends: 7619 [2021-12-18 15:34:30,529 INFO L226 Difference]: Without dead ends: 7617 [2021-12-18 15:34:30,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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-12-18 15:34:30,533 INFO L933 BasicCegarLoop]: 2049 mSDtfsCounter, 3397 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 1390 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3579 SdHoareTripleChecker+Valid, 4457 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1390 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2021-12-18 15:34:30,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3579 Valid, 4457 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1599 Invalid, 4 Unknown, 0 Unchecked, 14.7s Time] [2021-12-18 15:34:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7617 states. [2021-12-18 15:34:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7617 to 7617. [2021-12-18 15:34:30,889 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-12-18 15:34:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7617 states to 7617 states and 9789 transitions. [2021-12-18 15:34:30,909 INFO L78 Accepts]: Start accepts. Automaton has 7617 states and 9789 transitions. Word has length 154 [2021-12-18 15:34:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:34:30,910 INFO L470 AbstractCegarLoop]: Abstraction has 7617 states and 9789 transitions. [2021-12-18 15:34:30,910 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-12-18 15:34:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7617 states and 9789 transitions. [2021-12-18 15:34:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-12-18 15:34:30,913 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:34:30,913 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-12-18 15:34:30,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-18 15:34:30,913 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-12-18 15:34:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:34:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash 883056991, now seen corresponding path program 1 times [2021-12-18 15:34:30,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:34:30,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268347485] [2021-12-18 15:34:30,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:34:30,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:34:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:34:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:34:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:34:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:34:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:34:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:34:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:34:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:34:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:34:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:34:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:34:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:34:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:34:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:34:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:34:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:34:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:34:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:34:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 15:34:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-18 15:34:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 15:34:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 15:34:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 15:34:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 15:34:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:34:31,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:34:31,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268347485] [2021-12-18 15:34:31,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268347485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:34:31,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:34:31,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:34:31,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496743457] [2021-12-18 15:34:31,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:34:31,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:34:31,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:34:31,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:34:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:34:31,275 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-12-18 15:34:35,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:40,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:42,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:34:44,516 INFO L93 Difference]: Finished difference Result 7617 states and 9789 transitions. [2021-12-18 15:34:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:34:44,516 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-12-18 15:34:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:34:44,531 INFO L225 Difference]: With dead ends: 7617 [2021-12-18 15:34:44,531 INFO L226 Difference]: Without dead ends: 7615 [2021-12-18 15:34:44,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-12-18 15:34:44,534 INFO L933 BasicCegarLoop]: 2047 mSDtfsCounter, 3391 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 1390 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.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, 1598 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2021-12-18 15:34:44,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3572 Valid, 4455 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1598 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2021-12-18 15:34:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7615 states. [2021-12-18 15:34:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7615 to 7615. [2021-12-18 15:34:44,892 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-12-18 15:34:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7615 states to 7615 states and 9787 transitions. [2021-12-18 15:34:44,912 INFO L78 Accepts]: Start accepts. Automaton has 7615 states and 9787 transitions. Word has length 160 [2021-12-18 15:34:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:34:44,912 INFO L470 AbstractCegarLoop]: Abstraction has 7615 states and 9787 transitions. [2021-12-18 15:34:44,912 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-12-18 15:34:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 7615 states and 9787 transitions. [2021-12-18 15:34:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-12-18 15:34:44,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:34:44,915 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-12-18 15:34:44,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-18 15:34:44,916 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-12-18 15:34:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:34:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1353205139, now seen corresponding path program 1 times [2021-12-18 15:34:44,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:34:44,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780564733] [2021-12-18 15:34:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:34:44,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:34:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:34:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:34:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:34:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-18 15:34:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 15:34:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 15:34:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 15:34:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 15:34:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-18 15:34:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 15:34:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 15:34:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 15:34:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-18 15:34:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-18 15:34:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-18 15:34:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:34:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-18 15:34:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-18 15:34:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-18 15:34:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-18 15:34:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-18 15:34:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 15:34:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 15:34:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 15:34:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-18 15:34:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 15:34:45,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:34:45,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780564733] [2021-12-18 15:34:45,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780564733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:34:45,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:34:45,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:34:45,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242005936] [2021-12-18 15:34:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:34:45,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:34:45,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:34:45,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:34:45,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:34:45,264 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-12-18 15:34:49,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:54,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:34:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:34:56,499 INFO L93 Difference]: Finished difference Result 7615 states and 9787 transitions. [2021-12-18 15:34:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:34:56,499 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-12-18 15:34:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:34:56,518 INFO L225 Difference]: With dead ends: 7615 [2021-12-18 15:34:56,519 INFO L226 Difference]: Without dead ends: 7451 [2021-12-18 15:34:56,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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-12-18 15:34:56,530 INFO L933 BasicCegarLoop]: 2046 mSDtfsCounter, 3382 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 1390 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.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, 1599 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2021-12-18 15:34:56,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3562 Valid, 4454 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1390 Valid, 1599 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2021-12-18 15:34:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2021-12-18 15:34:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7451. [2021-12-18 15:34:57,095 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-12-18 15:34:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9592 transitions. [2021-12-18 15:34:57,124 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9592 transitions. Word has length 166 [2021-12-18 15:34:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:34:57,125 INFO L470 AbstractCegarLoop]: Abstraction has 7451 states and 9592 transitions. [2021-12-18 15:34:57,125 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-12-18 15:34:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9592 transitions. [2021-12-18 15:34:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-12-18 15:34:57,127 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:34:57,128 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-12-18 15:34:57,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-18 15:34:57,129 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-12-18 15:34:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:34:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash 799963522, now seen corresponding path program 1 times [2021-12-18 15:34:57,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:34:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437962823] [2021-12-18 15:34:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:34:57,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:34:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:34:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:34:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:34:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:34:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:34:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:34:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:34:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:34:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:34:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:34:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:34:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:34:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:34:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:34:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 15:34:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 15:34:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 15:34:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 15:34:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 15:34:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-18 15:34:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-18 15:34:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:34:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:34:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-18 15:34:57,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:34:57,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437962823] [2021-12-18 15:34:57,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437962823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:34:57,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:34:57,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 15:34:57,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574921359] [2021-12-18 15:34:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:34:57,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 15:34:57,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:34:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 15:34:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 15:34:57,641 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-12-18 15:35:01,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:03,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:05,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:07,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:10,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:13,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:15,641 WARN L534 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-12-18 15:35:21,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:23,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:35:26,109 INFO L93 Difference]: Finished difference Result 17602 states and 23347 transitions. [2021-12-18 15:35:26,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 15:35:26,110 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-12-18 15:35:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:35:26,131 INFO L225 Difference]: With dead ends: 17602 [2021-12-18 15:35:26,132 INFO L226 Difference]: Without dead ends: 10178 [2021-12-18 15:35:26,156 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-12-18 15:35:26,156 INFO L933 BasicCegarLoop]: 2780 mSDtfsCounter, 1842 mSDsluCounter, 3605 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 882 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 6385 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 882 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2021-12-18 15:35:26,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2123 Valid, 6385 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [882 Valid, 2405 Invalid, 9 Unknown, 0 Unchecked, 27.7s Time] [2021-12-18 15:35:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10178 states. [2021-12-18 15:35:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10178 to 7467. [2021-12-18 15:35:26,587 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-12-18 15:35:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 9612 transitions. [2021-12-18 15:35:26,608 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 9612 transitions. Word has length 190 [2021-12-18 15:35:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:35:26,609 INFO L470 AbstractCegarLoop]: Abstraction has 7467 states and 9612 transitions. [2021-12-18 15:35:26,609 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-12-18 15:35:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 9612 transitions. [2021-12-18 15:35:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-18 15:35:26,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:35:26,613 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, 1, 1] [2021-12-18 15:35:26,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-18 15:35:26,614 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-12-18 15:35:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:35:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1490572407, now seen corresponding path program 1 times [2021-12-18 15:35:26,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:35:26,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254865936] [2021-12-18 15:35:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:35:26,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:35:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:35:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:35:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:35:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:35:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:35:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:35:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:35:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:35:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:35:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:35:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:35:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:35:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:35:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:35:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:35:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:35:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:35:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:35:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:35:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 15:35:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 15:35:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 15:35:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 15:35:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 15:35:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 15:35:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:35:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 15:35:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-18 15:35:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 15:35:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-18 15:35:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-12-18 15:35:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-18 15:35:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:35:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2021-12-18 15:35:27,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:35:27,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254865936] [2021-12-18 15:35:27,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254865936] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:35:27,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:35:27,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 15:35:27,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138733573] [2021-12-18 15:35:27,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:35:27,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 15:35:27,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:35:27,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 15:35:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 15:35:27,005 INFO L87 Difference]: Start difference. First operand 7467 states and 9612 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 4 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-18 15:35:31,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:33,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:35,658 WARN L534 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-12-18 15:35:37,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:40,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:42,243 WARN L534 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-12-18 15:35:44,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:48,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:55,182 WARN L534 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-12-18 15:35:57,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:35:59,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:36:02,430 INFO L93 Difference]: Finished difference Result 16583 states and 21777 transitions. [2021-12-18 15:36:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 15:36:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 4 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 208 [2021-12-18 15:36:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:36:02,453 INFO L225 Difference]: With dead ends: 16583 [2021-12-18 15:36:02,453 INFO L226 Difference]: Without dead ends: 9143 [2021-12-18 15:36:02,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-18 15:36:02,477 INFO L933 BasicCegarLoop]: 2056 mSDtfsCounter, 1485 mSDsluCounter, 3795 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 1054 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 5851 SdHoareTripleChecker+Invalid, 4375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1054 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:36:02,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1619 Valid, 5851 Invalid, 4375 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1054 Valid, 3310 Invalid, 11 Unknown, 0 Unchecked, 34.4s Time] [2021-12-18 15:36:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9143 states. [2021-12-18 15:36:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9143 to 7803. [2021-12-18 15:36:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 5517 states have (on average 1.2379916621352185) internal successors, (6830), 5641 states have internal predecessors, (6830), 1626 states have call successors, (1626), 643 states have call predecessors, (1626), 647 states have return successors, (1654), 1599 states have call predecessors, (1654), 1622 states have call successors, (1654) [2021-12-18 15:36:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 10110 transitions. [2021-12-18 15:36:03,058 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 10110 transitions. Word has length 208 [2021-12-18 15:36:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:36:03,059 INFO L470 AbstractCegarLoop]: Abstraction has 7803 states and 10110 transitions. [2021-12-18 15:36:03,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 4 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-18 15:36:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 10110 transitions. [2021-12-18 15:36:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-12-18 15:36:03,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:36:03,061 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-12-18 15:36:03,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-18 15:36:03,061 INFO L402 AbstractCegarLoop]: === Iteration 32 === 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-12-18 15:36:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:36:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash -120022645, now seen corresponding path program 1 times [2021-12-18 15:36:03,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:36:03,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328852902] [2021-12-18 15:36:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:36:03,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:36:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:36:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:36:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:36:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:36:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:36:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:36:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:36:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:36:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:36:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:36:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:36:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:36:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:36:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:36:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 15:36:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 15:36:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 15:36:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 15:36:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 15:36:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 15:36:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 15:36:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-18 15:36:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 15:36:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-18 15:36:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-18 15:36:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2021-12-18 15:36:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2021-12-18 15:36:03,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:36:03,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328852902] [2021-12-18 15:36:03,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328852902] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:36:03,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:36:03,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 15:36:03,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364708104] [2021-12-18 15:36:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:36:03,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 15:36:03,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:36:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 15:36:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 15:36:03,556 INFO L87 Difference]: Start difference. First operand 7803 states and 10110 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-12-18 15:36:08,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:11,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:13,305 WARN L534 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-12-18 15:36:15,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:19,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:27,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:29,663 WARN L534 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-12-18 15:36:31,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:36:35,233 INFO L93 Difference]: Finished difference Result 8581 states and 11319 transitions. [2021-12-18 15:36:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 15:36:35,234 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-12-18 15:36:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:36:35,254 INFO L225 Difference]: With dead ends: 8581 [2021-12-18 15:36:35,254 INFO L226 Difference]: Without dead ends: 8579 [2021-12-18 15:36:35,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-18 15:36:35,258 INFO L933 BasicCegarLoop]: 1965 mSDtfsCounter, 1609 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 3977 mSolverCounterSat, 1068 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 6427 SdHoareTripleChecker+Invalid, 5053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1068 IncrementalHoareTripleChecker+Valid, 3977 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2021-12-18 15:36:35,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1693 Valid, 6427 Invalid, 5053 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1068 Valid, 3977 Invalid, 8 Unknown, 0 Unchecked, 30.6s Time] [2021-12-18 15:36:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8579 states. [2021-12-18 15:36:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8579 to 7803. [2021-12-18 15:36:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 5517 states have (on average 1.2367228566249773) internal successors, (6823), 5641 states have internal predecessors, (6823), 1626 states have call successors, (1626), 643 states have call predecessors, (1626), 647 states have return successors, (1654), 1599 states have call predecessors, (1654), 1622 states have call successors, (1654) [2021-12-18 15:36:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 10103 transitions. [2021-12-18 15:36:35,787 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 10103 transitions. Word has length 206 [2021-12-18 15:36:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:36:35,788 INFO L470 AbstractCegarLoop]: Abstraction has 7803 states and 10103 transitions. [2021-12-18 15:36:35,788 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-12-18 15:36:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 10103 transitions. [2021-12-18 15:36:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-12-18 15:36:35,790 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:36:35,790 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-12-18 15:36:35,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-18 15:36:35,790 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-12-18 15:36:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:36:35,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1110947557, now seen corresponding path program 1 times [2021-12-18 15:36:35,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:36:35,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789311123] [2021-12-18 15:36:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:36:35,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:36:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:36:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:36:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:36:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:36:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:36:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:36:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:36:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:36:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:36:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:36:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:36:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:36:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:36:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:36:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 15:36:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 15:36:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 15:36:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 15:36:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 15:36:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-18 15:36:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 15:36:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-18 15:36:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:36:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:36:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2021-12-18 15:36:36,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:36:36,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789311123] [2021-12-18 15:36:36,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789311123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:36:36,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:36:36,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 15:36:36,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590726229] [2021-12-18 15:36:36,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:36:36,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 15:36:36,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:36:36,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 15:36:36,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 15:36:36,557 INFO L87 Difference]: Start difference. First operand 7803 states and 10103 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-12-18 15:36:42,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:44,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:46,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:49,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:51,888 WARN L534 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-12-18 15:36:53,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:56,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:36:58,121 WARN L534 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-12-18 15:37:00,224 WARN L534 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-12-18 15:37:02,334 WARN L534 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-12-18 15:37:04,439 WARN L534 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-12-18 15:37:08,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:37:19,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:37:21,660 WARN L534 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-12-18 15:37:23,689 WARN L534 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-12-18 15:37:25,711 WARN L534 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-12-18 15:37:27,752 WARN L534 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-12-18 15:37:29,826 WARN L534 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-12-18 15:37:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:37:36,087 INFO L93 Difference]: Finished difference Result 18562 states and 24763 transitions. [2021-12-18 15:37:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 15:37:36,088 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-12-18 15:37:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:37:36,112 INFO L225 Difference]: With dead ends: 18562 [2021-12-18 15:37:36,112 INFO L226 Difference]: Without dead ends: 10786 [2021-12-18 15:37:36,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-18 15:37:36,130 INFO L933 BasicCegarLoop]: 2773 mSDtfsCounter, 1843 mSDsluCounter, 11562 mSDsCounter, 0 mSdLazyCounter, 6318 mSolverCounterSat, 885 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 14335 SdHoareTripleChecker+Invalid, 7220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 6318 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.2s IncrementalHoareTripleChecker+Time [2021-12-18 15:37:36,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2128 Valid, 14335 Invalid, 7220 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [885 Valid, 6318 Invalid, 17 Unknown, 0 Unchecked, 58.2s Time] [2021-12-18 15:37:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10786 states. [2021-12-18 15:37:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10786 to 7827. [2021-12-18 15:37:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7827 states, 5533 states have (on average 1.2360383155611785) internal successors, (6839), 5657 states have internal predecessors, (6839), 1626 states have call successors, (1626), 643 states have call predecessors, (1626), 655 states have return successors, (1666), 1607 states have call predecessors, (1666), 1622 states have call successors, (1666) [2021-12-18 15:37:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7827 states to 7827 states and 10131 transitions. [2021-12-18 15:37:36,634 INFO L78 Accepts]: Start accepts. Automaton has 7827 states and 10131 transitions. Word has length 206 [2021-12-18 15:37:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:37:36,634 INFO L470 AbstractCegarLoop]: Abstraction has 7827 states and 10131 transitions. [2021-12-18 15:37:36,634 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-12-18 15:37:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7827 states and 10131 transitions. [2021-12-18 15:37:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-12-18 15:37:36,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:37:36,638 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-12-18 15:37:36,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-18 15:37:36,638 INFO L402 AbstractCegarLoop]: === Iteration 34 === 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-12-18 15:37:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:37:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash -588709909, now seen corresponding path program 1 times [2021-12-18 15:37:36,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:37:36,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891420553] [2021-12-18 15:37:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:37:36,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:37:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:36,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:37:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:37:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:37:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:37:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:37:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:37:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:37:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:37:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:37:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:37:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:37:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:37:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:37:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:37:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 15:37:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 15:37:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 15:37:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 15:37:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 15:37:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-18 15:37:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 15:37:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 15:37:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:37:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 15:37:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-18 15:37:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:37:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:37:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2021-12-18 15:37:37,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:37:37,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891420553] [2021-12-18 15:37:37,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891420553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:37:37,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:37:37,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 15:37:37,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474769385] [2021-12-18 15:37:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:37:37,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 15:37:37,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:37:37,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 15:37:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 15:37:37,219 INFO L87 Difference]: Start difference. First operand 7827 states and 10131 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-12-18 15:37:49,301 WARN L534 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-12-18 15:37:51,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:37:53,323 WARN L534 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-12-18 15:37:55,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:37:57,954 WARN L534 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-12-18 15:38:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:38:00,522 INFO L93 Difference]: Finished difference Result 8767 states and 11406 transitions. [2021-12-18 15:38:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 15:38:00,522 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-12-18 15:38:00,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:38:00,542 INFO L225 Difference]: With dead ends: 8767 [2021-12-18 15:38:00,542 INFO L226 Difference]: Without dead ends: 8765 [2021-12-18 15:38:00,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-12-18 15:38:00,547 INFO L933 BasicCegarLoop]: 1974 mSDtfsCounter, 2890 mSDsluCounter, 3532 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 1441 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 5506 SdHoareTripleChecker+Invalid, 4788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2021-12-18 15:38:00,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3052 Valid, 5506 Invalid, 4788 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1441 Valid, 3342 Invalid, 5 Unknown, 0 Unchecked, 22.3s Time] [2021-12-18 15:38:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2021-12-18 15:38:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 7898. [2021-12-18 15:38:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7898 states, 5589 states have (on average 1.2334943639291465) internal successors, (6894), 5710 states have internal predecessors, (6894), 1616 states have call successors, (1616), 669 states have call predecessors, (1616), 681 states have return successors, (1656), 1599 states have call predecessors, (1656), 1612 states have call successors, (1656) [2021-12-18 15:38:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 10166 transitions. [2021-12-18 15:38:01,002 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 10166 transitions. Word has length 222 [2021-12-18 15:38:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:38:01,002 INFO L470 AbstractCegarLoop]: Abstraction has 7898 states and 10166 transitions. [2021-12-18 15:38:01,002 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-12-18 15:38:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 10166 transitions. [2021-12-18 15:38:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2021-12-18 15:38:01,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:38:01,006 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-12-18 15:38:01,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-18 15:38:01,006 INFO L402 AbstractCegarLoop]: === Iteration 35 === 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-12-18 15:38:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:38:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash -678173082, now seen corresponding path program 1 times [2021-12-18 15:38:01,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:38:01,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25526389] [2021-12-18 15:38:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:38:01,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:38:01,170 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-18 15:38:01,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1357367468] [2021-12-18 15:38:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:38:01,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 15:38:01,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 15:38:01,173 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-12-18 15:38:01,175 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-12-18 15:38:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:02,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 3332 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 15:38:02,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 15:38:02,483 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-12-18 15:38:02,569 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-12-18 15:38:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2021-12-18 15:38:02,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 15:38:02,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:38:02,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25526389] [2021-12-18 15:38:02,758 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-18 15:38:02,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357367468] [2021-12-18 15:38:02,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357367468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:38:02,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:38:02,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 15:38:02,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619220301] [2021-12-18 15:38:02,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:38:02,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 15:38:02,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:38:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 15:38:02,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 15:38:02,759 INFO L87 Difference]: Start difference. First operand 7898 states and 10166 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-12-18 15:38:05,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:09,081 WARN L534 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-12-18 15:38:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:38:09,817 INFO L93 Difference]: Finished difference Result 16117 states and 20835 transitions. [2021-12-18 15:38:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 15:38:09,818 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-12-18 15:38:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:38:09,839 INFO L225 Difference]: With dead ends: 16117 [2021-12-18 15:38:09,839 INFO L226 Difference]: Without dead ends: 8246 [2021-12-18 15:38:09,855 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-12-18 15:38:09,855 INFO L933 BasicCegarLoop]: 2082 mSDtfsCounter, 49 mSDsluCounter, 5938 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 8020 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-12-18 15:38:09,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 8020 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 377 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2021-12-18 15:38:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8246 states. [2021-12-18 15:38:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8246 to 7934. [2021-12-18 15:38:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7934 states, 5625 states have (on average 1.2341333333333333) internal successors, (6942), 5746 states have internal predecessors, (6942), 1616 states have call successors, (1616), 669 states have call predecessors, (1616), 681 states have return successors, (1656), 1599 states have call predecessors, (1656), 1612 states have call successors, (1656) [2021-12-18 15:38:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7934 states to 7934 states and 10214 transitions. [2021-12-18 15:38:10,391 INFO L78 Accepts]: Start accepts. Automaton has 7934 states and 10214 transitions. Word has length 223 [2021-12-18 15:38:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:38:10,392 INFO L470 AbstractCegarLoop]: Abstraction has 7934 states and 10214 transitions. [2021-12-18 15:38:10,392 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-12-18 15:38:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7934 states and 10214 transitions. [2021-12-18 15:38:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-12-18 15:38:10,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:38:10,395 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-12-18 15:38:10,420 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-12-18 15:38:10,596 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,SelfDestructingSolverStorable34 [2021-12-18 15:38:10,596 INFO L402 AbstractCegarLoop]: === Iteration 36 === 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-12-18 15:38:10,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:38:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash -858096802, now seen corresponding path program 1 times [2021-12-18 15:38:10,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:38:10,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626255011] [2021-12-18 15:38:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:38:10,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:38:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:38:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:38:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:38:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:38:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:38:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:38:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:38:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:38:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:38:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:38:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:38:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:38:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:38:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:38:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 15:38:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 15:38:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 15:38:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 15:38:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 15:38:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-18 15:38:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 15:38:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 15:38:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 15:38:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 15:38:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-18 15:38:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-18 15:38:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-18 15:38:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2021-12-18 15:38:11,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:38:11,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626255011] [2021-12-18 15:38:11,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626255011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:38:11,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:38:11,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 15:38:11,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688758850] [2021-12-18 15:38:11,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:38:11,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 15:38:11,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:38:11,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 15:38:11,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 15:38:11,235 INFO L87 Difference]: Start difference. First operand 7934 states and 10214 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-12-18 15:38:16,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:18,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:20,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:23,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:26,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:28,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:30,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:32,746 WARN L534 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-12-18 15:38:34,860 WARN L534 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-12-18 15:38:38,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:48,365 WARN L534 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-12-18 15:38:50,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:52,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:54,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:38:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 15:38:58,280 INFO L93 Difference]: Finished difference Result 8604 states and 11247 transitions. [2021-12-18 15:38:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 15:38:58,281 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-12-18 15:38:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 15:38:58,298 INFO L225 Difference]: With dead ends: 8604 [2021-12-18 15:38:58,298 INFO L226 Difference]: Without dead ends: 8602 [2021-12-18 15:38:58,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-12-18 15:38:58,301 INFO L933 BasicCegarLoop]: 1923 mSDtfsCounter, 2405 mSDsluCounter, 4827 mSDsCounter, 0 mSdLazyCounter, 4645 mSolverCounterSat, 1712 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 6750 SdHoareTripleChecker+Invalid, 6371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1712 IncrementalHoareTripleChecker+Valid, 4645 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.8s IncrementalHoareTripleChecker+Time [2021-12-18 15:38:58,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2409 Valid, 6750 Invalid, 6371 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1712 Valid, 4645 Invalid, 14 Unknown, 0 Unchecked, 45.8s Time] [2021-12-18 15:38:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8602 states. [2021-12-18 15:38:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8602 to 7932. [2021-12-18 15:38:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7932 states, 5624 states have (on average 1.2334637268847795) internal successors, (6937), 5744 states have internal predecessors, (6937), 1616 states have call successors, (1616), 669 states have call predecessors, (1616), 681 states have return successors, (1656), 1599 states have call predecessors, (1656), 1612 states have call successors, (1656) [2021-12-18 15:38:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7932 states to 7932 states and 10209 transitions. [2021-12-18 15:38:58,810 INFO L78 Accepts]: Start accepts. Automaton has 7932 states and 10209 transitions. Word has length 240 [2021-12-18 15:38:58,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 15:38:58,811 INFO L470 AbstractCegarLoop]: Abstraction has 7932 states and 10209 transitions. [2021-12-18 15:38:58,811 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-12-18 15:38:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 7932 states and 10209 transitions. [2021-12-18 15:38:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-12-18 15:38:58,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 15:38:58,814 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-12-18 15:38:58,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-18 15:38:58,815 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-12-18 15:38:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 15:38:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1904125414, now seen corresponding path program 1 times [2021-12-18 15:38:58,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 15:38:58,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197405644] [2021-12-18 15:38:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 15:38:58,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 15:38:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 15:38:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 15:38:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 15:38:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 15:38:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:38:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:38:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 15:38:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:38:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:38:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 15:38:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 15:38:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 15:38:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-18 15:38:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 15:38:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 15:38:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 15:38:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-18 15:38:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-18 15:38:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 15:38:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-18 15:38:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2021-12-18 15:38:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-18 15:38:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-18 15:38:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 15:38:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 15:38:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-18 15:38:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-18 15:38:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-12-18 15:38:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 15:38:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2021-12-18 15:38:59,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 15:38:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197405644] [2021-12-18 15:38:59,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197405644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 15:38:59,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 15:38:59,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 15:38:59,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239302586] [2021-12-18 15:38:59,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 15:38:59,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 15:38:59,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 15:38:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 15:38:59,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 15:38:59,325 INFO L87 Difference]: Start difference. First operand 7932 states and 10209 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-12-18 15:39:04,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:39:06,687 WARN L534 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-12-18 15:39:08,804 WARN L534 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-12-18 15:39:11,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 15:39:14,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15