./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---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.2-tmp.no-commuhash-c3fed41 [2021-12-18 16:30:43,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 16:30:43,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 16:30:43,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 16:30:43,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 16:30:43,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 16:30:43,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 16:30:43,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 16:30:43,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 16:30:43,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 16:30:43,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 16:30:43,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 16:30:43,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 16:30:43,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 16:30:43,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 16:30:43,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 16:30:43,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 16:30:43,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 16:30:43,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 16:30:43,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 16:30:43,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 16:30:43,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 16:30:43,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 16:30:43,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 16:30:43,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 16:30:43,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 16:30:43,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 16:30:43,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 16:30:43,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 16:30:43,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 16:30:43,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 16:30:43,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 16:30:43,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 16:30:43,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 16:30:43,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 16:30:43,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 16:30:43,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 16:30:43,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 16:30:43,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 16:30:43,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 16:30:43,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 16:30:43,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 16:30:43,150 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 16:30:43,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 16:30:43,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 16:30:43,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 16:30:43,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 16:30:43,151 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 16:30:43,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 16:30:43,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 16:30:43,152 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 16:30:43,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 16:30:43,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 16:30:43,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 16:30:43,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 16:30:43,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 16:30:43,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 16:30:43,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 16:30:43,153 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 16:30:43,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 16:30:43,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 16:30:43,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 16:30:43,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 16:30:43,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 16:30:43,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 16:30:43,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 16:30:43,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 16:30:43,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 16:30:43,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 16:30:43,156 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 16:30:43,156 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 16:30:43,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 16:30:43,157 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 16:30:43,157 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-12-18 16:30:43,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 16:30:43,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 16:30:43,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 16:30:43,388 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 16:30:43,388 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 16:30:43,389 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-12-18 16:30:43,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733423fd0/bcfcc1e6d7f340ccb4c09ebe9bf52464/FLAGcafa5fc2e [2021-12-18 16:30:44,198 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 16:30:44,199 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-12-18 16:30:44,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733423fd0/bcfcc1e6d7f340ccb4c09ebe9bf52464/FLAGcafa5fc2e [2021-12-18 16:30:44,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733423fd0/bcfcc1e6d7f340ccb4c09ebe9bf52464 [2021-12-18 16:30:44,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 16:30:44,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 16:30:44,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 16:30:44,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 16:30:44,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 16:30:44,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:30:44" (1/1) ... [2021-12-18 16:30:44,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b99625b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:44, skipping insertion in model container [2021-12-18 16:30:44,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:30:44" (1/1) ... [2021-12-18 16:30:44,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 16:30:44,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 16:30:51,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 16:30:51,292 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 16:30:51,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2021-12-18 16:30:51,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2021-12-18 16:30:51,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2021-12-18 16:30:51,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2021-12-18 16:30:51,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2021-12-18 16:30:51,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2021-12-18 16:30:51,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2021-12-18 16:30:51,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2021-12-18 16:30:51,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2021-12-18 16:30:51,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2021-12-18 16:30:51,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2021-12-18 16:30:51,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2021-12-18 16:30:51,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2021-12-18 16:30:51,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2021-12-18 16:30:51,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2021-12-18 16:30:51,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2021-12-18 16:30:51,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2021-12-18 16:30:51,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2021-12-18 16:30:51,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2021-12-18 16:30:51,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2021-12-18 16:30:51,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2021-12-18 16:30:51,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2021-12-18 16:30:51,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2021-12-18 16:30:51,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2021-12-18 16:30:51,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2021-12-18 16:30:51,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688935,688948] [2021-12-18 16:30:51,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689081,689094] [2021-12-18 16:30:51,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689224,689237] [2021-12-18 16:30:51,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689368,689381] [2021-12-18 16:30:51,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689511,689524] [2021-12-18 16:30:51,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689655,689668] [2021-12-18 16:30:51,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689796,689809] [2021-12-18 16:30:51,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689934,689947] [2021-12-18 16:30:51,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690407,690420] [2021-12-18 16:30:51,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2021-12-18 16:30:51,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2021-12-18 16:30:51,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2021-12-18 16:30:51,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-12-18 16:30:51,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2021-12-18 16:30:51,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691762,691775] [2021-12-18 16:30:51,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691909,691922] [2021-12-18 16:30:51,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692060,692073] [2021-12-18 16:30:51,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692211,692224] [2021-12-18 16:30:51,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692359,692372] [2021-12-18 16:30:51,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692525,692538] [2021-12-18 16:30:51,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692694,692707] [2021-12-18 16:30:51,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692861,692874] [2021-12-18 16:30:51,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693029,693042] [2021-12-18 16:30:51,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693179,693192] [2021-12-18 16:30:51,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693326,693339] [2021-12-18 16:30:51,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693487,693500] [2021-12-18 16:30:51,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693657,693670] [2021-12-18 16:30:51,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693819,693832] [2021-12-18 16:30:51,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 16:30:52,243 INFO L208 MainTranslator]: Completed translation [2021-12-18 16:30:52,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52 WrapperNode [2021-12-18 16:30:52,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 16:30:52,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 16:30:52,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 16:30:52,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 16:30:52,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,572 INFO L137 Inliner]: procedures = 963, calls = 5049, calls flagged for inlining = 494, calls inlined = 305, statements flattened = 9468 [2021-12-18 16:30:52,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 16:30:52,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 16:30:52,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 16:30:52,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 16:30:52,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 16:30:52,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 16:30:52,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 16:30:52,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 16:30:52,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (1/1) ... [2021-12-18 16:30:52,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 16:30:52,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 16:30:52,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 16:30:52,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 16:30:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_timer [2021-12-18 16:30:52,852 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_timer [2021-12-18 16:30:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2021-12-18 16:30:52,852 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2021-12-18 16:30:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure seq_puts [2021-12-18 16:30:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_puts [2021-12-18 16:30:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2021-12-18 16:30:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2021-12-18 16:30:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_heartbeat [2021-12-18 16:30:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_heartbeat [2021-12-18 16:30:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure sock_init_data [2021-12-18 16:30:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_init_data [2021-12-18 16:30:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2021-12-18 16:30:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2021-12-18 16:30:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_135 [2021-12-18 16:30:52,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_135 [2021-12-18 16:30:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure proto_unregister [2021-12-18 16:30:52,854 INFO L138 BoogieDeclarations]: Found implementation of procedure proto_unregister [2021-12-18 16:30:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-18 16:30:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-18 16:30:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-18 16:30:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-18 16:30:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure rose_add_loopback_node [2021-12-18 16:30:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_add_loopback_node [2021-12-18 16:30:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure skb_peek [2021-12-18 16:30:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_peek [2021-12-18 16:30:52,855 INFO L130 BoogieDeclarations]: Found specification of procedure sock_set_flag [2021-12-18 16:30:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_set_flag [2021-12-18 16:30:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-18 16:30:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer [2021-12-18 16:30:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer [2021-12-18 16:30:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure rose_send_frame [2021-12-18 16:30:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_send_frame [2021-12-18 16:30:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure rose_destroy_socket [2021-12-18 16:30:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_destroy_socket [2021-12-18 16:30:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure rose_write_internal [2021-12-18 16:30:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_write_internal [2021-12-18 16:30:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add [2021-12-18 16:30:52,857 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add [2021-12-18 16:30:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure rose_del_loopback_node [2021-12-18 16:30:52,857 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_del_loopback_node [2021-12-18 16:30:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-18 16:30:52,857 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-18 16:30:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-18 16:30:52,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-18 16:30:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure rose_requeue_frames [2021-12-18 16:30:52,857 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_requeue_frames [2021-12-18 16:30:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure rose_rx_call_request [2021-12-18 16:30:52,858 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_rx_call_request [2021-12-18 16:30:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-12-18 16:30:52,858 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-12-18 16:30:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure rose_dev_get [2021-12-18 16:30:52,858 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_dev_get [2021-12-18 16:30:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure sock_wfree [2021-12-18 16:30:52,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-18 16:30:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-18 16:30:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure rose_new_lci [2021-12-18 16:30:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_new_lci [2021-12-18 16:30:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure seq_open [2021-12-18 16:30:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_open [2021-12-18 16:30:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-18 16:30:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-18 16:30:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 16:30:52,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-18 16:30:52,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-18 16:30:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure rose_neigh_open [2021-12-18 16:30:52,860 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_neigh_open [2021-12-18 16:30:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-12-18 16:30:52,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-12-18 16:30:52,860 INFO L130 BoogieDeclarations]: Found specification of procedure rose_validate_nr [2021-12-18 16:30:52,860 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_validate_nr [2021-12-18 16:30:52,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-18 16:30:52,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-18 16:30:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock [2021-12-18 16:30:52,863 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock [2021-12-18 16:30:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure sock_flag [2021-12-18 16:30:52,863 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_flag [2021-12-18 16:30:52,863 INFO L130 BoogieDeclarations]: Found specification of procedure timer_pending [2021-12-18 16:30:52,863 INFO L138 BoogieDeclarations]: Found implementation of procedure timer_pending [2021-12-18 16:30:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 16:30:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 16:30:52,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-18 16:30:52,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-18 16:30:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 16:30:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure ax2asc [2021-12-18 16:30:52,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ax2asc [2021-12-18 16:30:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-12-18 16:30:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t0timer [2021-12-18 16:30:52,865 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t0timer [2021-12-18 16:30:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_restart_request [2021-12-18 16:30:52,865 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_restart_request [2021-12-18 16:30:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2021-12-18 16:30:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2021-12-18 16:30:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2021-12-18 16:30:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2021-12-18 16:30:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2021-12-18 16:30:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2021-12-18 16:30:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure rose_process_rx_frame [2021-12-18 16:30:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_process_rx_frame [2021-12-18 16:30:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 16:30:52,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 16:30:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 16:30:52,866 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2021-12-18 16:30:52,867 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2021-12-18 16:30:52,867 INFO L130 BoogieDeclarations]: Found specification of procedure sock_hold [2021-12-18 16:30:52,867 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_hold [2021-12-18 16:30:52,867 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2021-12-18 16:30:52,867 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_cb_put [2021-12-18 16:30:52,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_cb_put [2021-12-18 16:30:52,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-18 16:30:52,867 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-18 16:30:52,867 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head [2021-12-18 16:30:52,867 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head [2021-12-18 16:30:52,868 INFO L130 BoogieDeclarations]: Found specification of procedure rose_clear_queues [2021-12-18 16:30:52,868 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_clear_queues [2021-12-18 16:30:52,868 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2021-12-18 16:30:52,868 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2021-12-18 16:30:52,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-18 16:30:52,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-18 16:30:52,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-18 16:30:52,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-18 16:30:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure rose_insert_socket [2021-12-18 16:30:52,869 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_insert_socket [2021-12-18 16:30:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure rose_parse_facilities [2021-12-18 16:30:52,869 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_parse_facilities [2021-12-18 16:30:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 16:30:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-18 16:30:52,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-18 16:30:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 16:30:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2021-12-18 16:30:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2021-12-18 16:30:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_125 [2021-12-18 16:30:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_125 [2021-12-18 16:30:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_126 [2021-12-18 16:30:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_126 [2021-12-18 16:30:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2021-12-18 16:30:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2021-12-18 16:30:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-18 16:30:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-18 16:30:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_127___0 [2021-12-18 16:30:52,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_127___0 [2021-12-18 16:30:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_idletimer [2021-12-18 16:30:52,871 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_idletimer [2021-12-18 16:30:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2021-12-18 16:30:52,871 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2021-12-18 16:30:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_link [2021-12-18 16:30:52,871 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_link [2021-12-18 16:30:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-18 16:30:52,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-18 16:30:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-18 16:30:52,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-18 16:30:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure rose_find_socket [2021-12-18 16:30:52,872 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_find_socket [2021-12-18 16:30:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_node [2021-12-18 16:30:52,872 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_node [2021-12-18 16:30:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2021-12-18 16:30:52,872 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2021-12-18 16:30:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 16:30:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-18 16:30:52,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-18 16:30:52,872 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_display_timer [2021-12-18 16:30:52,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_display_timer [2021-12-18 16:30:52,873 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_route [2021-12-18 16:30:52,873 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_route [2021-12-18 16:30:52,873 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_listen_release [2021-12-18 16:30:52,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_listen_release [2021-12-18 16:30:52,873 INFO L130 BoogieDeclarations]: Found specification of procedure rosecmp [2021-12-18 16:30:52,873 INFO L138 BoogieDeclarations]: Found implementation of procedure rosecmp [2021-12-18 16:30:52,873 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_ftimer [2021-12-18 16:30:52,873 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_ftimer [2021-12-18 16:30:52,873 INFO L130 BoogieDeclarations]: Found specification of procedure rose_del_route_by_neigh [2021-12-18 16:30:52,873 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_del_route_by_neigh [2021-12-18 16:30:52,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-18 16:30:52,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-18 16:30:52,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-18 16:30:52,874 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-18 16:30:52,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_134 [2021-12-18 16:30:52,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_134 [2021-12-18 16:30:52,874 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2021-12-18 16:30:52,874 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2021-12-18 16:30:52,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 16:30:52,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 16:30:52,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-18 16:30:52,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-18 16:30:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-18 16:30:52,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-18 16:30:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure rose_setup [2021-12-18 16:30:52,875 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_setup [2021-12-18 16:30:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure sk_wmem_alloc_get [2021-12-18 16:30:52,875 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_wmem_alloc_get [2021-12-18 16:30:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure sk_alloc [2021-12-18 16:30:52,875 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_alloc [2021-12-18 16:30:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure ax25cmp [2021-12-18 16:30:52,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25cmp [2021-12-18 16:30:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-18 16:30:52,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-18 16:30:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure remove_proc_entry [2021-12-18 16:30:52,876 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_proc_entry [2021-12-18 16:30:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t3timer [2021-12-18 16:30:52,876 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t3timer [2021-12-18 16:30:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2021-12-18 16:30:52,876 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2021-12-18 16:30:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-18 16:30:52,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-18 16:30:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-18 16:30:52,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-18 16:30:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_neigh [2021-12-18 16:30:52,877 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_neigh [2021-12-18 16:30:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 16:30:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure rose_disconnect [2021-12-18 16:30:52,877 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_disconnect [2021-12-18 16:30:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-18 16:30:52,877 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-18 16:30:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure sock_put [2021-12-18 16:30:52,877 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_put [2021-12-18 16:30:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-18 16:30:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure sk_rmem_alloc_get [2021-12-18 16:30:52,878 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_rmem_alloc_get [2021-12-18 16:30:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2021-12-18 16:30:52,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2021-12-18 16:30:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-18 16:30:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-18 16:30:52,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-18 16:30:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-18 16:30:52,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-18 16:30:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_free_lci [2021-12-18 16:30:52,879 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_free_lci [2021-12-18 16:30:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 16:30:52,879 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 16:30:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-18 16:30:52,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-18 16:30:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure rose2asc [2021-12-18 16:30:52,879 INFO L138 BoogieDeclarations]: Found implementation of procedure rose2asc [2021-12-18 16:30:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure rose_get_neigh [2021-12-18 16:30:52,879 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_get_neigh [2021-12-18 16:30:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-18 16:30:52,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-18 16:30:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-18 16:30:52,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-18 16:30:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_purge [2021-12-18 16:30:52,880 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_purge [2021-12-18 16:30:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure proc_create [2021-12-18 16:30:52,880 INFO L138 BoogieDeclarations]: Found implementation of procedure proc_create [2021-12-18 16:30:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure rose_kick [2021-12-18 16:30:52,880 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_kick [2021-12-18 16:30:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_149 [2021-12-18 16:30:52,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_149 [2021-12-18 16:30:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t2timer [2021-12-18 16:30:52,881 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t2timer [2021-12-18 16:30:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_seq_open [2021-12-18 16:30:52,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_seq_open [2021-12-18 16:30:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-12-18 16:30:52,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-12-18 16:30:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure read_pnet [2021-12-18 16:30:52,881 INFO L138 BoogieDeclarations]: Found implementation of procedure read_pnet [2021-12-18 16:30:52,881 INFO L130 BoogieDeclarations]: Found specification of procedure rosecmpm [2021-12-18 16:30:52,881 INFO L138 BoogieDeclarations]: Found implementation of procedure rosecmpm [2021-12-18 16:30:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure rose_enquiry_response [2021-12-18 16:30:52,882 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_enquiry_response [2021-12-18 16:30:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2021-12-18 16:30:52,882 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2021-12-18 16:30:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-18 16:30:52,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-18 16:30:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_transport_header [2021-12-18 16:30:52,882 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_transport_header [2021-12-18 16:30:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-12-18 16:30:52,882 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-12-18 16:30:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure rose_kill_by_neigh [2021-12-18 16:30:52,883 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_kill_by_neigh [2021-12-18 16:30:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure skb_dequeue [2021-12-18 16:30:52,883 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_dequeue [2021-12-18 16:30:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_t0timer [2021-12-18 16:30:52,883 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_t0timer [2021-12-18 16:30:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 16:30:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-18 16:30:52,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-18 16:30:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-18 16:30:52,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-18 16:30:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2021-12-18 16:30:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2021-12-18 16:30:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-12-18 16:30:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-12-18 16:30:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure skb_orphan [2021-12-18 16:30:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_orphan [2021-12-18 16:30:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2021-12-18 16:30:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2021-12-18 16:30:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 16:30:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2021-12-18 16:30:52,884 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2021-12-18 16:30:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-18 16:30:52,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-18 16:30:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_150 [2021-12-18 16:30:52,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_150 [2021-12-18 16:30:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-18 16:30:52,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-18 16:30:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure skb_set_hash_from_sk [2021-12-18 16:30:52,885 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_set_hash_from_sk [2021-12-18 16:30:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_frame [2021-12-18 16:30:52,885 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_frame [2021-12-18 16:30:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2021-12-18 16:30:52,886 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2021-12-18 16:30:52,886 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_idletimer [2021-12-18 16:30:52,886 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_idletimer [2021-12-18 16:30:52,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-18 16:30:52,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-18 16:30:52,886 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-18 16:30:52,886 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-18 16:30:52,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_127 [2021-12-18 16:30:52,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_127 [2021-12-18 16:30:52,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_128 [2021-12-18 16:30:52,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_128 [2021-12-18 16:30:52,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-18 16:30:52,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-18 16:30:52,887 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_open [2021-12-18 16:30:52,887 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_open [2021-12-18 16:30:52,887 INFO L130 BoogieDeclarations]: Found specification of procedure rose_nodes_open [2021-12-18 16:30:52,887 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_nodes_open [2021-12-18 16:30:52,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-18 16:30:52,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-18 16:30:52,887 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_clear_request [2021-12-18 16:30:52,887 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_clear_request [2021-12-18 16:30:52,888 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_cb_put___0 [2021-12-18 16:30:52,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_cb_put___0 [2021-12-18 16:30:52,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_126___0 [2021-12-18 16:30:52,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_126___0 [2021-12-18 16:30:52,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-18 16:30:52,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-18 16:30:52,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-18 16:30:52,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-18 16:30:52,888 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2021-12-18 16:30:52,888 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2021-12-18 16:30:52,889 INFO L130 BoogieDeclarations]: Found specification of procedure asc2ax [2021-12-18 16:30:52,889 INFO L138 BoogieDeclarations]: Found implementation of procedure asc2ax [2021-12-18 16:30:52,889 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2021-12-18 16:30:52,889 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2021-12-18 16:30:52,889 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock [2021-12-18 16:30:52,889 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock [2021-12-18 16:30:52,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 16:30:52,889 INFO L130 BoogieDeclarations]: Found specification of procedure rose_frames_acked [2021-12-18 16:30:52,889 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_frames_acked [2021-12-18 16:30:52,889 INFO L130 BoogieDeclarations]: Found specification of procedure net_eq [2021-12-18 16:30:52,889 INFO L138 BoogieDeclarations]: Found implementation of procedure net_eq [2021-12-18 16:30:52,890 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2021-12-18 16:30:52,890 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2021-12-18 16:30:53,833 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 16:30:53,836 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 16:30:54,098 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-18 16:31:38,076 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 16:31:38,103 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 16:31:38,107 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-18 16:31:38,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:31:38 BoogieIcfgContainer [2021-12-18 16:31:38,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 16:31:38,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 16:31:38,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 16:31:38,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 16:31:38,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:30:44" (1/3) ... [2021-12-18 16:31:38,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0fc63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:31:38, skipping insertion in model container [2021-12-18 16:31:38,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:30:52" (2/3) ... [2021-12-18 16:31:38,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0fc63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:31:38, skipping insertion in model container [2021-12-18 16:31:38,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:31:38" (3/3) ... [2021-12-18 16:31:38,121 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--rose--rose.ko.cil.i [2021-12-18 16:31:38,125 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 16:31:38,125 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2021-12-18 16:31:38,171 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 16:31:38,183 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 16:31:38,183 INFO L340 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2021-12-18 16:31:38,243 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-12-18 16:31:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 16:31:38,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:31:38,247 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-12-18 16:31:38,248 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-12-18 16:31:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:31:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1809857965, now seen corresponding path program 1 times [2021-12-18 16:31:38,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:31:38,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654881665] [2021-12-18 16:31:38,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:31:38,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:31:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:31:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:38,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 16:31:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 16:31:38,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:31:38,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654881665] [2021-12-18 16:31:38,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654881665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:31:38,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:31:38,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:31:38,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981250314] [2021-12-18 16:31:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:31:38,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:31:38,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:31:38,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:31:38,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:31:38,797 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-12-18 16:31:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:31:44,833 INFO L93 Difference]: Finished difference Result 6814 states and 9758 transitions. [2021-12-18 16:31:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:31:44,836 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-12-18 16:31:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:31:44,898 INFO L225 Difference]: With dead ends: 6814 [2021-12-18 16:31:44,898 INFO L226 Difference]: Without dead ends: 3867 [2021-12-18 16:31:44,930 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-12-18 16:31:44,934 INFO L933 BasicCegarLoop]: 4612 mSDtfsCounter, 3712 mSDsluCounter, 14025 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2021-12-18 16:31:44,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3719 Valid, 18637 Invalid, 1456 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2021-12-18 16:31:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2021-12-18 16:31:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3857. [2021-12-18 16:31:45,116 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-12-18 16:31:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 5311 transitions. [2021-12-18 16:31:45,137 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 5311 transitions. Word has length 23 [2021-12-18 16:31:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:31:45,138 INFO L470 AbstractCegarLoop]: Abstraction has 3857 states and 5311 transitions. [2021-12-18 16:31:45,138 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-12-18 16:31:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 5311 transitions. [2021-12-18 16:31:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 16:31:45,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:31:45,139 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-12-18 16:31:45,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 16:31:45,140 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-12-18 16:31:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:31:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1809798383, now seen corresponding path program 1 times [2021-12-18 16:31:45,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:31:45,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556160048] [2021-12-18 16:31:45,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:31:45,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:31:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:31:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:45,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 16:31:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 16:31:45,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:31:45,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556160048] [2021-12-18 16:31:45,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556160048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:31:45,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:31:45,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 16:31:45,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290681862] [2021-12-18 16:31:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:31:45,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 16:31:45,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:31:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 16:31:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 16:31:45,365 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-12-18 16:31:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:31:45,507 INFO L93 Difference]: Finished difference Result 3871 states and 5328 transitions. [2021-12-18 16:31:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 16:31:45,507 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-12-18 16:31:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:31:45,524 INFO L225 Difference]: With dead ends: 3871 [2021-12-18 16:31:45,524 INFO L226 Difference]: Without dead ends: 3869 [2021-12-18 16:31:45,526 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-12-18 16:31:45,528 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-12-18 16:31:45,528 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-12-18 16:31:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2021-12-18 16:31:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3859. [2021-12-18 16:31:45,608 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-12-18 16:31:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 5312 transitions. [2021-12-18 16:31:45,629 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 5312 transitions. Word has length 23 [2021-12-18 16:31:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:31:45,630 INFO L470 AbstractCegarLoop]: Abstraction has 3859 states and 5312 transitions. [2021-12-18 16:31:45,630 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-12-18 16:31:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 5312 transitions. [2021-12-18 16:31:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 16:31:45,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:31:45,631 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-12-18 16:31:45,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 16:31:45,631 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-12-18 16:31:45,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:31:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash -128193833, now seen corresponding path program 1 times [2021-12-18 16:31:45,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:31:45,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652282623] [2021-12-18 16:31:45,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:31:45,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:31:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:31:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-18 16:31:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 16:31:45,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:31:45,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652282623] [2021-12-18 16:31:45,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652282623] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:31:45,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:31:45,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 16:31:45,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980720774] [2021-12-18 16:31:45,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:31:45,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 16:31:45,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:31:45,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 16:31:45,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 16:31:45,866 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-12-18 16:31:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:31:45,971 INFO L93 Difference]: Finished difference Result 7703 states and 10693 transitions. [2021-12-18 16:31:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 16:31:45,972 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-12-18 16:31:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:31:45,991 INFO L225 Difference]: With dead ends: 7703 [2021-12-18 16:31:45,991 INFO L226 Difference]: Without dead ends: 3853 [2021-12-18 16:31:46,119 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-12-18 16:31:46,121 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-12-18 16:31:46,122 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-12-18 16:31:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2021-12-18 16:31:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3853. [2021-12-18 16:31:46,225 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-12-18 16:31:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5303 transitions. [2021-12-18 16:31:46,241 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5303 transitions. Word has length 27 [2021-12-18 16:31:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:31:46,241 INFO L470 AbstractCegarLoop]: Abstraction has 3853 states and 5303 transitions. [2021-12-18 16:31:46,241 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-12-18 16:31:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5303 transitions. [2021-12-18 16:31:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-18 16:31:46,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:31:46,245 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-12-18 16:31:46,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 16:31:46,246 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-12-18 16:31:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:31:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash 190320325, now seen corresponding path program 1 times [2021-12-18 16:31:46,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:31:46,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294002352] [2021-12-18 16:31:46,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:31:46,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:31:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:31:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:31:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:31:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:31:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:31:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:46,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:31:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:31:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:31:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:31:46,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:31:46,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294002352] [2021-12-18 16:31:46,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294002352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:31:46,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:31:46,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:31:46,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029201691] [2021-12-18 16:31:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:31:46,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:31:46,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:31:46,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:31:46,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:31:46,542 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-12-18 16:32:00,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:03,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:04,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:07,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:32:08,947 INFO L93 Difference]: Finished difference Result 3853 states and 5303 transitions. [2021-12-18 16:32:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:32:08,948 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-12-18 16:32:08,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:32:08,988 INFO L225 Difference]: With dead ends: 3853 [2021-12-18 16:32:08,988 INFO L226 Difference]: Without dead ends: 3851 [2021-12-18 16:32:08,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 16:32:08,994 INFO L933 BasicCegarLoop]: 3487 mSDtfsCounter, 6449 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3431 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6723 SdHoareTripleChecker+Valid, 6204 SdHoareTripleChecker+Invalid, 6978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3431 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2021-12-18 16:32:08,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6723 Valid, 6204 Invalid, 6978 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3431 Invalid, 3 Unknown, 0 Unchecked, 21.8s Time] [2021-12-18 16:32:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2021-12-18 16:32:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3851. [2021-12-18 16:32:09,110 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-12-18 16:32:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5301 transitions. [2021-12-18 16:32:09,125 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5301 transitions. Word has length 51 [2021-12-18 16:32:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:32:09,125 INFO L470 AbstractCegarLoop]: Abstraction has 3851 states and 5301 transitions. [2021-12-18 16:32:09,126 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-12-18 16:32:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5301 transitions. [2021-12-18 16:32:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-18 16:32:09,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:32:09,131 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-12-18 16:32:09,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 16:32:09,131 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-12-18 16:32:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:32:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1571739151, now seen corresponding path program 1 times [2021-12-18 16:32:09,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:32:09,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504203014] [2021-12-18 16:32:09,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:32:09,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:32:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:32:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:32:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:32:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:32:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:32:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:32:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:32:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:32:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:32:09,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:32:09,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504203014] [2021-12-18 16:32:09,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504203014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:32:09,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:32:09,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:32:09,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590067558] [2021-12-18 16:32:09,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:32:09,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:32:09,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:32:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:32:09,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:32:09,488 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-12-18 16:32:26,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:29,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:32,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:32:34,521 INFO L93 Difference]: Finished difference Result 3851 states and 5301 transitions. [2021-12-18 16:32:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:32:34,522 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-12-18 16:32:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:32:34,537 INFO L225 Difference]: With dead ends: 3851 [2021-12-18 16:32:34,538 INFO L226 Difference]: Without dead ends: 3849 [2021-12-18 16:32:34,540 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-12-18 16:32:34,540 INFO L933 BasicCegarLoop]: 3485 mSDtfsCounter, 6443 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3429 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6716 SdHoareTripleChecker+Valid, 6202 SdHoareTripleChecker+Invalid, 6976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3429 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2021-12-18 16:32:34,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6716 Valid, 6202 Invalid, 6976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3429 Invalid, 3 Unknown, 0 Unchecked, 24.5s Time] [2021-12-18 16:32:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2021-12-18 16:32:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3849. [2021-12-18 16:32:34,636 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-12-18 16:32:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5299 transitions. [2021-12-18 16:32:34,648 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5299 transitions. Word has length 57 [2021-12-18 16:32:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:32:34,649 INFO L470 AbstractCegarLoop]: Abstraction has 3849 states and 5299 transitions. [2021-12-18 16:32:34,649 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-12-18 16:32:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5299 transitions. [2021-12-18 16:32:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-18 16:32:34,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:32:34,651 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-12-18 16:32:34,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 16:32:34,651 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-12-18 16:32:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:32:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash -855458997, now seen corresponding path program 1 times [2021-12-18 16:32:34,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:32:34,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869400316] [2021-12-18 16:32:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:32:34,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:32:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:32:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:34,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:32:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:32:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:32:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:32:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:32:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:34,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:32:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:34,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:32:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:32:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:32:35,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:32:35,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869400316] [2021-12-18 16:32:35,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869400316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:32:35,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:32:35,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:32:35,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113953924] [2021-12-18 16:32:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:32:35,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:32:35,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:32:35,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:32:35,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:32:35,014 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-12-18 16:32:50,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:54,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:56,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:32:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:32:59,051 INFO L93 Difference]: Finished difference Result 3849 states and 5299 transitions. [2021-12-18 16:32:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:32:59,051 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-12-18 16:32:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:32:59,184 INFO L225 Difference]: With dead ends: 3849 [2021-12-18 16:32:59,193 INFO L226 Difference]: Without dead ends: 3847 [2021-12-18 16:32:59,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 16:32:59,196 INFO L933 BasicCegarLoop]: 3483 mSDtfsCounter, 6437 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3427 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6709 SdHoareTripleChecker+Valid, 6200 SdHoareTripleChecker+Invalid, 6974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3427 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2021-12-18 16:32:59,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6709 Valid, 6200 Invalid, 6974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3427 Invalid, 3 Unknown, 0 Unchecked, 23.5s Time] [2021-12-18 16:32:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2021-12-18 16:32:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 3847. [2021-12-18 16:32:59,319 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-12-18 16:32:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 5297 transitions. [2021-12-18 16:32:59,331 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 5297 transitions. Word has length 63 [2021-12-18 16:32:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:32:59,332 INFO L470 AbstractCegarLoop]: Abstraction has 3847 states and 5297 transitions. [2021-12-18 16:32:59,332 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-12-18 16:32:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 5297 transitions. [2021-12-18 16:32:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-18 16:32:59,334 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:32:59,334 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-12-18 16:32:59,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 16:32:59,334 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-12-18 16:32:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:32:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1540277008, now seen corresponding path program 1 times [2021-12-18 16:32:59,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:32:59,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271077433] [2021-12-18 16:32:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:32:59,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:32:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:32:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:32:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:32:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:32:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:32:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:32:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:32:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:32:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:32:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:32:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:32:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:32:59,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:32:59,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271077433] [2021-12-18 16:32:59,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271077433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:32:59,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:32:59,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:32:59,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183213646] [2021-12-18 16:32:59,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:32:59,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:32:59,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:32:59,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:32:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:32:59,682 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-12-18 16:33:13,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:33:16,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:33:20,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:33:23,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:33:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:33:25,317 INFO L93 Difference]: Finished difference Result 3847 states and 5297 transitions. [2021-12-18 16:33:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:33:25,318 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-12-18 16:33:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:33:25,341 INFO L225 Difference]: With dead ends: 3847 [2021-12-18 16:33:25,341 INFO L226 Difference]: Without dead ends: 3845 [2021-12-18 16:33:25,343 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-12-18 16:33:25,344 INFO L933 BasicCegarLoop]: 3481 mSDtfsCounter, 6431 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3425 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.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, 3425 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2021-12-18 16:33:25,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6702 Valid, 6198 Invalid, 6972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3425 Invalid, 3 Unknown, 0 Unchecked, 25.1s Time] [2021-12-18 16:33:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2021-12-18 16:33:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2021-12-18 16:33:25,441 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-12-18 16:33:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 5295 transitions. [2021-12-18 16:33:25,453 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 5295 transitions. Word has length 69 [2021-12-18 16:33:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:33:25,454 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 5295 transitions. [2021-12-18 16:33:25,454 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-12-18 16:33:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 5295 transitions. [2021-12-18 16:33:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 16:33:25,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:33:25,455 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-12-18 16:33:25,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 16:33:25,455 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-12-18 16:33:25,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:33:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash -337013681, now seen corresponding path program 1 times [2021-12-18 16:33:25,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:33:25,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86593635] [2021-12-18 16:33:25,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:33:25,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:33:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:33:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:33:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:33:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:33:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:33:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:33:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:33:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:33:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:33:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:33:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 16:33:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:33:25,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:33:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86593635] [2021-12-18 16:33:25,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86593635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:33:25,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:33:25,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:33:25,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833563004] [2021-12-18 16:33:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:33:25,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:33:25,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:33:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:33:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:33:25,807 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-12-18 16:33:42,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:33:45,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:33:47,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:33:50,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:33:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:33:52,269 INFO L93 Difference]: Finished difference Result 3845 states and 5295 transitions. [2021-12-18 16:33:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:33:52,270 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-12-18 16:33:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:33:52,281 INFO L225 Difference]: With dead ends: 3845 [2021-12-18 16:33:52,282 INFO L226 Difference]: Without dead ends: 3843 [2021-12-18 16:33:52,283 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-12-18 16:33:52,283 INFO L933 BasicCegarLoop]: 3479 mSDtfsCounter, 6425 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3423 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6695 SdHoareTripleChecker+Valid, 6196 SdHoareTripleChecker+Invalid, 6970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3423 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2021-12-18 16:33:52,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6695 Valid, 6196 Invalid, 6970 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3423 Invalid, 3 Unknown, 0 Unchecked, 25.8s Time] [2021-12-18 16:33:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2021-12-18 16:33:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3843. [2021-12-18 16:33:52,376 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-12-18 16:33:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 3843 states and 5293 transitions. [2021-12-18 16:33:52,386 INFO L78 Accepts]: Start accepts. Automaton has 3843 states and 5293 transitions. Word has length 75 [2021-12-18 16:33:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:33:52,387 INFO L470 AbstractCegarLoop]: Abstraction has 3843 states and 5293 transitions. [2021-12-18 16:33:52,388 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-12-18 16:33:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3843 states and 5293 transitions. [2021-12-18 16:33:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-18 16:33:52,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:33:52,389 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-12-18 16:33:52,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 16:33:52,389 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-12-18 16:33:52,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:33:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1030175907, now seen corresponding path program 1 times [2021-12-18 16:33:52,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:33:52,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17257064] [2021-12-18 16:33:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:33:52,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:33:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:33:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:33:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:33:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:33:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:33:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:33:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:33:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:33:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:33:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:33:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 16:33:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 16:33:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:33:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:33:52,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:33:52,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17257064] [2021-12-18 16:33:52,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17257064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:33:52,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:33:52,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:33:52,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97546337] [2021-12-18 16:33:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:33:52,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:33:52,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:33:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:33:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:33:52,753 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-12-18 16:34:10,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:34:14,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:34:17,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:34:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:34:19,555 INFO L93 Difference]: Finished difference Result 3843 states and 5293 transitions. [2021-12-18 16:34:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:34:19,561 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-12-18 16:34:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:34:19,579 INFO L225 Difference]: With dead ends: 3843 [2021-12-18 16:34:19,585 INFO L226 Difference]: Without dead ends: 3841 [2021-12-18 16:34:19,588 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-12-18 16:34:19,590 INFO L933 BasicCegarLoop]: 3477 mSDtfsCounter, 6419 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6688 SdHoareTripleChecker+Valid, 6194 SdHoareTripleChecker+Invalid, 6968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2021-12-18 16:34:19,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6688 Valid, 6194 Invalid, 6968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3421 Invalid, 3 Unknown, 0 Unchecked, 26.2s Time] [2021-12-18 16:34:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2021-12-18 16:34:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3841. [2021-12-18 16:34:19,712 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-12-18 16:34:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5291 transitions. [2021-12-18 16:34:19,724 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5291 transitions. Word has length 81 [2021-12-18 16:34:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:34:19,725 INFO L470 AbstractCegarLoop]: Abstraction has 3841 states and 5291 transitions. [2021-12-18 16:34:19,725 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-12-18 16:34:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5291 transitions. [2021-12-18 16:34:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-18 16:34:19,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:34:19,730 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-12-18 16:34:19,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 16:34:19,731 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-12-18 16:34:19,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:34:19,732 INFO L85 PathProgramCache]: Analyzing trace with hash 429809083, now seen corresponding path program 1 times [2021-12-18 16:34:19,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:34:19,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620483284] [2021-12-18 16:34:19,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:34:19,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:34:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:19,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:34:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:19,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:34:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:34:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:34:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:34:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:34:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:34:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:34:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:34:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:34:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 16:34:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 16:34:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 16:34:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:34:20,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:34:20,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620483284] [2021-12-18 16:34:20,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620483284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:34:20,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:34:20,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:34:20,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54519505] [2021-12-18 16:34:20,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:34:20,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:34:20,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:34:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:34:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:34:20,104 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-12-18 16:34:36,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:34:40,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:34:41,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:34:43,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:34:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:34:46,217 INFO L93 Difference]: Finished difference Result 3841 states and 5291 transitions. [2021-12-18 16:34:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:34:46,218 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-12-18 16:34:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:34:46,232 INFO L225 Difference]: With dead ends: 3841 [2021-12-18 16:34:46,233 INFO L226 Difference]: Without dead ends: 3839 [2021-12-18 16:34:46,235 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-12-18 16:34:46,236 INFO L933 BasicCegarLoop]: 3475 mSDtfsCounter, 6413 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3420 mSolverCounterSat, 3544 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6681 SdHoareTripleChecker+Valid, 6192 SdHoareTripleChecker+Invalid, 6966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3420 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2021-12-18 16:34:46,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6681 Valid, 6192 Invalid, 6966 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3420 Invalid, 2 Unknown, 0 Unchecked, 25.5s Time] [2021-12-18 16:34:46,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2021-12-18 16:34:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3839. [2021-12-18 16:34:46,419 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-12-18 16:34:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 5289 transitions. [2021-12-18 16:34:46,430 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 5289 transitions. Word has length 87 [2021-12-18 16:34:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:34:46,430 INFO L470 AbstractCegarLoop]: Abstraction has 3839 states and 5289 transitions. [2021-12-18 16:34:46,431 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-12-18 16:34:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 5289 transitions. [2021-12-18 16:34:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-18 16:34:46,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:34:46,432 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-12-18 16:34:46,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 16:34:46,433 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-12-18 16:34:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:34:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2120853129, now seen corresponding path program 1 times [2021-12-18 16:34:46,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:34:46,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140719643] [2021-12-18 16:34:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:34:46,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:34:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:34:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:34:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:34:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:34:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:34:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:34:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:34:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:34:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:34:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:34:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 16:34:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 16:34:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 16:34:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 16:34:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:34:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:34:46,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:34:46,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140719643] [2021-12-18 16:34:46,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140719643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:34:46,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:34:46,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:34:46,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542266120] [2021-12-18 16:34:46,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:34:46,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:34:46,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:34:46,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:34:46,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:34:46,837 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-12-18 16:35:04,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:35:08,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:35:11,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:35:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:35:13,835 INFO L93 Difference]: Finished difference Result 3839 states and 5289 transitions. [2021-12-18 16:35:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:35:13,835 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-12-18 16:35:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:35:13,854 INFO L225 Difference]: With dead ends: 3839 [2021-12-18 16:35:13,854 INFO L226 Difference]: Without dead ends: 3837 [2021-12-18 16:35:13,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 16:35:13,857 INFO L933 BasicCegarLoop]: 3473 mSDtfsCounter, 6411 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3413 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6678 SdHoareTripleChecker+Valid, 6190 SdHoareTripleChecker+Invalid, 6960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3413 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2021-12-18 16:35:13,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6678 Valid, 6190 Invalid, 6960 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3413 Invalid, 3 Unknown, 0 Unchecked, 26.3s Time] [2021-12-18 16:35:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2021-12-18 16:35:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3837. [2021-12-18 16:35:13,976 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-12-18 16:35:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5287 transitions. [2021-12-18 16:35:13,990 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5287 transitions. Word has length 93 [2021-12-18 16:35:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:35:13,990 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 5287 transitions. [2021-12-18 16:35:13,991 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-12-18 16:35:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5287 transitions. [2021-12-18 16:35:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-18 16:35:13,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:35:13,992 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-12-18 16:35:13,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 16:35:13,992 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-12-18 16:35:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:35:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1969777274, now seen corresponding path program 1 times [2021-12-18 16:35:13,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:35:13,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217022751] [2021-12-18 16:35:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:35:13,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:35:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:35:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:35:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:35:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:35:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:35:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:35:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:35:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:35:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:35:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:35:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 16:35:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 16:35:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 16:35:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 16:35:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:35:14,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:35:14,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217022751] [2021-12-18 16:35:14,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217022751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:35:14,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:35:14,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:35:14,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386458027] [2021-12-18 16:35:14,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:35:14,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:35:14,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:35:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:35:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:35:14,380 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-12-18 16:35:30,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:35:33,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:35:36,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:35:39,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:35:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:35:41,952 INFO L93 Difference]: Finished difference Result 3837 states and 5287 transitions. [2021-12-18 16:35:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:35:41,953 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-12-18 16:35:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:35:41,970 INFO L225 Difference]: With dead ends: 3837 [2021-12-18 16:35:41,971 INFO L226 Difference]: Without dead ends: 3835 [2021-12-18 16:35:41,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 16:35:41,982 INFO L933 BasicCegarLoop]: 3471 mSDtfsCounter, 6399 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 3544 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6666 SdHoareTripleChecker+Valid, 6188 SdHoareTripleChecker+Invalid, 6962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2021-12-18 16:35:41,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6666 Valid, 6188 Invalid, 6962 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3416 Invalid, 2 Unknown, 0 Unchecked, 26.8s Time] [2021-12-18 16:35:41,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2021-12-18 16:35:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3835. [2021-12-18 16:35:42,125 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-12-18 16:35:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5285 transitions. [2021-12-18 16:35:42,142 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5285 transitions. Word has length 95 [2021-12-18 16:35:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:35:42,142 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 5285 transitions. [2021-12-18 16:35:42,143 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-12-18 16:35:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5285 transitions. [2021-12-18 16:35:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-18 16:35:42,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:35:42,145 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-12-18 16:35:42,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 16:35:42,146 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-12-18 16:35:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:35:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1348437627, now seen corresponding path program 1 times [2021-12-18 16:35:42,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:35:42,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488212854] [2021-12-18 16:35:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:35:42,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:35:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:35:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 16:35:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:35:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 16:35:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:35:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 16:35:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 16:35:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:35:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 16:35:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 16:35:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 16:35:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:35:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:35:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-18 16:35:42,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:35:42,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488212854] [2021-12-18 16:35:42,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488212854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:35:42,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:35:42,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 16:35:42,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231048948] [2021-12-18 16:35:42,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:35:42,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 16:35:42,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:35:42,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 16:35:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 16:35:42,749 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-12-18 16:35:54,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:36:12,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:36:17,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:36:19,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:36:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:36:34,764 INFO L93 Difference]: Finished difference Result 8663 states and 12582 transitions. [2021-12-18 16:36:34,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 16:36:34,765 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-12-18 16:36:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:36:34,806 INFO L225 Difference]: With dead ends: 8663 [2021-12-18 16:36:34,806 INFO L226 Difference]: Without dead ends: 8661 [2021-12-18 16:36:34,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-12-18 16:36:34,813 INFO L933 BasicCegarLoop]: 4464 mSDtfsCounter, 5574 mSDsluCounter, 13853 mSDsCounter, 0 mSdLazyCounter, 6718 mSolverCounterSat, 2361 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 18317 SdHoareTripleChecker+Invalid, 9083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2361 IncrementalHoareTripleChecker+Valid, 6718 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.7s IncrementalHoareTripleChecker+Time [2021-12-18 16:36:34,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6217 Valid, 18317 Invalid, 9083 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2361 Valid, 6718 Invalid, 4 Unknown, 0 Unchecked, 50.7s Time] [2021-12-18 16:36:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8661 states. [2021-12-18 16:36:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8661 to 7246. [2021-12-18 16:36:35,118 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-12-18 16:36:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7246 states to 7246 states and 10015 transitions. [2021-12-18 16:36:35,144 INFO L78 Accepts]: Start accepts. Automaton has 7246 states and 10015 transitions. Word has length 99 [2021-12-18 16:36:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:36:35,144 INFO L470 AbstractCegarLoop]: Abstraction has 7246 states and 10015 transitions. [2021-12-18 16:36:35,145 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-12-18 16:36:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7246 states and 10015 transitions. [2021-12-18 16:36:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-18 16:36:35,146 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:36:35,146 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-12-18 16:36:35,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 16:36:35,147 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-12-18 16:36:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:36:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash -364293682, now seen corresponding path program 1 times [2021-12-18 16:36:35,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:36:35,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644221784] [2021-12-18 16:36:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:36:35,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:36:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:36:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:36:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:36:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:36:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:36:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:36:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:36:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:36:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:36:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:36:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 16:36:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 16:36:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 16:36:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 16:36:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 16:36:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:36:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:36:35,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:36:35,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644221784] [2021-12-18 16:36:35,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644221784] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:36:35,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:36:35,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:36:35,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720095930] [2021-12-18 16:36:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:36:35,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:36:35,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:36:35,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:36:35,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:36:35,573 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-12-18 16:36:54,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:36:58,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:37:01,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:37:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:37:04,454 INFO L93 Difference]: Finished difference Result 7246 states and 10015 transitions. [2021-12-18 16:37:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:37:04,455 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-12-18 16:37:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:37:04,484 INFO L225 Difference]: With dead ends: 7246 [2021-12-18 16:37:04,484 INFO L226 Difference]: Without dead ends: 7244 [2021-12-18 16:37:04,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 16:37:04,490 INFO L933 BasicCegarLoop]: 3469 mSDtfsCounter, 6395 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3413 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6661 SdHoareTripleChecker+Valid, 6186 SdHoareTripleChecker+Invalid, 6960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3413 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2021-12-18 16:37:04,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6661 Valid, 6186 Invalid, 6960 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3413 Invalid, 3 Unknown, 0 Unchecked, 28.1s Time] [2021-12-18 16:37:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states. [2021-12-18 16:37:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 7244. [2021-12-18 16:37:04,855 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-12-18 16:37:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7244 states to 7244 states and 10012 transitions. [2021-12-18 16:37:04,880 INFO L78 Accepts]: Start accepts. Automaton has 7244 states and 10012 transitions. Word has length 101 [2021-12-18 16:37:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:37:04,880 INFO L470 AbstractCegarLoop]: Abstraction has 7244 states and 10012 transitions. [2021-12-18 16:37:04,880 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-12-18 16:37:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 7244 states and 10012 transitions. [2021-12-18 16:37:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-18 16:37:04,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:37:04,882 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-12-18 16:37:04,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 16:37:04,882 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-12-18 16:37:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:37:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash -883515864, now seen corresponding path program 1 times [2021-12-18 16:37:04,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:37:04,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50475852] [2021-12-18 16:37:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:37:04,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:37:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:37:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:37:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:37:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:37:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:37:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:37:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:37:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:37:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:37:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:37:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 16:37:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 16:37:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 16:37:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 16:37:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 16:37:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 16:37:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:37:05,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:37:05,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50475852] [2021-12-18 16:37:05,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50475852] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:37:05,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:37:05,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:37:05,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515264172] [2021-12-18 16:37:05,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:37:05,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:37:05,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:37:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:37:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:37:05,245 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-12-18 16:37:25,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:37:29,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:37:32,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:37:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:37:34,954 INFO L93 Difference]: Finished difference Result 7244 states and 10012 transitions. [2021-12-18 16:37:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:37:34,954 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-12-18 16:37:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:37:34,992 INFO L225 Difference]: With dead ends: 7244 [2021-12-18 16:37:34,993 INFO L226 Difference]: Without dead ends: 7242 [2021-12-18 16:37:35,000 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-12-18 16:37:35,002 INFO L933 BasicCegarLoop]: 3467 mSDtfsCounter, 6389 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3411 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6654 SdHoareTripleChecker+Valid, 6184 SdHoareTripleChecker+Invalid, 6958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3411 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2021-12-18 16:37:35,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6654 Valid, 6184 Invalid, 6958 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3411 Invalid, 3 Unknown, 0 Unchecked, 28.8s Time] [2021-12-18 16:37:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2021-12-18 16:37:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 7242. [2021-12-18 16:37:35,340 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-12-18 16:37:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 10009 transitions. [2021-12-18 16:37:35,366 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 10009 transitions. Word has length 107 [2021-12-18 16:37:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:37:35,368 INFO L470 AbstractCegarLoop]: Abstraction has 7242 states and 10009 transitions. [2021-12-18 16:37:35,368 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-12-18 16:37:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 10009 transitions. [2021-12-18 16:37:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-18 16:37:35,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:37:35,370 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-12-18 16:37:35,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 16:37:35,370 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-12-18 16:37:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:37:35,370 INFO L85 PathProgramCache]: Analyzing trace with hash 36454316, now seen corresponding path program 1 times [2021-12-18 16:37:35,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:37:35,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338693185] [2021-12-18 16:37:35,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:37:35,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:37:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:37:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:37:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-18 16:37:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-18 16:37:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:37:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 16:37:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 16:37:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 16:37:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 16:37:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 16:37:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 16:37:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 16:37:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 16:37:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-18 16:37:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-18 16:37:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-18 16:37:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-18 16:37:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:37:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:37:35,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:37:35,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338693185] [2021-12-18 16:37:35,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338693185] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:37:35,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:37:35,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:37:35,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203823924] [2021-12-18 16:37:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:37:35,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:37:35,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:37:35,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:37:35,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:37:35,753 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-12-18 16:37:55,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:37:59,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:38:02,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:38:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:38:05,171 INFO L93 Difference]: Finished difference Result 7242 states and 10009 transitions. [2021-12-18 16:38:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:38:05,171 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-12-18 16:38:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:38:05,187 INFO L225 Difference]: With dead ends: 7242 [2021-12-18 16:38:05,187 INFO L226 Difference]: Without dead ends: 7240 [2021-12-18 16:38:05,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 16:38:05,189 INFO L933 BasicCegarLoop]: 3465 mSDtfsCounter, 6383 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6647 SdHoareTripleChecker+Valid, 6182 SdHoareTripleChecker+Invalid, 6956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2021-12-18 16:38:05,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6647 Valid, 6182 Invalid, 6956 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3409 Invalid, 3 Unknown, 0 Unchecked, 28.6s Time] [2021-12-18 16:38:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7240 states. [2021-12-18 16:38:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7240 to 7240. [2021-12-18 16:38:05,423 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-12-18 16:38:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7240 states to 7240 states and 10006 transitions. [2021-12-18 16:38:05,445 INFO L78 Accepts]: Start accepts. Automaton has 7240 states and 10006 transitions. Word has length 113 [2021-12-18 16:38:05,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:38:05,446 INFO L470 AbstractCegarLoop]: Abstraction has 7240 states and 10006 transitions. [2021-12-18 16:38:05,446 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-12-18 16:38:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 7240 states and 10006 transitions. [2021-12-18 16:38:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-18 16:38:05,448 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:38:05,448 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-12-18 16:38:05,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 16:38:05,448 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-12-18 16:38:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:38:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash -141668438, now seen corresponding path program 1 times [2021-12-18 16:38:05,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:38:05,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893892638] [2021-12-18 16:38:05,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:38:05,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:38:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:38:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 16:38:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:38:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 16:38:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:38:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 16:38:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 16:38:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 16:38:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 16:38:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:38:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 16:38:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 16:38:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:38:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 16:38:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:38:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 16:38:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-18 16:38:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 16:38:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 16:38:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2021-12-18 16:38:05,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:38:05,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893892638] [2021-12-18 16:38:05,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893892638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:38:05,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:38:05,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:38:05,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370258565] [2021-12-18 16:38:05,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:38:05,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:38:05,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:38:05,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:38:05,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:38:05,943 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-12-18 16:38:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:38:29,745 INFO L93 Difference]: Finished difference Result 15793 states and 22473 transitions. [2021-12-18 16:38:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 16:38:29,746 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-12-18 16:38:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:38:29,810 INFO L225 Difference]: With dead ends: 15793 [2021-12-18 16:38:29,811 INFO L226 Difference]: Without dead ends: 8710 [2021-12-18 16:38:29,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 16:38:29,843 INFO L933 BasicCegarLoop]: 3805 mSDtfsCounter, 5591 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 3767 mSolverCounterSat, 2634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6117 SdHoareTripleChecker+Valid, 7386 SdHoareTripleChecker+Invalid, 6401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2634 IncrementalHoareTripleChecker+Valid, 3767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2021-12-18 16:38:29,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6117 Valid, 7386 Invalid, 6401 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2634 Valid, 3767 Invalid, 0 Unknown, 0 Unchecked, 22.9s Time] [2021-12-18 16:38:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2021-12-18 16:38:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7241. [2021-12-18 16:38:30,160 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-12-18 16:38:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 10006 transitions. [2021-12-18 16:38:30,190 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 10006 transitions. Word has length 134 [2021-12-18 16:38:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:38:30,190 INFO L470 AbstractCegarLoop]: Abstraction has 7241 states and 10006 transitions. [2021-12-18 16:38:30,190 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-12-18 16:38:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 10006 transitions. [2021-12-18 16:38:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-18 16:38:30,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:38:30,193 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-12-18 16:38:30,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 16:38:30,194 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-12-18 16:38:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:38:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1356853694, now seen corresponding path program 1 times [2021-12-18 16:38:30,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:38:30,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973031295] [2021-12-18 16:38:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:38:30,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:38:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:38:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 16:38:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 16:38:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 16:38:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:38:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 16:38:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 16:38:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 16:38:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 16:38:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 16:38:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 16:38:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 16:38:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 16:38:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:38:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 16:38:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 16:38:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 16:38:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 16:38:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:38:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:38:30,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:38:30,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973031295] [2021-12-18 16:38:30,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973031295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:38:30,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:38:30,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:38:30,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395305406] [2021-12-18 16:38:30,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:38:30,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:38:30,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:38:30,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:38:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:38:30,602 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-12-18 16:38:55,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:38:59,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:39:02,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:39:05,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:39:16,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:39:18,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:39:25,945 WARN L534 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-12-18 16:39:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:39:27,715 INFO L93 Difference]: Finished difference Result 12076 states and 16566 transitions. [2021-12-18 16:39:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 16:39:27,715 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-12-18 16:39:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:39:27,761 INFO L225 Difference]: With dead ends: 12076 [2021-12-18 16:39:27,761 INFO L226 Difference]: Without dead ends: 12074 [2021-12-18 16:39:27,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-18 16:39:27,768 INFO L933 BasicCegarLoop]: 3633 mSDtfsCounter, 8770 mSDsluCounter, 3641 mSDsCounter, 0 mSdLazyCounter, 6213 mSolverCounterSat, 5003 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9027 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 11222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5003 IncrementalHoareTripleChecker+Valid, 6213 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.7s IncrementalHoareTripleChecker+Time [2021-12-18 16:39:27,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9027 Valid, 7274 Invalid, 11222 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5003 Valid, 6213 Invalid, 6 Unknown, 0 Unchecked, 55.7s Time] [2021-12-18 16:39:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12074 states. [2021-12-18 16:39:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12074 to 11869. [2021-12-18 16:39:28,302 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-12-18 16:39:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 16346 transitions. [2021-12-18 16:39:28,347 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 16346 transitions. Word has length 121 [2021-12-18 16:39:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:39:28,348 INFO L470 AbstractCegarLoop]: Abstraction has 11869 states and 16346 transitions. [2021-12-18 16:39:28,348 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-12-18 16:39:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 16346 transitions. [2021-12-18 16:39:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-12-18 16:39:28,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:39:28,350 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-12-18 16:39:28,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 16:39:28,351 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-12-18 16:39:28,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:39:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash 145130022, now seen corresponding path program 1 times [2021-12-18 16:39:28,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:39:28,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654206607] [2021-12-18 16:39:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:39:28,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:39:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:39:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 16:39:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:39:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 16:39:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:39:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 16:39:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 16:39:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:39:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 16:39:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 16:39:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-18 16:39:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:39:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 16:39:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-18 16:39:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:39:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 16:39:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:39:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:39:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-18 16:39:28,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:39:28,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654206607] [2021-12-18 16:39:28,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654206607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:39:28,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:39:28,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 16:39:28,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623313193] [2021-12-18 16:39:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:39:28,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 16:39:28,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:39:28,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 16:39:28,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 16:39:28,933 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-12-18 16:39:36,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:40:14,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:40:16,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:40:19,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:40:22,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:40:24,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:40:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:40:35,853 INFO L93 Difference]: Finished difference Result 27689 states and 39708 transitions. [2021-12-18 16:40:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 16:40:35,854 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-12-18 16:40:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:40:35,906 INFO L225 Difference]: With dead ends: 27689 [2021-12-18 16:40:35,907 INFO L226 Difference]: Without dead ends: 16104 [2021-12-18 16:40:35,938 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-12-18 16:40:35,938 INFO L933 BasicCegarLoop]: 4223 mSDtfsCounter, 4380 mSDsluCounter, 7311 mSDsCounter, 0 mSdLazyCounter, 7757 mSolverCounterSat, 3405 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5073 SdHoareTripleChecker+Valid, 11534 SdHoareTripleChecker+Invalid, 11167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3405 IncrementalHoareTripleChecker+Valid, 7757 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.2s IncrementalHoareTripleChecker+Time [2021-12-18 16:40:35,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5073 Valid, 11534 Invalid, 11167 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3405 Valid, 7757 Invalid, 5 Unknown, 0 Unchecked, 65.2s Time] [2021-12-18 16:40:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2021-12-18 16:40:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 12203. [2021-12-18 16:40:36,516 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-12-18 16:40:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12203 states to 12203 states and 16844 transitions. [2021-12-18 16:40:36,568 INFO L78 Accepts]: Start accepts. Automaton has 12203 states and 16844 transitions. Word has length 131 [2021-12-18 16:40:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:40:36,568 INFO L470 AbstractCegarLoop]: Abstraction has 12203 states and 16844 transitions. [2021-12-18 16:40:36,568 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-12-18 16:40:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 12203 states and 16844 transitions. [2021-12-18 16:40:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-18 16:40:36,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:40:36,571 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-12-18 16:40:36,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 16:40:36,571 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-12-18 16:40:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:40:36,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1405441805, now seen corresponding path program 1 times [2021-12-18 16:40:36,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:40:36,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610761278] [2021-12-18 16:40:36,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:40:36,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:40:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:40:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 16:40:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:40:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 16:40:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:40:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 16:40:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 16:40:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:40:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 16:40:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 16:40:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 16:40:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:40:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 16:40:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:40:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 16:40:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:40:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:40:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-18 16:40:37,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:40:37,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610761278] [2021-12-18 16:40:37,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610761278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:40:37,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:40:37,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:40:37,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133674122] [2021-12-18 16:40:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:40:37,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:40:37,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:40:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:40:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:40:37,045 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-12-18 16:41:10,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:41:13,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:41:16,035 WARN L534 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-12-18 16:41:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:41:25,606 INFO L93 Difference]: Finished difference Result 26832 states and 38183 transitions. [2021-12-18 16:41:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 16:41:25,606 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-12-18 16:41:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:41:25,662 INFO L225 Difference]: With dead ends: 26832 [2021-12-18 16:41:25,663 INFO L226 Difference]: Without dead ends: 14689 [2021-12-18 16:41:25,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-18 16:41:25,701 INFO L933 BasicCegarLoop]: 3451 mSDtfsCounter, 4004 mSDsluCounter, 3813 mSDsCounter, 0 mSdLazyCounter, 4966 mSolverCounterSat, 3322 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4441 SdHoareTripleChecker+Valid, 7264 SdHoareTripleChecker+Invalid, 8291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3322 IncrementalHoareTripleChecker+Valid, 4966 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.1s IncrementalHoareTripleChecker+Time [2021-12-18 16:41:25,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4441 Valid, 7264 Invalid, 8291 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3322 Valid, 4966 Invalid, 3 Unknown, 0 Unchecked, 47.1s Time] [2021-12-18 16:41:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14689 states. [2021-12-18 16:41:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14689 to 12204. [2021-12-18 16:41:26,243 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-12-18 16:41:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12204 states to 12204 states and 16845 transitions. [2021-12-18 16:41:26,295 INFO L78 Accepts]: Start accepts. Automaton has 12204 states and 16845 transitions. Word has length 123 [2021-12-18 16:41:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:41:26,305 INFO L470 AbstractCegarLoop]: Abstraction has 12204 states and 16845 transitions. [2021-12-18 16:41:26,305 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-12-18 16:41:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12204 states and 16845 transitions. [2021-12-18 16:41:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-18 16:41:26,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:41:26,307 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-12-18 16:41:26,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 16:41:26,308 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-12-18 16:41:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:41:26,308 INFO L85 PathProgramCache]: Analyzing trace with hash 721909771, now seen corresponding path program 1 times [2021-12-18 16:41:26,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:41:26,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464101865] [2021-12-18 16:41:26,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:41:26,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:41:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:41:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 16:41:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 16:41:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 16:41:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:41:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 16:41:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 16:41:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 16:41:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 16:41:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 16:41:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 16:41:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 16:41:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 16:41:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:41:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 16:41:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 16:41:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 16:41:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 16:41:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 16:41:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:41:26,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:41:26,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464101865] [2021-12-18 16:41:26,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464101865] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:41:26,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:41:26,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:41:26,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065439300] [2021-12-18 16:41:26,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:41:26,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:41:26,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:41:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:41:26,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:41:26,772 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-12-18 16:41:49,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:41:53,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:41:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:41:58,135 INFO L93 Difference]: Finished difference Result 12204 states and 16845 transitions. [2021-12-18 16:41:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:41:58,136 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 127 [2021-12-18 16:41:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:41:58,218 INFO L225 Difference]: With dead ends: 12204 [2021-12-18 16:41:58,219 INFO L226 Difference]: Without dead ends: 12202 [2021-12-18 16:41:58,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 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-12-18 16:41:58,229 INFO L933 BasicCegarLoop]: 3462 mSDtfsCounter, 6374 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 3544 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6636 SdHoareTripleChecker+Valid, 6176 SdHoareTripleChecker+Invalid, 6954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2021-12-18 16:41:58,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6636 Valid, 6176 Invalid, 6954 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3408 Invalid, 2 Unknown, 0 Unchecked, 30.2s Time] [2021-12-18 16:41:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12202 states. [2021-12-18 16:41:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12202 to 12202. [2021-12-18 16:41:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12202 states, 8230 states have (on average 1.2816524908869988) internal successors, (10548), 8698 states have internal predecessors, (10548), 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-12-18 16:41:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12202 states to 12202 states and 16842 transitions. [2021-12-18 16:41:58,880 INFO L78 Accepts]: Start accepts. Automaton has 12202 states and 16842 transitions. Word has length 127 [2021-12-18 16:41:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:41:58,881 INFO L470 AbstractCegarLoop]: Abstraction has 12202 states and 16842 transitions. [2021-12-18 16:41:58,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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-12-18 16:41:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 12202 states and 16842 transitions. [2021-12-18 16:41:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-18 16:41:58,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:41:58,883 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 16:41:58,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-18 16:41:58,883 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2021-12-18 16:41:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:41:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1791431319, now seen corresponding path program 1 times [2021-12-18 16:41:58,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:41:58,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240701590] [2021-12-18 16:41:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:41:58,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:41:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:41:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-18 16:41:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 16:41:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-18 16:41:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:41:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 16:41:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 16:41:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 16:41:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 16:41:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 16:41:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 16:41:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 16:41:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 16:41:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:41:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 16:41:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 16:41:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 16:41:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 16:41:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 16:41:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 16:41:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:41:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-18 16:41:59,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:41:59,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240701590] [2021-12-18 16:41:59,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240701590] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:41:59,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:41:59,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 16:41:59,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653609038] [2021-12-18 16:41:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:41:59,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 16:41:59,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:41:59,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 16:41:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 16:41:59,379 INFO L87 Difference]: Start difference. First operand 12202 states and 16842 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-18 16:42:22,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:42:24,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:42:28,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:42:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:42:32,095 INFO L93 Difference]: Finished difference Result 12202 states and 16842 transitions. [2021-12-18 16:42:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 16:42:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2021-12-18 16:42:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:42:32,136 INFO L225 Difference]: With dead ends: 12202 [2021-12-18 16:42:32,136 INFO L226 Difference]: Without dead ends: 12200 [2021-12-18 16:42:32,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 16:42:32,144 INFO L933 BasicCegarLoop]: 3460 mSDtfsCounter, 6368 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 3544 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6629 SdHoareTripleChecker+Valid, 6174 SdHoareTripleChecker+Invalid, 6952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3544 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2021-12-18 16:42:32,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6629 Valid, 6174 Invalid, 6952 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3544 Valid, 3405 Invalid, 3 Unknown, 0 Unchecked, 31.5s Time] [2021-12-18 16:42:32,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12200 states. [2021-12-18 16:42:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12200 to 12200. [2021-12-18 16:42:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12200 states, 8229 states have (on average 1.2814436748086038) internal successors, (10545), 8696 states have internal predecessors, (10545), 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-12-18 16:42:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12200 states to 12200 states and 16839 transitions. [2021-12-18 16:42:32,771 INFO L78 Accepts]: Start accepts. Automaton has 12200 states and 16839 transitions. Word has length 133 [2021-12-18 16:42:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:42:32,771 INFO L470 AbstractCegarLoop]: Abstraction has 12200 states and 16839 transitions. [2021-12-18 16:42:32,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-18 16:42:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 12200 states and 16839 transitions. [2021-12-18 16:42:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-18 16:42:32,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:42:32,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 16:42:32,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-18 16:42:32,774 INFO L402 AbstractCegarLoop]: === Iteration 23 === 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-12-18 16:42:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:42:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2111860815, now seen corresponding path program 1 times [2021-12-18 16:42:32,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:42:32,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570263913] [2021-12-18 16:42:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:42:32,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:42:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:32,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:42:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:32,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 16:42:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:42:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 16:42:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:42:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 16:42:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 16:42:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:42:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 16:42:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 16:42:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 16:42:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:42:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 16:42:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:42:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 16:42:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:42:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 16:42:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:42:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-18 16:42:33,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:42:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570263913] [2021-12-18 16:42:33,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570263913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:42:33,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:42:33,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 16:42:33,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972966269] [2021-12-18 16:42:33,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:42:33,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 16:42:33,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:42:33,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 16:42:33,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 16:42:33,356 INFO L87 Difference]: Start difference. First operand 12200 states and 16839 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-18 16:42:41,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:42:46,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:42:47,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:43:29,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:43:32,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:43:37,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:43:39,365 WARN L534 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-12-18 16:43:41,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:43:43,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 16:43:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 16:43:57,896 INFO L93 Difference]: Finished difference Result 26852 states and 38222 transitions. [2021-12-18 16:43:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 16:43:57,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2021-12-18 16:43:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 16:43:57,948 INFO L225 Difference]: With dead ends: 26852 [2021-12-18 16:43:57,949 INFO L226 Difference]: Without dead ends: 14712 [2021-12-18 16:43:57,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-12-18 16:43:57,985 INFO L933 BasicCegarLoop]: 3469 mSDtfsCounter, 3980 mSDsluCounter, 8088 mSDsCounter, 0 mSdLazyCounter, 9130 mSolverCounterSat, 3323 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4417 SdHoareTripleChecker+Valid, 11557 SdHoareTripleChecker+Invalid, 12459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3323 IncrementalHoareTripleChecker+Valid, 9130 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.4s IncrementalHoareTripleChecker+Time [2021-12-18 16:43:57,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4417 Valid, 11557 Invalid, 12459 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3323 Valid, 9130 Invalid, 6 Unknown, 0 Unchecked, 82.4s Time] [2021-12-18 16:43:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14712 states. [2021-12-18 16:43:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14712 to 12204. [2021-12-18 16:43:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12204 states, 8232 states have (on average 1.28134110787172) internal successors, (10548), 8699 states have internal predecessors, (10548), 3116 states have call successors, (3116), 837 states have call predecessors, (3116), 845 states have return successors, (3184), 2945 states have call predecessors, (3184), 3114 states have call successors, (3184) [2021-12-18 16:43:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12204 states to 12204 states and 16848 transitions. [2021-12-18 16:43:58,626 INFO L78 Accepts]: Start accepts. Automaton has 12204 states and 16848 transitions. Word has length 133 [2021-12-18 16:43:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 16:43:58,627 INFO L470 AbstractCegarLoop]: Abstraction has 12204 states and 16848 transitions. [2021-12-18 16:43:58,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-18 16:43:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12204 states and 16848 transitions. [2021-12-18 16:43:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-18 16:43:58,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 16:43:58,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 16:43:58,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-18 16:43:58,630 INFO L402 AbstractCegarLoop]: === Iteration 24 === 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-12-18 16:43:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 16:43:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash -956907824, now seen corresponding path program 1 times [2021-12-18 16:43:58,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 16:43:58,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676952560] [2021-12-18 16:43:58,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 16:43:58,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 16:43:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 16:43:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 16:43:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:43:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 16:43:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:43:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 16:43:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 16:43:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:43:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 16:43:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-18 16:43:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 16:43:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 16:43:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-18 16:43:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 16:43:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 16:43:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 16:43:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 16:43:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 16:43:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-18 16:43:59,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 16:43:59,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676952560] [2021-12-18 16:43:59,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676952560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 16:43:59,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 16:43:59,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 16:43:59,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913005988] [2021-12-18 16:43:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 16:43:59,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 16:43:59,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 16:43:59,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 16:43:59,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 16:43:59,463 INFO L87 Difference]: Start difference. First operand 12204 states and 16848 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 16:44:08,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15