./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.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 1a40e66604094f312102b838d8c965fbe1879fb2092ea49e39f812ee4cfee256 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 13:33:29,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 13:33:29,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 13:33:29,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 13:33:29,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 13:33:29,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 13:33:29,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 13:33:29,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 13:33:29,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 13:33:29,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 13:33:29,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 13:33:29,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 13:33:29,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 13:33:29,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 13:33:29,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 13:33:29,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 13:33:29,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 13:33:29,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 13:33:29,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 13:33:29,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 13:33:29,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 13:33:29,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 13:33:29,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 13:33:29,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 13:33:29,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 13:33:29,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 13:33:29,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 13:33:29,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 13:33:29,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 13:33:29,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 13:33:29,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 13:33:29,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 13:33:29,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 13:33:29,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 13:33:29,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 13:33:29,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 13:33:29,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 13:33:29,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 13:33:29,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 13:33:29,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 13:33:29,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 13:33:29,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 13:33:29,191 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 13:33:29,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 13:33:29,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 13:33:29,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 13:33:29,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 13:33:29,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 13:33:29,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 13:33:29,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 13:33:29,194 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 13:33:29,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 13:33:29,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 13:33:29,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 13:33:29,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 13:33:29,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 13:33:29,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 13:33:29,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 13:33:29,195 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 13:33:29,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 13:33:29,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 13:33:29,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 13:33:29,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 13:33:29,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 13:33:29,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 13:33:29,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 13:33:29,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 13:33:29,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 13:33:29,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 13:33:29,197 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 13:33:29,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 13:33:29,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 13:33:29,198 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 13:33:29,198 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 -> 1a40e66604094f312102b838d8c965fbe1879fb2092ea49e39f812ee4cfee256 [2021-11-17 13:33:29,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 13:33:29,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 13:33:29,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 13:33:29,445 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 13:33:29,446 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 13:33:29,447 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---net--rose--rose.ko.cil.i [2021-11-17 13:33:29,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad08646d/e88217c51cce4c9b84d6c3aa4e56402e/FLAG33ef6fb5d [2021-11-17 13:33:30,499 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 13:33:30,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i [2021-11-17 13:33:30,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad08646d/e88217c51cce4c9b84d6c3aa4e56402e/FLAG33ef6fb5d [2021-11-17 13:33:30,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad08646d/e88217c51cce4c9b84d6c3aa4e56402e [2021-11-17 13:33:30,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 13:33:30,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 13:33:30,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 13:33:30,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 13:33:30,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 13:33:30,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:33:30" (1/1) ... [2021-11-17 13:33:30,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d61c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:30, skipping insertion in model container [2021-11-17 13:33:30,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:33:30" (1/1) ... [2021-11-17 13:33:30,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 13:33:31,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 13:33:38,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680431,680444] [2021-11-17 13:33:38,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680576,680589] [2021-11-17 13:33:38,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680722,680735] [2021-11-17 13:33:38,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680887,680900] [2021-11-17 13:33:38,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681045,681058] [2021-11-17 13:33:38,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681203,681216] [2021-11-17 13:33:38,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681361,681374] [2021-11-17 13:33:38,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681521,681534] [2021-11-17 13:33:38,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681680,681693] [2021-11-17 13:33:38,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681819,681832] [2021-11-17 13:33:38,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2021-11-17 13:33:38,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2021-11-17 13:33:38,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2021-11-17 13:33:38,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2021-11-17 13:33:38,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682564,682577] [2021-11-17 13:33:38,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682715,682728] [2021-11-17 13:33:38,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682866,682879] [2021-11-17 13:33:38,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683018,683031] [2021-11-17 13:33:38,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683167,683180] [2021-11-17 13:33:38,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683315,683328] [2021-11-17 13:33:38,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683472,683485] [2021-11-17 13:33:38,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683621,683634] [2021-11-17 13:33:38,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2021-11-17 13:33:38,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2021-11-17 13:33:38,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2021-11-17 13:33:38,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2021-11-17 13:33:38,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2021-11-17 13:33:38,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2021-11-17 13:33:38,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2021-11-17 13:33:38,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2021-11-17 13:33:38,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2021-11-17 13:33:38,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2021-11-17 13:33:38,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2021-11-17 13:33:38,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2021-11-17 13:33:38,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2021-11-17 13:33:38,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2021-11-17 13:33:38,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2021-11-17 13:33:38,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2021-11-17 13:33:38,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2021-11-17 13:33:38,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2021-11-17 13:33:38,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2021-11-17 13:33:38,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2021-11-17 13:33:38,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2021-11-17 13:33:38,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686994,687007] [2021-11-17 13:33:38,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687133,687146] [2021-11-17 13:33:38,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687296,687309] [2021-11-17 13:33:38,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687462,687475] [2021-11-17 13:33:38,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687626,687639] [2021-11-17 13:33:38,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687791,687804] [2021-11-17 13:33:38,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687956,687969] [2021-11-17 13:33:38,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688122,688135] [2021-11-17 13:33:38,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688287,688300] [2021-11-17 13:33:38,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688454,688467] [2021-11-17 13:33:38,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688614,688627] [2021-11-17 13:33:38,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688776,688789] [2021-11-17 13:33:38,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688935,688948] [2021-11-17 13:33:38,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689081,689094] [2021-11-17 13:33:38,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689224,689237] [2021-11-17 13:33:38,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689368,689381] [2021-11-17 13:33:38,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689511,689524] [2021-11-17 13:33:38,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689655,689668] [2021-11-17 13:33:38,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689796,689809] [2021-11-17 13:33:38,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689934,689947] [2021-11-17 13:33:38,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690092,690105] [2021-11-17 13:33:38,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690251,690264] [2021-11-17 13:33:38,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690407,690420] [2021-11-17 13:33:38,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2021-11-17 13:33:38,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2021-11-17 13:33:38,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2021-11-17 13:33:38,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691008,691021] [2021-11-17 13:33:38,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691160,691173] [2021-11-17 13:33:38,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691308,691321] [2021-11-17 13:33:38,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691461,691474] [2021-11-17 13:33:38,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2021-11-17 13:33:38,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691762,691775] [2021-11-17 13:33:38,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691909,691922] [2021-11-17 13:33:38,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692060,692073] [2021-11-17 13:33:38,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692211,692224] [2021-11-17 13:33:38,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692359,692372] [2021-11-17 13:33:38,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692525,692538] [2021-11-17 13:33:38,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692694,692707] [2021-11-17 13:33:38,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692861,692874] [2021-11-17 13:33:38,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693029,693042] [2021-11-17 13:33:38,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693179,693192] [2021-11-17 13:33:38,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693326,693339] [2021-11-17 13:33:38,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693487,693500] [2021-11-17 13:33:38,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693657,693670] [2021-11-17 13:33:38,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693819,693832] [2021-11-17 13:33:38,770 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 13:33:38,803 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 13:33:39,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680431,680444] [2021-11-17 13:33:39,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680576,680589] [2021-11-17 13:33:39,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680722,680735] [2021-11-17 13:33:39,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680887,680900] [2021-11-17 13:33:39,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681045,681058] [2021-11-17 13:33:39,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681203,681216] [2021-11-17 13:33:39,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681361,681374] [2021-11-17 13:33:39,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681521,681534] [2021-11-17 13:33:39,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681680,681693] [2021-11-17 13:33:39,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681819,681832] [2021-11-17 13:33:39,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2021-11-17 13:33:39,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2021-11-17 13:33:39,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2021-11-17 13:33:39,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2021-11-17 13:33:39,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682564,682577] [2021-11-17 13:33:39,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682715,682728] [2021-11-17 13:33:39,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682866,682879] [2021-11-17 13:33:39,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683018,683031] [2021-11-17 13:33:39,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683167,683180] [2021-11-17 13:33:39,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683315,683328] [2021-11-17 13:33:39,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683472,683485] [2021-11-17 13:33:39,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683621,683634] [2021-11-17 13:33:39,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2021-11-17 13:33:39,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2021-11-17 13:33:39,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2021-11-17 13:33:39,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2021-11-17 13:33:39,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2021-11-17 13:33:39,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2021-11-17 13:33:39,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2021-11-17 13:33:39,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2021-11-17 13:33:39,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2021-11-17 13:33:39,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2021-11-17 13:33:39,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2021-11-17 13:33:39,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2021-11-17 13:33:39,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2021-11-17 13:33:39,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2021-11-17 13:33:39,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2021-11-17 13:33:39,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2021-11-17 13:33:39,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2021-11-17 13:33:39,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2021-11-17 13:33:39,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2021-11-17 13:33:39,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2021-11-17 13:33:39,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2021-11-17 13:33:39,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686994,687007] [2021-11-17 13:33:39,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687133,687146] [2021-11-17 13:33:39,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687296,687309] [2021-11-17 13:33:39,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687462,687475] [2021-11-17 13:33:39,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687626,687639] [2021-11-17 13:33:39,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687791,687804] [2021-11-17 13:33:39,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687956,687969] [2021-11-17 13:33:39,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688122,688135] [2021-11-17 13:33:39,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688287,688300] [2021-11-17 13:33:39,485 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688454,688467] [2021-11-17 13:33:39,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688614,688627] [2021-11-17 13:33:39,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688776,688789] [2021-11-17 13:33:39,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688935,688948] [2021-11-17 13:33:39,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689081,689094] [2021-11-17 13:33:39,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689224,689237] [2021-11-17 13:33:39,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689368,689381] [2021-11-17 13:33:39,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689511,689524] [2021-11-17 13:33:39,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689655,689668] [2021-11-17 13:33:39,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689796,689809] [2021-11-17 13:33:39,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689934,689947] [2021-11-17 13:33:39,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690092,690105] [2021-11-17 13:33:39,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690251,690264] [2021-11-17 13:33:39,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690407,690420] [2021-11-17 13:33:39,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2021-11-17 13:33:39,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2021-11-17 13:33:39,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2021-11-17 13:33:39,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691008,691021] [2021-11-17 13:33:39,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691160,691173] [2021-11-17 13:33:39,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691308,691321] [2021-11-17 13:33:39,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691461,691474] [2021-11-17 13:33:39,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2021-11-17 13:33:39,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691762,691775] [2021-11-17 13:33:39,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691909,691922] [2021-11-17 13:33:39,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692060,692073] [2021-11-17 13:33:39,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692211,692224] [2021-11-17 13:33:39,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692359,692372] [2021-11-17 13:33:39,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692525,692538] [2021-11-17 13:33:39,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692694,692707] [2021-11-17 13:33:39,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692861,692874] [2021-11-17 13:33:39,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693029,693042] [2021-11-17 13:33:39,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693179,693192] [2021-11-17 13:33:39,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693326,693339] [2021-11-17 13:33:39,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693487,693500] [2021-11-17 13:33:39,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693657,693670] [2021-11-17 13:33:39,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693819,693832] [2021-11-17 13:33:39,506 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 13:33:39,799 INFO L208 MainTranslator]: Completed translation [2021-11-17 13:33:39,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39 WrapperNode [2021-11-17 13:33:39,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 13:33:39,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 13:33:39,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 13:33:39,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 13:33:39,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:39,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,274 INFO L137 Inliner]: procedures = 963, calls = 5049, calls flagged for inlining = 494, calls inlined = 305, statements flattened = 9419 [2021-11-17 13:33:40,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 13:33:40,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 13:33:40,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 13:33:40,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 13:33:40,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 13:33:40,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 13:33:40,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 13:33:40,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 13:33:40,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (1/1) ... [2021-11-17 13:33:40,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 13:33:40,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 13:33:40,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-17 13:33:40,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-17 13:33:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_timer [2021-11-17 13:33:40,824 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_timer [2021-11-17 13:33:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2021-11-17 13:33:40,825 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2021-11-17 13:33:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure seq_puts [2021-11-17 13:33:40,825 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_puts [2021-11-17 13:33:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2021-11-17 13:33:40,825 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2021-11-17 13:33:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_heartbeat [2021-11-17 13:33:40,825 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_heartbeat [2021-11-17 13:33:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure sock_init_data [2021-11-17 13:33:40,826 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_init_data [2021-11-17 13:33:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2021-11-17 13:33:40,826 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2021-11-17 13:33:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_135 [2021-11-17 13:33:40,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_135 [2021-11-17 13:33:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure proto_unregister [2021-11-17 13:33:40,827 INFO L138 BoogieDeclarations]: Found implementation of procedure proto_unregister [2021-11-17 13:33:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 13:33:40,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-11-17 13:33:40,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 13:33:40,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-11-17 13:33:40,828 INFO L130 BoogieDeclarations]: Found specification of procedure rose_add_loopback_node [2021-11-17 13:33:40,828 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_add_loopback_node [2021-11-17 13:33:40,828 INFO L130 BoogieDeclarations]: Found specification of procedure skb_peek [2021-11-17 13:33:40,829 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_peek [2021-11-17 13:33:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure sock_set_flag [2021-11-17 13:33:40,829 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_set_flag [2021-11-17 13:33:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-17 13:33:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer [2021-11-17 13:33:40,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer [2021-11-17 13:33:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure rose_send_frame [2021-11-17 13:33:40,830 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_send_frame [2021-11-17 13:33:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure rose_destroy_socket [2021-11-17 13:33:40,830 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_destroy_socket [2021-11-17 13:33:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure rose_write_internal [2021-11-17 13:33:40,830 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_write_internal [2021-11-17 13:33:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add [2021-11-17 13:33:40,830 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add [2021-11-17 13:33:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure rose_del_loopback_node [2021-11-17 13:33:40,831 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_del_loopback_node [2021-11-17 13:33:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-17 13:33:40,831 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-17 13:33:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-11-17 13:33:40,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-11-17 13:33:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure rose_requeue_frames [2021-11-17 13:33:40,831 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_requeue_frames [2021-11-17 13:33:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure rose_rx_call_request [2021-11-17 13:33:40,832 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_rx_call_request [2021-11-17 13:33:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-11-17 13:33:40,832 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-11-17 13:33:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure rose_dev_get [2021-11-17 13:33:40,832 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_dev_get [2021-11-17 13:33:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure sock_wfree [2021-11-17 13:33:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-11-17 13:33:40,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-11-17 13:33:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure rose_new_lci [2021-11-17 13:33:40,833 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_new_lci [2021-11-17 13:33:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure seq_open [2021-11-17 13:33:40,833 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_open [2021-11-17 13:33:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 13:33:40,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-11-17 13:33:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 13:33:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 13:33:40,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-11-17 13:33:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure rose_neigh_open [2021-11-17 13:33:40,834 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_neigh_open [2021-11-17 13:33:40,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-11-17 13:33:40,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-11-17 13:33:40,835 INFO L130 BoogieDeclarations]: Found specification of procedure rose_validate_nr [2021-11-17 13:33:40,835 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_validate_nr [2021-11-17 13:33:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 13:33:40,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-11-17 13:33:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock [2021-11-17 13:33:40,839 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock [2021-11-17 13:33:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure sock_flag [2021-11-17 13:33:40,840 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_flag [2021-11-17 13:33:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure timer_pending [2021-11-17 13:33:40,840 INFO L138 BoogieDeclarations]: Found implementation of procedure timer_pending [2021-11-17 13:33:40,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 13:33:40,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 13:33:40,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-11-17 13:33:40,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-11-17 13:33:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 13:33:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure ax2asc [2021-11-17 13:33:40,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ax2asc [2021-11-17 13:33:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-17 13:33:40,845 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t0timer [2021-11-17 13:33:40,846 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t0timer [2021-11-17 13:33:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_restart_request [2021-11-17 13:33:40,846 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_restart_request [2021-11-17 13:33:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2021-11-17 13:33:40,846 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2021-11-17 13:33:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-11-17 13:33:40,846 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-11-17 13:33:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2021-11-17 13:33:40,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2021-11-17 13:33:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure rose_process_rx_frame [2021-11-17 13:33:40,847 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_process_rx_frame [2021-11-17 13:33:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 13:33:40,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 13:33:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 13:33:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2021-11-17 13:33:40,848 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2021-11-17 13:33:40,848 INFO L130 BoogieDeclarations]: Found specification of procedure sock_hold [2021-11-17 13:33:40,848 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_hold [2021-11-17 13:33:40,848 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2021-11-17 13:33:40,848 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_cb_put [2021-11-17 13:33:40,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_cb_put [2021-11-17 13:33:40,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 13:33:40,848 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 13:33:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head [2021-11-17 13:33:40,849 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head [2021-11-17 13:33:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure rose_clear_queues [2021-11-17 13:33:40,849 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_clear_queues [2021-11-17 13:33:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2021-11-17 13:33:40,849 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2021-11-17 13:33:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-11-17 13:33:40,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-11-17 13:33:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 13:33:40,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-11-17 13:33:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure rose_insert_socket [2021-11-17 13:33:40,851 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_insert_socket [2021-11-17 13:33:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure rose_parse_facilities [2021-11-17 13:33:40,851 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_parse_facilities [2021-11-17 13:33:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 13:33:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 13:33:40,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-11-17 13:33:40,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 13:33:40,852 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2021-11-17 13:33:40,852 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2021-11-17 13:33:40,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_125 [2021-11-17 13:33:40,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_125 [2021-11-17 13:33:40,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_126 [2021-11-17 13:33:40,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_126 [2021-11-17 13:33:40,852 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2021-11-17 13:33:40,853 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2021-11-17 13:33:40,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 13:33:40,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 13:33:40,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_127___0 [2021-11-17 13:33:40,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_127___0 [2021-11-17 13:33:40,853 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_idletimer [2021-11-17 13:33:40,853 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_idletimer [2021-11-17 13:33:40,854 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2021-11-17 13:33:40,854 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2021-11-17 13:33:40,854 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_link [2021-11-17 13:33:40,854 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_link [2021-11-17 13:33:40,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 13:33:40,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-11-17 13:33:40,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 13:33:40,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-11-17 13:33:40,855 INFO L130 BoogieDeclarations]: Found specification of procedure rose_find_socket [2021-11-17 13:33:40,855 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_find_socket [2021-11-17 13:33:40,855 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_node [2021-11-17 13:33:40,855 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_node [2021-11-17 13:33:40,855 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2021-11-17 13:33:40,855 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2021-11-17 13:33:40,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 13:33:40,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-11-17 13:33:40,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-11-17 13:33:40,856 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_display_timer [2021-11-17 13:33:40,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_display_timer [2021-11-17 13:33:40,856 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_route [2021-11-17 13:33:40,856 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_route [2021-11-17 13:33:40,856 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_listen_release [2021-11-17 13:33:40,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_listen_release [2021-11-17 13:33:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure rosecmp [2021-11-17 13:33:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure rosecmp [2021-11-17 13:33:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_ftimer [2021-11-17 13:33:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_ftimer [2021-11-17 13:33:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure rose_del_route_by_neigh [2021-11-17 13:33:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_del_route_by_neigh [2021-11-17 13:33:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 13:33:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-11-17 13:33:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-11-17 13:33:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-11-17 13:33:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_134 [2021-11-17 13:33:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_134 [2021-11-17 13:33:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2021-11-17 13:33:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2021-11-17 13:33:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 13:33:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 13:33:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-11-17 13:33:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-11-17 13:33:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 13:33:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-11-17 13:33:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure rose_setup [2021-11-17 13:33:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_setup [2021-11-17 13:33:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure sk_wmem_alloc_get [2021-11-17 13:33:40,860 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_wmem_alloc_get [2021-11-17 13:33:40,860 INFO L130 BoogieDeclarations]: Found specification of procedure sk_alloc [2021-11-17 13:33:40,860 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_alloc [2021-11-17 13:33:40,860 INFO L130 BoogieDeclarations]: Found specification of procedure ax25cmp [2021-11-17 13:33:40,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25cmp [2021-11-17 13:33:40,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-11-17 13:33:40,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-11-17 13:33:40,861 INFO L130 BoogieDeclarations]: Found specification of procedure remove_proc_entry [2021-11-17 13:33:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_proc_entry [2021-11-17 13:33:40,861 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t3timer [2021-11-17 13:33:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t3timer [2021-11-17 13:33:40,861 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2021-11-17 13:33:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2021-11-17 13:33:40,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-11-17 13:33:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-11-17 13:33:40,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-11-17 13:33:40,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-11-17 13:33:40,862 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_neigh [2021-11-17 13:33:40,862 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_neigh [2021-11-17 13:33:40,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 13:33:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure rose_disconnect [2021-11-17 13:33:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_disconnect [2021-11-17 13:33:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-11-17 13:33:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-11-17 13:33:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure sock_put [2021-11-17 13:33:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_put [2021-11-17 13:33:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 13:33:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure sk_rmem_alloc_get [2021-11-17 13:33:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_rmem_alloc_get [2021-11-17 13:33:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2021-11-17 13:33:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2021-11-17 13:33:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 13:33:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-11-17 13:33:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-11-17 13:33:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-11-17 13:33:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-11-17 13:33:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_free_lci [2021-11-17 13:33:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_free_lci [2021-11-17 13:33:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 13:33:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 13:33:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 13:33:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-11-17 13:33:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure rose2asc [2021-11-17 13:33:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure rose2asc [2021-11-17 13:33:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure rose_get_neigh [2021-11-17 13:33:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_get_neigh [2021-11-17 13:33:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-17 13:33:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-17 13:33:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 13:33:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-11-17 13:33:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_purge [2021-11-17 13:33:40,867 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_purge [2021-11-17 13:33:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure proc_create [2021-11-17 13:33:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure proc_create [2021-11-17 13:33:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure rose_kick [2021-11-17 13:33:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_kick [2021-11-17 13:33:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_149 [2021-11-17 13:33:40,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_149 [2021-11-17 13:33:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t2timer [2021-11-17 13:33:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t2timer [2021-11-17 13:33:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_seq_open [2021-11-17 13:33:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_seq_open [2021-11-17 13:33:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 13:33:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-17 13:33:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure read_pnet [2021-11-17 13:33:40,869 INFO L138 BoogieDeclarations]: Found implementation of procedure read_pnet [2021-11-17 13:33:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure rosecmpm [2021-11-17 13:33:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure rosecmpm [2021-11-17 13:33:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure rose_enquiry_response [2021-11-17 13:33:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_enquiry_response [2021-11-17 13:33:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2021-11-17 13:33:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2021-11-17 13:33:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 13:33:40,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-11-17 13:33:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_transport_header [2021-11-17 13:33:40,871 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_transport_header [2021-11-17 13:33:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-11-17 13:33:40,871 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-11-17 13:33:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure rose_kill_by_neigh [2021-11-17 13:33:40,871 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_kill_by_neigh [2021-11-17 13:33:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure skb_dequeue [2021-11-17 13:33:40,872 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_dequeue [2021-11-17 13:33:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_t0timer [2021-11-17 13:33:40,872 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_t0timer [2021-11-17 13:33:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 13:33:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 13:33:40,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 13:33:40,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 13:33:40,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-11-17 13:33:40,873 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2021-11-17 13:33:40,873 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2021-11-17 13:33:40,873 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-11-17 13:33:40,873 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-11-17 13:33:40,873 INFO L130 BoogieDeclarations]: Found specification of procedure skb_orphan [2021-11-17 13:33:40,873 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_orphan [2021-11-17 13:33:40,873 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2021-11-17 13:33:40,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2021-11-17 13:33:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 13:33:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2021-11-17 13:33:40,874 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2021-11-17 13:33:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 13:33:40,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-11-17 13:33:40,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_150 [2021-11-17 13:33:40,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_150 [2021-11-17 13:33:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-11-17 13:33:40,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-11-17 13:33:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure skb_set_hash_from_sk [2021-11-17 13:33:40,875 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_set_hash_from_sk [2021-11-17 13:33:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_frame [2021-11-17 13:33:40,875 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_frame [2021-11-17 13:33:40,875 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2021-11-17 13:33:40,875 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2021-11-17 13:33:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_idletimer [2021-11-17 13:33:40,876 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_idletimer [2021-11-17 13:33:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 13:33:40,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-11-17 13:33:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 13:33:40,876 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 13:33:40,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_127 [2021-11-17 13:33:40,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_127 [2021-11-17 13:33:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_128 [2021-11-17 13:33:40,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_128 [2021-11-17 13:33:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 13:33:40,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-11-17 13:33:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_open [2021-11-17 13:33:40,877 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_open [2021-11-17 13:33:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure rose_nodes_open [2021-11-17 13:33:40,877 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_nodes_open [2021-11-17 13:33:40,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 13:33:40,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-11-17 13:33:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_clear_request [2021-11-17 13:33:40,878 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_clear_request [2021-11-17 13:33:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_cb_put___0 [2021-11-17 13:33:40,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_cb_put___0 [2021-11-17 13:33:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_126___0 [2021-11-17 13:33:40,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_126___0 [2021-11-17 13:33:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-11-17 13:33:40,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-11-17 13:33:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 13:33:40,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-11-17 13:33:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2021-11-17 13:33:40,879 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2021-11-17 13:33:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure asc2ax [2021-11-17 13:33:40,879 INFO L138 BoogieDeclarations]: Found implementation of procedure asc2ax [2021-11-17 13:33:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2021-11-17 13:33:40,879 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2021-11-17 13:33:40,880 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock [2021-11-17 13:33:40,880 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock [2021-11-17 13:33:40,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 13:33:40,880 INFO L130 BoogieDeclarations]: Found specification of procedure rose_frames_acked [2021-11-17 13:33:40,880 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_frames_acked [2021-11-17 13:33:40,880 INFO L130 BoogieDeclarations]: Found specification of procedure net_eq [2021-11-17 13:33:40,880 INFO L138 BoogieDeclarations]: Found implementation of procedure net_eq [2021-11-17 13:33:40,880 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2021-11-17 13:33:40,880 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2021-11-17 13:33:42,028 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 13:33:42,031 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 13:33:42,352 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 13:34:29,511 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 13:34:29,544 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 13:34:29,544 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-17 13:34:29,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:34:29 BoogieIcfgContainer [2021-11-17 13:34:29,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 13:34:29,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 13:34:29,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 13:34:29,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 13:34:29,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:33:30" (1/3) ... [2021-11-17 13:34:29,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d34331c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:34:29, skipping insertion in model container [2021-11-17 13:34:29,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:33:39" (2/3) ... [2021-11-17 13:34:29,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d34331c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:34:29, skipping insertion in model container [2021-11-17 13:34:29,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:34:29" (3/3) ... [2021-11-17 13:34:29,558 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--rose--rose.ko.cil.i [2021-11-17 13:34:29,562 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 13:34:29,562 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2021-11-17 13:34:29,610 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 13:34:29,616 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 13:34:29,616 INFO L340 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2021-11-17 13:34:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 2940 states, 1961 states have (on average 1.3105558388577256) internal successors, (2570), 2105 states have internal predecessors, (2570), 791 states have call successors, (791), 162 states have call predecessors, (791), 161 states have return successors, (779), 738 states have call predecessors, (779), 779 states have call successors, (779) [2021-11-17 13:34:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-17 13:34:29,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:34:29,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:34:29,692 INFO L402 AbstractCegarLoop]: === Iteration 1 === 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 24 more)] === [2021-11-17 13:34:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:34:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1809857965, now seen corresponding path program 1 times [2021-11-17 13:34:29,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:34:29,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467743414] [2021-11-17 13:34:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:34:29,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:34:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:34:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 13:34:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:34:30,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:34:30,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467743414] [2021-11-17 13:34:30,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467743414] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:34:30,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:34:30,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:34:30,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525384784] [2021-11-17 13:34:30,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:34:30,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:34:30,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:34:30,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:34:30,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:34:30,567 INFO L87 Difference]: Start difference. First operand has 2940 states, 1961 states have (on average 1.3105558388577256) internal successors, (2570), 2105 states have internal predecessors, (2570), 791 states have call successors, (791), 162 states have call predecessors, (791), 161 states have return successors, (779), 738 states have call predecessors, (779), 779 states have call successors, (779) Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:34:32,644 WARN L515 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-11-17 13:34:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:34:39,857 INFO L93 Difference]: Finished difference Result 6814 states and 9758 transitions. [2021-11-17 13:34:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:34:39,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2021-11-17 13:34:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:34:39,906 INFO L225 Difference]: With dead ends: 6814 [2021-11-17 13:34:39,906 INFO L226 Difference]: Without dead ends: 3867 [2021-11-17 13:34:39,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:34:39,941 INFO L933 BasicCegarLoop]: 4612 mSDtfsCounter, 3712 mSDsluCounter, 14025 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3719 SdHoareTripleChecker+Valid, 18637 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:34:39,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3719 Valid, 18637 Invalid, 1456 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 1453 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2021-11-17 13:34:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2021-11-17 13:34:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3857. [2021-11-17 13:34:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3857 states, 2590 states have (on average 1.2814671814671814) internal successors, (3319), 2748 states have internal predecessors, (3319), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:34:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 5311 transitions. [2021-11-17 13:34:40,228 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 5311 transitions. Word has length 23 [2021-11-17 13:34:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:34:40,229 INFO L470 AbstractCegarLoop]: Abstraction has 3857 states and 5311 transitions. [2021-11-17 13:34:40,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:34:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 5311 transitions. [2021-11-17 13:34:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-17 13:34:40,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:34:40,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:34:40,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 13:34:40,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === 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 24 more)] === [2021-11-17 13:34:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:34:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1809798383, now seen corresponding path program 1 times [2021-11-17 13:34:40,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:34:40,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651963731] [2021-11-17 13:34:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:34:40,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:34:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:40,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:34:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:40,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 13:34:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:34:40,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:34:40,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651963731] [2021-11-17 13:34:40,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651963731] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:34:40,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:34:40,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-17 13:34:40,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052220297] [2021-11-17 13:34:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:34:40,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 13:34:40,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:34:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 13:34:40,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-17 13:34:40,546 INFO L87 Difference]: Start difference. First operand 3857 states and 5311 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:34:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:34:40,718 INFO L93 Difference]: Finished difference Result 3871 states and 5328 transitions. [2021-11-17 13:34:40,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 13:34:40,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2021-11-17 13:34:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:34:40,741 INFO L225 Difference]: With dead ends: 3871 [2021-11-17 13:34:40,742 INFO L226 Difference]: Without dead ends: 3869 [2021-11-17 13:34:40,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-11-17 13:34:40,747 INFO L933 BasicCegarLoop]: 3992 mSDtfsCounter, 33 mSDsluCounter, 7971 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11963 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:34:40,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 11963 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 13:34:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2021-11-17 13:34:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3859. [2021-11-17 13:34:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 2592 states have (on average 1.2808641975308641) internal successors, (3320), 2750 states have internal predecessors, (3320), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:34:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 5312 transitions. [2021-11-17 13:34:40,900 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 5312 transitions. Word has length 23 [2021-11-17 13:34:40,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:34:40,901 INFO L470 AbstractCegarLoop]: Abstraction has 3859 states and 5312 transitions. [2021-11-17 13:34:40,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:34:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 5312 transitions. [2021-11-17 13:34:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-17 13:34:40,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:34:40,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:34:40,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 13:34:40,905 INFO L402 AbstractCegarLoop]: === Iteration 3 === 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 24 more)] === [2021-11-17 13:34:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:34:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash -128193833, now seen corresponding path program 1 times [2021-11-17 13:34:40,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:34:40,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54197930] [2021-11-17 13:34:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:34:40,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:34:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:34:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-17 13:34:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 13:34:41,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:34:41,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54197930] [2021-11-17 13:34:41,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54197930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:34:41,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:34:41,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-17 13:34:41,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614044567] [2021-11-17 13:34:41,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:34:41,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 13:34:41,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:34:41,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 13:34:41,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 13:34:41,158 INFO L87 Difference]: Start difference. First operand 3859 states and 5312 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:34:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:34:41,311 INFO L93 Difference]: Finished difference Result 7703 states and 10693 transitions. [2021-11-17 13:34:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 13:34:41,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-11-17 13:34:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:34:41,338 INFO L225 Difference]: With dead ends: 7703 [2021-11-17 13:34:41,338 INFO L226 Difference]: Without dead ends: 3853 [2021-11-17 13:34:41,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 13:34:41,362 INFO L933 BasicCegarLoop]: 3987 mSDtfsCounter, 3971 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3971 SdHoareTripleChecker+Valid, 3987 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:34:41,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3971 Valid, 3987 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 13:34:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2021-11-17 13:34:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3853. [2021-11-17 13:34:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 2587 states have (on average 1.279860842674913) internal successors, (3311), 2744 states have internal predecessors, (3311), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:34:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5303 transitions. [2021-11-17 13:34:41,516 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5303 transitions. Word has length 27 [2021-11-17 13:34:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:34:41,516 INFO L470 AbstractCegarLoop]: Abstraction has 3853 states and 5303 transitions. [2021-11-17 13:34:41,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-17 13:34:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5303 transitions. [2021-11-17 13:34:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-17 13:34:41,519 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:34:41,520 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] [2021-11-17 13:34:41,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 13:34:41,520 INFO L402 AbstractCegarLoop]: === Iteration 4 === 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 24 more)] === [2021-11-17 13:34:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:34:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash 190320325, now seen corresponding path program 1 times [2021-11-17 13:34:41,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:34:41,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254156745] [2021-11-17 13:34:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:34:41,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:34:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:34:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:41,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:34:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:34:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:34:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:42,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:34:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:42,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:34:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:42,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:34:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:34:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:34:42,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:34:42,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254156745] [2021-11-17 13:34:42,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254156745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:34:42,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:34:42,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:34:42,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134208042] [2021-11-17 13:34:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:34:42,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:34:42,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:34:42,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:34:42,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:34:42,074 INFO L87 Difference]: Start difference. First operand 3853 states and 5303 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-17 13:34:44,124 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:34:46,188 WARN L515 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-11-17 13:35:01,124 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:04,060 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:05,439 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:07,572 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:35:09,564 INFO L93 Difference]: Finished difference Result 3853 states and 5303 transitions. [2021-11-17 13:35:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:35:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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 51 [2021-11-17 13:35:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:35:09,590 INFO L225 Difference]: With dead ends: 3853 [2021-11-17 13:35:09,590 INFO L226 Difference]: Without dead ends: 3851 [2021-11-17 13:35:09,595 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-11-17 13:35:09,596 INFO L933 BasicCegarLoop]: 3487 mSDtfsCounter, 6449 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 3544 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6723 SdHoareTripleChecker+Valid, 6204 SdHoareTripleChecker+Invalid, 6978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2021-11-17 13:35:09,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6723 Valid, 6204 Invalid, 6978 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3430 Invalid, 4 Unknown, 0 Unchecked, 26.8s Time] [2021-11-17 13:35:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2021-11-17 13:35:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3851. [2021-11-17 13:35:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 2586 states have (on average 1.2795823665893271) internal successors, (3309), 2742 states have internal predecessors, (3309), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:35:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5301 transitions. [2021-11-17 13:35:09,758 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5301 transitions. Word has length 51 [2021-11-17 13:35:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:35:09,759 INFO L470 AbstractCegarLoop]: Abstraction has 3851 states and 5301 transitions. [2021-11-17 13:35:09,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-17 13:35:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5301 transitions. [2021-11-17 13:35:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-17 13:35:09,766 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:35:09,766 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] [2021-11-17 13:35:09,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 13:35:09,767 INFO L402 AbstractCegarLoop]: === Iteration 5 === 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 24 more)] === [2021-11-17 13:35:09,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:35:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1571739151, now seen corresponding path program 1 times [2021-11-17 13:35:09,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:35:09,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909248227] [2021-11-17 13:35:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:35:09,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:35:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:35:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:35:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:35:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:35:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:35:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:35:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:35:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:35:10,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:35:10,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909248227] [2021-11-17 13:35:10,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909248227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:35:10,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:35:10,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:35:10,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923778911] [2021-11-17 13:35:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:35:10,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:35:10,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:35:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:35:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:35:10,240 INFO L87 Difference]: Start difference. First operand 3851 states and 5301 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:35:12,292 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:14,379 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:30,780 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:34,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:37,530 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:35:39,304 INFO L93 Difference]: Finished difference Result 3851 states and 5301 transitions. [2021-11-17 13:35:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:35:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (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 57 [2021-11-17 13:35:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:35:39,324 INFO L225 Difference]: With dead ends: 3851 [2021-11-17 13:35:39,325 INFO L226 Difference]: Without dead ends: 3849 [2021-11-17 13:35:39,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:35:39,328 INFO L933 BasicCegarLoop]: 3485 mSDtfsCounter, 6443 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3428 mSolverCounterSat, 3544 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6716 SdHoareTripleChecker+Valid, 6202 SdHoareTripleChecker+Invalid, 6976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3428 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:35:39,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6716 Valid, 6202 Invalid, 6976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3428 Invalid, 4 Unknown, 0 Unchecked, 28.4s Time] [2021-11-17 13:35:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2021-11-17 13:35:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3849. [2021-11-17 13:35:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 2585 states have (on average 1.279303675048356) internal successors, (3307), 2740 states have internal predecessors, (3307), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:35:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5299 transitions. [2021-11-17 13:35:39,484 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5299 transitions. Word has length 57 [2021-11-17 13:35:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:35:39,485 INFO L470 AbstractCegarLoop]: Abstraction has 3849 states and 5299 transitions. [2021-11-17 13:35:39,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 13:35:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5299 transitions. [2021-11-17 13:35:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-17 13:35:39,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:35:39,487 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] [2021-11-17 13:35:39,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 13:35:39,487 INFO L402 AbstractCegarLoop]: === Iteration 6 === 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 24 more)] === [2021-11-17 13:35:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:35:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash -855458997, now seen corresponding path program 1 times [2021-11-17 13:35:39,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:35:39,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058821594] [2021-11-17 13:35:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:35:39,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:35:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:35:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:35:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:35:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:35:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:35:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:35:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:35:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:35:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:35:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:35:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:35:39,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:35:39,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058821594] [2021-11-17 13:35:39,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058821594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:35:39,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:35:39,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:35:39,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083823457] [2021-11-17 13:35:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:35:39,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:35:39,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:35:39,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:35:39,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:35:39,955 INFO L87 Difference]: Start difference. First operand 3849 states and 5299 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-17 13:35:42,010 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:35:44,088 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:00,976 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:04,095 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:06,603 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:36:09,092 INFO L93 Difference]: Finished difference Result 3849 states and 5299 transitions. [2021-11-17 13:36:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:36:09,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (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 63 [2021-11-17 13:36:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:36:09,117 INFO L225 Difference]: With dead ends: 3849 [2021-11-17 13:36:09,117 INFO L226 Difference]: Without dead ends: 3847 [2021-11-17 13:36:09,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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-11-17 13:36:09,122 INFO L933 BasicCegarLoop]: 3483 mSDtfsCounter, 6437 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3426 mSolverCounterSat, 3544 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6709 SdHoareTripleChecker+Valid, 6200 SdHoareTripleChecker+Invalid, 6974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3426 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:36:09,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6709 Valid, 6200 Invalid, 6974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3426 Invalid, 4 Unknown, 0 Unchecked, 28.5s Time] [2021-11-17 13:36:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2021-11-17 13:36:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 3847. [2021-11-17 13:36:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3847 states, 2584 states have (on average 1.2790247678018576) internal successors, (3305), 2738 states have internal predecessors, (3305), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:36:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 5297 transitions. [2021-11-17 13:36:09,297 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 5297 transitions. Word has length 63 [2021-11-17 13:36:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:36:09,298 INFO L470 AbstractCegarLoop]: Abstraction has 3847 states and 5297 transitions. [2021-11-17 13:36:09,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-17 13:36:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 5297 transitions. [2021-11-17 13:36:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-17 13:36:09,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:36:09,301 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] [2021-11-17 13:36:09,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 13:36:09,302 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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 24 more)] === [2021-11-17 13:36:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:36:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1540277008, now seen corresponding path program 1 times [2021-11-17 13:36:09,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:36:09,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892588373] [2021-11-17 13:36:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:36:09,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:36:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:36:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:36:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:36:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:36:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:36:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:36:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:36:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:36:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:36:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:36:09,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:36:09,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892588373] [2021-11-17 13:36:09,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892588373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:36:09,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:36:09,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:36:09,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994647075] [2021-11-17 13:36:09,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:36:09,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:36:09,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:36:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:36:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:36:09,789 INFO L87 Difference]: Start difference. First operand 3847 states and 5297 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 13:36:11,840 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:13,935 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:31,895 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:35,713 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:38,713 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:36:40,960 INFO L93 Difference]: Finished difference Result 3847 states and 5297 transitions. [2021-11-17 13:36:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:36:40,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (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 69 [2021-11-17 13:36:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:36:40,983 INFO L225 Difference]: With dead ends: 3847 [2021-11-17 13:36:40,983 INFO L226 Difference]: Without dead ends: 3845 [2021-11-17 13:36:40,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-11-17 13:36:40,987 INFO L933 BasicCegarLoop]: 3481 mSDtfsCounter, 6431 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3423 mSolverCounterSat, 3544 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6702 SdHoareTripleChecker+Valid, 6198 SdHoareTripleChecker+Invalid, 6972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3423 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:36:40,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6702 Valid, 6198 Invalid, 6972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3423 Invalid, 5 Unknown, 0 Unchecked, 30.5s Time] [2021-11-17 13:36:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2021-11-17 13:36:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2021-11-17 13:36:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 2583 states have (on average 1.278745644599303) internal successors, (3303), 2736 states have internal predecessors, (3303), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:36:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 5295 transitions. [2021-11-17 13:36:41,153 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 5295 transitions. Word has length 69 [2021-11-17 13:36:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:36:41,154 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 5295 transitions. [2021-11-17 13:36:41,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-17 13:36:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 5295 transitions. [2021-11-17 13:36:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-17 13:36:41,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:36:41,155 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] [2021-11-17 13:36:41,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 13:36:41,156 INFO L402 AbstractCegarLoop]: === Iteration 8 === 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 24 more)] === [2021-11-17 13:36:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:36:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash -337013681, now seen corresponding path program 1 times [2021-11-17 13:36:41,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:36:41,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585286569] [2021-11-17 13:36:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:36:41,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:36:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:36:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:36:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:36:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:36:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:36:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:36:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:36:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:36:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:36:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:36:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:36:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:36:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:36:41,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:36:41,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585286569] [2021-11-17 13:36:41,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585286569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:36:41,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:36:41,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:36:41,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75981522] [2021-11-17 13:36:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:36:41,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:36:41,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:36:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:36:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:36:41,657 INFO L87 Difference]: Start difference. First operand 3845 states and 5295 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 13:36:43,712 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:36:45,814 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:04,069 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:08,005 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:10,565 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:37:12,886 INFO L93 Difference]: Finished difference Result 3845 states and 5295 transitions. [2021-11-17 13:37:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:37:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (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 75 [2021-11-17 13:37:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:37:12,906 INFO L225 Difference]: With dead ends: 3845 [2021-11-17 13:37:12,907 INFO L226 Difference]: Without dead ends: 3843 [2021-11-17 13:37:12,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 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-11-17 13:37:12,911 INFO L933 BasicCegarLoop]: 3479 mSDtfsCounter, 6425 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 3544 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6695 SdHoareTripleChecker+Valid, 6196 SdHoareTripleChecker+Invalid, 6970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2021-11-17 13:37:12,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6695 Valid, 6196 Invalid, 6970 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3421 Invalid, 5 Unknown, 0 Unchecked, 30.5s Time] [2021-11-17 13:37:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2021-11-17 13:37:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3843. [2021-11-17 13:37:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3843 states, 2582 states have (on average 1.2784663051897753) internal successors, (3301), 2734 states have internal predecessors, (3301), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:37:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 5293 transitions. [2021-11-17 13:37:13,080 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 5293 transitions. Word has length 75 [2021-11-17 13:37:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:37:13,081 INFO L470 AbstractCegarLoop]: Abstraction has 3843 states and 5293 transitions. [2021-11-17 13:37:13,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-17 13:37:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 5293 transitions. [2021-11-17 13:37:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-17 13:37:13,083 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:37:13,083 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] [2021-11-17 13:37:13,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-17 13:37:13,083 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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 24 more)] === [2021-11-17 13:37:13,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:37:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1030175907, now seen corresponding path program 1 times [2021-11-17 13:37:13,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:37:13,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079528069] [2021-11-17 13:37:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:37:13,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:37:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:37:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:37:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:37:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:37:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:37:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:37:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:37:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:37:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:37:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:37:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:37:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:37:13,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:37:13,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079528069] [2021-11-17 13:37:13,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079528069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:37:13,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:37:13,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:37:13,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906691672] [2021-11-17 13:37:13,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:37:13,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:37:13,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:37:13,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:37:13,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:37:13,660 INFO L87 Difference]: Start difference. First operand 3843 states and 5293 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 13:37:15,727 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:17,836 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:36,535 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:39,591 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:41,532 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:43,642 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:37:46,286 INFO L93 Difference]: Finished difference Result 3843 states and 5293 transitions. [2021-11-17 13:37:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:37:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (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 81 [2021-11-17 13:37:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:37:46,306 INFO L225 Difference]: With dead ends: 3843 [2021-11-17 13:37:46,307 INFO L226 Difference]: Without dead ends: 3841 [2021-11-17 13:37:46,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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-11-17 13:37:46,310 INFO L933 BasicCegarLoop]: 3477 mSDtfsCounter, 6419 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3420 mSolverCounterSat, 3544 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6688 SdHoareTripleChecker+Valid, 6194 SdHoareTripleChecker+Invalid, 6968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3420 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2021-11-17 13:37:46,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6688 Valid, 6194 Invalid, 6968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3420 Invalid, 4 Unknown, 0 Unchecked, 31.9s Time] [2021-11-17 13:37:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2021-11-17 13:37:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3841. [2021-11-17 13:37:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 2581 states have (on average 1.2781867493219683) internal successors, (3299), 2732 states have internal predecessors, (3299), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:37:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5291 transitions. [2021-11-17 13:37:46,484 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5291 transitions. Word has length 81 [2021-11-17 13:37:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:37:46,484 INFO L470 AbstractCegarLoop]: Abstraction has 3841 states and 5291 transitions. [2021-11-17 13:37:46,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 13:37:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5291 transitions. [2021-11-17 13:37:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-17 13:37:46,486 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:37:46,486 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] [2021-11-17 13:37:46,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-17 13:37:46,486 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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 24 more)] === [2021-11-17 13:37:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:37:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash 429809083, now seen corresponding path program 1 times [2021-11-17 13:37:46,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:37:46,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143126416] [2021-11-17 13:37:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:37:46,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:37:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:37:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:37:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:37:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:37:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:37:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:37:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:37:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:37:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:37:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:37:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:37:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:37:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 13:37:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:37:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:37:46,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:37:46,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143126416] [2021-11-17 13:37:46,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143126416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:37:46,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:37:46,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:37:46,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857349420] [2021-11-17 13:37:46,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:37:46,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:37:46,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:37:46,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:37:46,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:37:46,987 INFO L87 Difference]: Start difference. First operand 3841 states and 5291 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 13:37:49,043 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:37:51,170 WARN L515 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-11-17 13:38:11,076 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:15,069 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:18,004 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:38:20,443 INFO L93 Difference]: Finished difference Result 3841 states and 5291 transitions. [2021-11-17 13:38:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:38:20,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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 87 [2021-11-17 13:38:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:38:20,467 INFO L225 Difference]: With dead ends: 3841 [2021-11-17 13:38:20,468 INFO L226 Difference]: Without dead ends: 3839 [2021-11-17 13:38:20,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-11-17 13:38:20,471 INFO L933 BasicCegarLoop]: 3475 mSDtfsCounter, 6413 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3417 mSolverCounterSat, 3544 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6681 SdHoareTripleChecker+Valid, 6192 SdHoareTripleChecker+Invalid, 6966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3417 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2021-11-17 13:38:20,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6681 Valid, 6192 Invalid, 6966 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3417 Invalid, 5 Unknown, 0 Unchecked, 32.7s Time] [2021-11-17 13:38:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2021-11-17 13:38:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3839. [2021-11-17 13:38:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 2580 states have (on average 1.277906976744186) internal successors, (3297), 2730 states have internal predecessors, (3297), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:38:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 5289 transitions. [2021-11-17 13:38:20,651 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 5289 transitions. Word has length 87 [2021-11-17 13:38:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:38:20,651 INFO L470 AbstractCegarLoop]: Abstraction has 3839 states and 5289 transitions. [2021-11-17 13:38:20,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 13:38:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 5289 transitions. [2021-11-17 13:38:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-17 13:38:20,654 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:38:20,654 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] [2021-11-17 13:38:20,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 13:38:20,654 INFO L402 AbstractCegarLoop]: === Iteration 11 === 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 24 more)] === [2021-11-17 13:38:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:38:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2120853129, now seen corresponding path program 1 times [2021-11-17 13:38:20,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:38:20,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114401958] [2021-11-17 13:38:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:38:20,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:38:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:20,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:38:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:20,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:38:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:38:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:38:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:38:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:38:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:38:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:38:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:38:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:38:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:38:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:38:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 13:38:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 13:38:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:38:21,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:38:21,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114401958] [2021-11-17 13:38:21,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114401958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:38:21,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:38:21,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:38:21,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558659973] [2021-11-17 13:38:21,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:38:21,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:38:21,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:38:21,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:38:21,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:38:21,183 INFO L87 Difference]: Start difference. First operand 3839 states and 5289 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 13:38:23,242 WARN L515 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-11-17 13:38:25,369 WARN L515 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-11-17 13:38:45,393 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:49,483 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:52,516 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:38:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:38:55,309 INFO L93 Difference]: Finished difference Result 3839 states and 5289 transitions. [2021-11-17 13:38:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:38:55,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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 93 [2021-11-17 13:38:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:38:55,324 INFO L225 Difference]: With dead ends: 3839 [2021-11-17 13:38:55,324 INFO L226 Difference]: Without dead ends: 3837 [2021-11-17 13:38:55,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:38:55,328 INFO L933 BasicCegarLoop]: 3473 mSDtfsCounter, 6411 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3411 mSolverCounterSat, 3544 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6678 SdHoareTripleChecker+Valid, 6190 SdHoareTripleChecker+Invalid, 6960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3411 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:38:55,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6678 Valid, 6190 Invalid, 6960 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3411 Invalid, 5 Unknown, 0 Unchecked, 33.4s Time] [2021-11-17 13:38:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2021-11-17 13:38:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3837. [2021-11-17 13:38:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 2579 states have (on average 1.2776269872043429) internal successors, (3295), 2728 states have internal predecessors, (3295), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:38:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5287 transitions. [2021-11-17 13:38:55,510 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5287 transitions. Word has length 93 [2021-11-17 13:38:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:38:55,511 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 5287 transitions. [2021-11-17 13:38:55,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 13:38:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5287 transitions. [2021-11-17 13:38:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-17 13:38:55,513 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:38:55,513 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] [2021-11-17 13:38:55,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 13:38:55,514 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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 24 more)] === [2021-11-17 13:38:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:38:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1969777274, now seen corresponding path program 1 times [2021-11-17 13:38:55,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:38:55,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734202199] [2021-11-17 13:38:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:38:55,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:38:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:38:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:38:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:38:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:38:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:38:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:38:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:38:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:38:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:38:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:38:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:38:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:38:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 13:38:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 13:38:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:38:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:38:56,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:38:56,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734202199] [2021-11-17 13:38:56,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734202199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:38:56,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:38:56,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:38:56,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534340132] [2021-11-17 13:38:56,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:38:56,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:38:56,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:38:56,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:38:56,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:38:56,164 INFO L87 Difference]: Start difference. First operand 3837 states and 5287 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 13:38:58,223 WARN L515 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-11-17 13:39:00,358 WARN L515 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-11-17 13:39:20,396 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:24,478 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:27,340 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:29,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:39:29,873 INFO L93 Difference]: Finished difference Result 3837 states and 5287 transitions. [2021-11-17 13:39:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:39:29,874 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2021-11-17 13:39:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:39:29,892 INFO L225 Difference]: With dead ends: 3837 [2021-11-17 13:39:29,893 INFO L226 Difference]: Without dead ends: 3835 [2021-11-17 13:39:29,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:39:29,898 INFO L933 BasicCegarLoop]: 3471 mSDtfsCounter, 6399 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3413 mSolverCounterSat, 3544 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6666 SdHoareTripleChecker+Valid, 6188 SdHoareTripleChecker+Invalid, 6962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3413 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:39:29,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6666 Valid, 6188 Invalid, 6962 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3413 Invalid, 5 Unknown, 0 Unchecked, 33.0s Time] [2021-11-17 13:39:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2021-11-17 13:39:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3835. [2021-11-17 13:39:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3835 states, 2578 states have (on average 1.2773467804499612) internal successors, (3293), 2726 states have internal predecessors, (3293), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2021-11-17 13:39:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5285 transitions. [2021-11-17 13:39:30,063 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5285 transitions. Word has length 95 [2021-11-17 13:39:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:39:30,063 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 5285 transitions. [2021-11-17 13:39:30,064 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 13:39:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5285 transitions. [2021-11-17 13:39:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-17 13:39:30,065 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:39:30,065 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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] [2021-11-17 13:39:30,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-17 13:39:30,066 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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 24 more)] === [2021-11-17 13:39:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:39:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1348437627, now seen corresponding path program 1 times [2021-11-17 13:39:30,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:39:30,067 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846422740] [2021-11-17 13:39:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:39:30,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:39:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:39:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 13:39:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:39:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 13:39:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:39:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:39:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-17 13:39:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:39:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:39:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:39:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:39:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-17 13:39:30,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:39:30,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846422740] [2021-11-17 13:39:30,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846422740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:39:30,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:39:30,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:39:30,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426785158] [2021-11-17 13:39:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:39:30,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:39:30,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:39:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:39:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:39:30,836 INFO L87 Difference]: Start difference. First operand 3835 states and 5285 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 13:39:32,435 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:34,641 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:41,930 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:43,293 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:39:48,229 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:05,215 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:08,439 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:13,281 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:14,473 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:16,601 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:40:32,681 INFO L93 Difference]: Finished difference Result 8663 states and 12582 transitions. [2021-11-17 13:40:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 13:40:32,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2021-11-17 13:40:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:40:32,734 INFO L225 Difference]: With dead ends: 8663 [2021-11-17 13:40:32,734 INFO L226 Difference]: Without dead ends: 8661 [2021-11-17 13:40:32,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-11-17 13:40:32,744 INFO L933 BasicCegarLoop]: 4468 mSDtfsCounter, 5580 mSDsluCounter, 13865 mSDsCounter, 0 mSdLazyCounter, 6724 mSolverCounterSat, 2361 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6222 SdHoareTripleChecker+Valid, 18333 SdHoareTripleChecker+Invalid, 9089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2361 IncrementalHoareTripleChecker+Valid, 6724 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.4s IncrementalHoareTripleChecker+Time [2021-11-17 13:40:32,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6222 Valid, 18333 Invalid, 9089 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2361 Valid, 6724 Invalid, 4 Unknown, 0 Unchecked, 60.4s Time] [2021-11-17 13:40:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8661 states. [2021-11-17 13:40:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8661 to 7246. [2021-11-17 13:40:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7246 states, 4881 states have (on average 1.2802704363859865) internal successors, (6249), 5155 states have internal predecessors, (6249), 1874 states have call successors, (1874), 480 states have call predecessors, (1874), 475 states have return successors, (1892), 1770 states have call predecessors, (1892), 1872 states have call successors, (1892) [2021-11-17 13:40:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7246 states to 7246 states and 10015 transitions. [2021-11-17 13:40:33,197 INFO L78 Accepts]: Start accepts. Automaton has 7246 states and 10015 transitions. Word has length 99 [2021-11-17 13:40:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:40:33,198 INFO L470 AbstractCegarLoop]: Abstraction has 7246 states and 10015 transitions. [2021-11-17 13:40:33,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-17 13:40:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 7246 states and 10015 transitions. [2021-11-17 13:40:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-17 13:40:33,203 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:40:33,203 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] [2021-11-17 13:40:33,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-17 13:40:33,203 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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 24 more)] === [2021-11-17 13:40:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:40:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash -364293682, now seen corresponding path program 1 times [2021-11-17 13:40:33,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:40:33,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220112688] [2021-11-17 13:40:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:40:33,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:40:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:40:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:40:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:40:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:40:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:40:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:40:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:40:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:40:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:40:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:40:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:40:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:40:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 13:40:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 13:40:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 13:40:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:40:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:40:33,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:40:33,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220112688] [2021-11-17 13:40:33,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220112688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:40:33,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:40:33,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:40:33,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034364352] [2021-11-17 13:40:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:40:33,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:40:33,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:40:33,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:40:33,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:40:33,699 INFO L87 Difference]: Start difference. First operand 7246 states and 10015 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 13:40:35,757 WARN L515 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-11-17 13:40:37,922 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:40:58,048 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:04,392 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:41:06,919 INFO L93 Difference]: Finished difference Result 7246 states and 10015 transitions. [2021-11-17 13:41:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:41:06,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2021-11-17 13:41:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:41:06,951 INFO L225 Difference]: With dead ends: 7246 [2021-11-17 13:41:06,951 INFO L226 Difference]: Without dead ends: 7244 [2021-11-17 13:41:06,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:41:06,958 INFO L933 BasicCegarLoop]: 3469 mSDtfsCounter, 6395 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3412 mSolverCounterSat, 3544 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6661 SdHoareTripleChecker+Valid, 6186 SdHoareTripleChecker+Invalid, 6960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3412 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:41:06,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6661 Valid, 6186 Invalid, 6960 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3412 Invalid, 4 Unknown, 0 Unchecked, 32.3s Time] [2021-11-17 13:41:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states. [2021-11-17 13:41:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 7244. [2021-11-17 13:41:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7244 states, 4880 states have (on average 1.2799180327868853) internal successors, (6246), 5153 states have internal predecessors, (6246), 1874 states have call successors, (1874), 480 states have call predecessors, (1874), 475 states have return successors, (1892), 1770 states have call predecessors, (1892), 1872 states have call successors, (1892) [2021-11-17 13:41:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7244 states to 7244 states and 10012 transitions. [2021-11-17 13:41:07,378 INFO L78 Accepts]: Start accepts. Automaton has 7244 states and 10012 transitions. Word has length 101 [2021-11-17 13:41:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:41:07,379 INFO L470 AbstractCegarLoop]: Abstraction has 7244 states and 10012 transitions. [2021-11-17 13:41:07,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 13:41:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7244 states and 10012 transitions. [2021-11-17 13:41:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-17 13:41:07,382 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:41:07,382 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] [2021-11-17 13:41:07,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-17 13:41:07,383 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 24 more)] === [2021-11-17 13:41:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:41:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash -883515864, now seen corresponding path program 1 times [2021-11-17 13:41:07,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:41:07,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275500575] [2021-11-17 13:41:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:41:07,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:41:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:41:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:41:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:41:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:41:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:41:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:41:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:41:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:41:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:41:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:41:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:41:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 13:41:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 13:41:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 13:41:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:41:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:41:07,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:41:07,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275500575] [2021-11-17 13:41:07,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275500575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:41:07,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:41:07,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:41:07,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137864167] [2021-11-17 13:41:07,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:41:07,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:41:07,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:41:07,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:41:07,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:41:07,911 INFO L87 Difference]: Start difference. First operand 7244 states and 10012 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:41:09,973 WARN L515 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-11-17 13:41:12,142 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:16,701 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:33,771 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:37,979 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:40,804 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:41:43,615 INFO L93 Difference]: Finished difference Result 7244 states and 10012 transitions. [2021-11-17 13:41:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:41:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2021-11-17 13:41:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:41:43,649 INFO L225 Difference]: With dead ends: 7244 [2021-11-17 13:41:43,650 INFO L226 Difference]: Without dead ends: 7242 [2021-11-17 13:41:43,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:41:43,657 INFO L933 BasicCegarLoop]: 3467 mSDtfsCounter, 6389 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 3544 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6654 SdHoareTripleChecker+Valid, 6184 SdHoareTripleChecker+Invalid, 6958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2021-11-17 13:41:43,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6654 Valid, 6184 Invalid, 6958 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3409 Invalid, 5 Unknown, 0 Unchecked, 34.8s Time] [2021-11-17 13:41:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2021-11-17 13:41:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 7242. [2021-11-17 13:41:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 4879 states have (on average 1.2795654847304776) internal successors, (6243), 5151 states have internal predecessors, (6243), 1874 states have call successors, (1874), 480 states have call predecessors, (1874), 475 states have return successors, (1892), 1770 states have call predecessors, (1892), 1872 states have call successors, (1892) [2021-11-17 13:41:44,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 10009 transitions. [2021-11-17 13:41:44,057 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 10009 transitions. Word has length 107 [2021-11-17 13:41:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:41:44,059 INFO L470 AbstractCegarLoop]: Abstraction has 7242 states and 10009 transitions. [2021-11-17 13:41:44,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-17 13:41:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 10009 transitions. [2021-11-17 13:41:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-17 13:41:44,062 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:41:44,062 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] [2021-11-17 13:41:44,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-17 13:41:44,062 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 24 more)] === [2021-11-17 13:41:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:41:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 36454316, now seen corresponding path program 1 times [2021-11-17 13:41:44,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:41:44,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737149371] [2021-11-17 13:41:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:41:44,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:41:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:41:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:41:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 13:41:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-17 13:41:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:41:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-17 13:41:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-17 13:41:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-17 13:41:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-17 13:41:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-17 13:41:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-17 13:41:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-17 13:41:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-17 13:41:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-17 13:41:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-17 13:41:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-17 13:41:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-11-17 13:41:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:41:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:41:44,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:41:44,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737149371] [2021-11-17 13:41:44,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737149371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:41:44,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:41:44,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:41:44,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737351932] [2021-11-17 13:41:44,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:41:44,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:41:44,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:41:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:41:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:41:44,559 INFO L87 Difference]: Start difference. First operand 7242 states and 10009 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 13:41:46,612 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:41:48,799 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:10,701 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:13,997 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:15,497 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:17,629 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:42:20,356 INFO L93 Difference]: Finished difference Result 7242 states and 10009 transitions. [2021-11-17 13:42:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 13:42:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2021-11-17 13:42:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:42:20,391 INFO L225 Difference]: With dead ends: 7242 [2021-11-17 13:42:20,392 INFO L226 Difference]: Without dead ends: 7240 [2021-11-17 13:42:20,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-17 13:42:20,400 INFO L933 BasicCegarLoop]: 3465 mSDtfsCounter, 6383 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 3544 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6647 SdHoareTripleChecker+Valid, 6182 SdHoareTripleChecker+Invalid, 6956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2021-11-17 13:42:20,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6647 Valid, 6182 Invalid, 6956 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3408 Invalid, 4 Unknown, 0 Unchecked, 34.8s Time] [2021-11-17 13:42:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7240 states. [2021-11-17 13:42:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7240 to 7240. [2021-11-17 13:42:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7240 states, 4878 states have (on average 1.2792127921279213) internal successors, (6240), 5149 states have internal predecessors, (6240), 1874 states have call successors, (1874), 480 states have call predecessors, (1874), 475 states have return successors, (1892), 1770 states have call predecessors, (1892), 1872 states have call successors, (1892) [2021-11-17 13:42:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7240 states to 7240 states and 10006 transitions. [2021-11-17 13:42:20,815 INFO L78 Accepts]: Start accepts. Automaton has 7240 states and 10006 transitions. Word has length 113 [2021-11-17 13:42:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:42:20,815 INFO L470 AbstractCegarLoop]: Abstraction has 7240 states and 10006 transitions. [2021-11-17 13:42:20,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-17 13:42:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7240 states and 10006 transitions. [2021-11-17 13:42:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-17 13:42:20,818 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:42:20,818 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:42:20,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-17 13:42:20,819 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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 24 more)] === [2021-11-17 13:42:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:42:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash -141668438, now seen corresponding path program 1 times [2021-11-17 13:42:20,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:42:20,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631430909] [2021-11-17 13:42:20,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:42:20,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:42:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:42:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 13:42:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:42:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 13:42:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-17 13:42:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 13:42:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-11-17 13:42:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:42:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:42:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:42:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:42:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:42:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-17 13:42:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-11-17 13:42:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-17 13:42:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-11-17 13:42:21,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:42:21,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631430909] [2021-11-17 13:42:21,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631430909] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:42:21,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:42:21,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:42:21,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168136377] [2021-11-17 13:42:21,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:42:21,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:42:21,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:42:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:42:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:42:21,407 INFO L87 Difference]: Start difference. First operand 7240 states and 10006 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-17 13:42:23,462 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:25,653 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:42:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:42:53,375 INFO L93 Difference]: Finished difference Result 15793 states and 22473 transitions. [2021-11-17 13:42:53,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 13:42:53,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 134 [2021-11-17 13:42:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:42:53,426 INFO L225 Difference]: With dead ends: 15793 [2021-11-17 13:42:53,426 INFO L226 Difference]: Without dead ends: 8710 [2021-11-17 13:42:53,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-17 13:42:53,472 INFO L933 BasicCegarLoop]: 3816 mSDtfsCounter, 5587 mSDsluCounter, 3590 mSDsCounter, 0 mSdLazyCounter, 3772 mSolverCounterSat, 2629 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6112 SdHoareTripleChecker+Valid, 7406 SdHoareTripleChecker+Invalid, 6403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2629 IncrementalHoareTripleChecker+Valid, 3772 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.0s IncrementalHoareTripleChecker+Time [2021-11-17 13:42:53,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6112 Valid, 7406 Invalid, 6403 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2629 Valid, 3772 Invalid, 2 Unknown, 0 Unchecked, 31.0s Time] [2021-11-17 13:42:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2021-11-17 13:42:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7241. [2021-11-17 13:42:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7241 states, 4879 states have (on average 1.2789506046320966) internal successors, (6240), 5150 states have internal predecessors, (6240), 1874 states have call successors, (1874), 480 states have call predecessors, (1874), 475 states have return successors, (1892), 1770 states have call predecessors, (1892), 1872 states have call successors, (1892) [2021-11-17 13:42:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 10006 transitions. [2021-11-17 13:42:53,950 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 10006 transitions. Word has length 134 [2021-11-17 13:42:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:42:53,951 INFO L470 AbstractCegarLoop]: Abstraction has 7241 states and 10006 transitions. [2021-11-17 13:42:53,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-17 13:42:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 10006 transitions. [2021-11-17 13:42:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-17 13:42:53,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:42:53,954 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] [2021-11-17 13:42:53,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-17 13:42:53,954 INFO L402 AbstractCegarLoop]: === Iteration 18 === 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 24 more)] === [2021-11-17 13:42:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:42:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1356853694, now seen corresponding path program 1 times [2021-11-17 13:42:53,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:42:53,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143533885] [2021-11-17 13:42:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:42:53,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:42:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:42:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 13:42:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 13:42:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 13:42:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:42:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:42:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 13:42:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-17 13:42:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:42:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:42:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:42:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:42:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:42:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:42:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:42:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:42:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 13:42:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 13:42:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:42:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:42:54,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:42:54,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143533885] [2021-11-17 13:42:54,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143533885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:42:54,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:42:54,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:42:54,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382069954] [2021-11-17 13:42:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:42:54,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:42:54,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:42:54,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:42:54,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:42:54,454 INFO L87 Difference]: Start difference. First operand 7241 states and 10006 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 13:42:56,513 WARN L515 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-11-17 13:42:58,698 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:03,107 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:26,886 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:29,658 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:31,705 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:33,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:36,045 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:38,352 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:51,042 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:43:53,107 WARN L515 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-11-17 13:44:01,374 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:44:03,227 INFO L93 Difference]: Finished difference Result 12076 states and 16566 transitions. [2021-11-17 13:44:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 13:44:03,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2021-11-17 13:44:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:44:03,377 INFO L225 Difference]: With dead ends: 12076 [2021-11-17 13:44:03,377 INFO L226 Difference]: Without dead ends: 12074 [2021-11-17 13:44:03,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-17 13:44:03,382 INFO L933 BasicCegarLoop]: 3633 mSDtfsCounter, 8770 mSDsluCounter, 3641 mSDsCounter, 0 mSdLazyCounter, 6210 mSolverCounterSat, 5003 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9027 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 11222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5003 IncrementalHoareTripleChecker+Valid, 6210 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.2s IncrementalHoareTripleChecker+Time [2021-11-17 13:44:03,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9027 Valid, 7274 Invalid, 11222 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5003 Valid, 6210 Invalid, 9 Unknown, 0 Unchecked, 67.2s Time] [2021-11-17 13:44:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12074 states. [2021-11-17 13:44:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12074 to 11869. [2021-11-17 13:44:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11869 states, 7999 states have (on average 1.2821602700337542) internal successors, (10256), 8451 states have internal predecessors, (10256), 3029 states have call successors, (3029), 837 states have call predecessors, (3029), 828 states have return successors, (3061), 2854 states have call predecessors, (3061), 3027 states have call successors, (3061) [2021-11-17 13:44:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 16346 transitions. [2021-11-17 13:44:04,063 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 16346 transitions. Word has length 121 [2021-11-17 13:44:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:44:04,064 INFO L470 AbstractCegarLoop]: Abstraction has 11869 states and 16346 transitions. [2021-11-17 13:44:04,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 13:44:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 16346 transitions. [2021-11-17 13:44:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-17 13:44:04,066 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:44:04,067 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 13:44:04,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-17 13:44:04,067 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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 24 more)] === [2021-11-17 13:44:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:44:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash 145130022, now seen corresponding path program 1 times [2021-11-17 13:44:04,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:44:04,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434583506] [2021-11-17 13:44:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:44:04,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:44:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:44:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 13:44:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:44:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 13:44:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:44:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-17 13:44:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-17 13:44:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-17 13:44:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:44:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:44:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-17 13:44:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:44:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:44:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:44:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:44:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-17 13:44:04,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:44:04,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434583506] [2021-11-17 13:44:04,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434583506] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:44:04,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:44:04,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 13:44:04,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198735552] [2021-11-17 13:44:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:44:04,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 13:44:04,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:44:04,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 13:44:04,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-17 13:44:04,656 INFO L87 Difference]: Start difference. First operand 11869 states and 16346 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-17 13:44:06,713 WARN L515 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-11-17 13:44:08,916 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:15,148 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:54,130 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:55,167 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:57,204 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:44:59,064 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:00,355 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:02,679 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:05,011 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:07,079 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:45:19,693 INFO L93 Difference]: Finished difference Result 27689 states and 39708 transitions. [2021-11-17 13:45:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 13:45:19,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2021-11-17 13:45:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:45:19,784 INFO L225 Difference]: With dead ends: 27689 [2021-11-17 13:45:19,784 INFO L226 Difference]: Without dead ends: 16104 [2021-11-17 13:45:19,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:45:19,850 INFO L933 BasicCegarLoop]: 4220 mSDtfsCounter, 4371 mSDsluCounter, 7302 mSDsCounter, 0 mSdLazyCounter, 7762 mSolverCounterSat, 3408 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 11522 SdHoareTripleChecker+Invalid, 11177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3408 IncrementalHoareTripleChecker+Valid, 7762 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 73.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:45:19,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5058 Valid, 11522 Invalid, 11177 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3408 Valid, 7762 Invalid, 7 Unknown, 0 Unchecked, 73.3s Time] [2021-11-17 13:45:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2021-11-17 13:45:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 12203. [2021-11-17 13:45:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12203 states, 8230 states have (on average 1.2818955042527338) internal successors, (10550), 8699 states have internal predecessors, (10550), 3116 states have call successors, (3116), 837 states have call predecessors, (3116), 844 states have return successors, (3178), 2944 states have call predecessors, (3178), 3114 states have call successors, (3178) [2021-11-17 13:45:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 16844 transitions. [2021-11-17 13:45:20,869 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 16844 transitions. Word has length 131 [2021-11-17 13:45:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:45:20,869 INFO L470 AbstractCegarLoop]: Abstraction has 12203 states and 16844 transitions. [2021-11-17 13:45:20,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2021-11-17 13:45:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 16844 transitions. [2021-11-17 13:45:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-17 13:45:20,875 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:45:20,875 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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] [2021-11-17 13:45:20,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-17 13:45:20,875 INFO L402 AbstractCegarLoop]: === Iteration 20 === 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 24 more)] === [2021-11-17 13:45:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:45:20,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1405441805, now seen corresponding path program 1 times [2021-11-17 13:45:20,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:45:20,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418216873] [2021-11-17 13:45:20,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:45:20,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:45:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:45:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-17 13:45:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-11-17 13:45:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 13:45:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-17 13:45:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-17 13:45:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-17 13:45:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:45:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:45:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-17 13:45:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:45:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-17 13:45:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-17 13:45:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:45:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-17 13:45:21,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:45:21,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418216873] [2021-11-17 13:45:21,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418216873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:45:21,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:45:21,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:45:21,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983432181] [2021-11-17 13:45:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:45:21,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:45:21,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:45:21,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:45:21,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:45:21,406 INFO L87 Difference]: Start difference. First operand 12203 states and 16844 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-17 13:45:23,466 WARN L515 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-11-17 13:45:25,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:45:31,335 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:00,014 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:02,067 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:03,776 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:05,992 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:08,310 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 13:46:17,198 INFO L93 Difference]: Finished difference Result 26832 states and 38183 transitions. [2021-11-17 13:46:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 13:46:17,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2021-11-17 13:46:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 13:46:17,265 INFO L225 Difference]: With dead ends: 26832 [2021-11-17 13:46:17,265 INFO L226 Difference]: Without dead ends: 14689 [2021-11-17 13:46:17,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-17 13:46:17,318 INFO L933 BasicCegarLoop]: 3459 mSDtfsCounter, 3991 mSDsluCounter, 3810 mSDsCounter, 0 mSdLazyCounter, 4974 mSolverCounterSat, 3310 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4426 SdHoareTripleChecker+Valid, 7269 SdHoareTripleChecker+Invalid, 8289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3310 IncrementalHoareTripleChecker+Valid, 4974 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.3s IncrementalHoareTripleChecker+Time [2021-11-17 13:46:17,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4426 Valid, 7269 Invalid, 8289 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3310 Valid, 4974 Invalid, 5 Unknown, 0 Unchecked, 54.3s Time] [2021-11-17 13:46:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14689 states. [2021-11-17 13:46:18,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14689 to 12204. [2021-11-17 13:46:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12204 states, 8231 states have (on average 1.2818612562264609) internal successors, (10551), 8700 states have internal predecessors, (10551), 3116 states have call successors, (3116), 837 states have call predecessors, (3116), 844 states have return successors, (3178), 2944 states have call predecessors, (3178), 3114 states have call successors, (3178) [2021-11-17 13:46:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12204 states to 12204 states and 16845 transitions. [2021-11-17 13:46:18,136 INFO L78 Accepts]: Start accepts. Automaton has 12204 states and 16845 transitions. Word has length 123 [2021-11-17 13:46:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 13:46:18,136 INFO L470 AbstractCegarLoop]: Abstraction has 12204 states and 16845 transitions. [2021-11-17 13:46:18,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-17 13:46:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 12204 states and 16845 transitions. [2021-11-17 13:46:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-17 13:46:18,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 13:46:18,140 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] [2021-11-17 13:46:18,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-17 13:46:18,140 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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 24 more)] === [2021-11-17 13:46:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 13:46:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 721909771, now seen corresponding path program 1 times [2021-11-17 13:46:18,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 13:46:18,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058238415] [2021-11-17 13:46:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 13:46:18,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 13:46:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 13:46:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-17 13:46:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-17 13:46:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-17 13:46:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 13:46:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-17 13:46:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-17 13:46:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-17 13:46:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-11-17 13:46:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-11-17 13:46:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 13:46:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 13:46:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-17 13:46:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-17 13:46:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-17 13:46:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-11-17 13:46:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-17 13:46:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-17 13:46:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-17 13:46:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 13:46:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-17 13:46:18,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 13:46:18,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058238415] [2021-11-17 13:46:18,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058238415] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 13:46:18,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 13:46:18,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 13:46:18,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3865479] [2021-11-17 13:46:18,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 13:46:18,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 13:46:18,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 13:46:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 13:46:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-17 13:46:18,689 INFO L87 Difference]: Start difference. First operand 12204 states and 16845 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-11-17 13:46:20,748 WARN L515 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-11-17 13:46:22,958 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:46,814 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:49,762 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 13:46:52,751 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15