./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.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 70285c15c86f57662e9c7cfb124387828d40f8fb898978032ed6716b7a4d6009 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:45:05,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:45:05,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:45:05,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:45:05,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:45:05,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:45:05,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:45:05,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:45:05,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:45:05,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:45:05,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:45:05,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:45:05,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:45:05,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:45:05,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:45:05,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:45:05,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:45:05,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:45:05,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:45:05,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:45:05,110 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:45:05,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:45:05,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:45:05,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:45:05,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:45:05,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:45:05,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:45:05,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:45:05,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:45:05,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:45:05,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:45:05,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:45:05,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:45:05,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:45:05,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:45:05,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:45:05,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:45:05,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:45:05,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:45:05,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:45:05,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:45:05,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:45:05,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:45:05,152 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:45:05,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:45:05,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:45:05,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:45:05,153 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:45:05,153 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:45:05,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:45:05,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:45:05,154 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:45:05,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:45:05,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:45:05,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:45:05,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:45:05,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:45:05,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:45:05,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:45:05,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:45:05,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:45:05,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:45:05,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:45:05,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:45:05,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:45:05,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:45:05,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:45:05,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:45:05,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:45:05,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:45:05,157 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:45:05,157 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:45:05,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:45:05,158 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 -> 70285c15c86f57662e9c7cfb124387828d40f8fb898978032ed6716b7a4d6009 [2022-07-14 04:45:05,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:45:05,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:45:05,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:45:05,351 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:45:05,352 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:45:05,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2022-07-14 04:45:05,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa5f0b8c/9dd6219c911f49d2a7746a3ca372d841/FLAGed2f131a0 [2022-07-14 04:45:06,078 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:45:06,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2022-07-14 04:45:06,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa5f0b8c/9dd6219c911f49d2a7746a3ca372d841/FLAGed2f131a0 [2022-07-14 04:45:06,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa5f0b8c/9dd6219c911f49d2a7746a3ca372d841 [2022-07-14 04:45:06,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:45:06,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:45:06,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:45:06,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:45:06,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:45:06,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:45:06" (1/1) ... [2022-07-14 04:45:06,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41478db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:06, skipping insertion in model container [2022-07-14 04:45:06,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:45:06" (1/1) ... [2022-07-14 04:45:06,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:45:06,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:45:11,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562820,562833] [2022-07-14 04:45:11,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562965,562978] [2022-07-14 04:45:11,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563111,563124] [2022-07-14 04:45:11,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563276,563289] [2022-07-14 04:45:11,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563434,563447] [2022-07-14 04:45:11,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563592,563605] [2022-07-14 04:45:11,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563750,563763] [2022-07-14 04:45:11,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563910,563923] [2022-07-14 04:45:11,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564069,564082] [2022-07-14 04:45:11,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564208,564221] [2022-07-14 04:45:11,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564350,564363] [2022-07-14 04:45:11,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564499,564512] [2022-07-14 04:45:11,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564638,564651] [2022-07-14 04:45:11,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564793,564806] [2022-07-14 04:45:11,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564953,564966] [2022-07-14 04:45:11,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565104,565117] [2022-07-14 04:45:11,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565255,565268] [2022-07-14 04:45:11,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565407,565420] [2022-07-14 04:45:11,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565556,565569] [2022-07-14 04:45:11,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565704,565717] [2022-07-14 04:45:11,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565861,565874] [2022-07-14 04:45:11,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566010,566023] [2022-07-14 04:45:11,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566166,566179] [2022-07-14 04:45:11,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566319,566332] [2022-07-14 04:45:11,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566465,566478] [2022-07-14 04:45:11,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566608,566621] [2022-07-14 04:45:11,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566760,566773] [2022-07-14 04:45:11,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566906,566919] [2022-07-14 04:45:11,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567051,567064] [2022-07-14 04:45:11,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567205,567218] [2022-07-14 04:45:11,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567356,567369] [2022-07-14 04:45:11,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567511,567524] [2022-07-14 04:45:11,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567663,567676] [2022-07-14 04:45:11,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567818,567831] [2022-07-14 04:45:11,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567982,567995] [2022-07-14 04:45:11,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568138,568151] [2022-07-14 04:45:11,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568302,568315] [2022-07-14 04:45:11,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568444,568457] [2022-07-14 04:45:11,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568602,568615] [2022-07-14 04:45:11,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568769,568782] [2022-07-14 04:45:11,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568928,568941] [2022-07-14 04:45:11,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569087,569100] [2022-07-14 04:45:11,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569236,569249] [2022-07-14 04:45:11,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569383,569396] [2022-07-14 04:45:11,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569522,569535] [2022-07-14 04:45:11,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569685,569698] [2022-07-14 04:45:11,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569851,569864] [2022-07-14 04:45:11,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570015,570028] [2022-07-14 04:45:11,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570180,570193] [2022-07-14 04:45:11,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570345,570358] [2022-07-14 04:45:11,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570511,570524] [2022-07-14 04:45:11,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570676,570689] [2022-07-14 04:45:11,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570843,570856] [2022-07-14 04:45:11,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571003,571016] [2022-07-14 04:45:11,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571165,571178] [2022-07-14 04:45:11,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571324,571337] [2022-07-14 04:45:11,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571470,571483] [2022-07-14 04:45:11,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571613,571626] [2022-07-14 04:45:11,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571757,571770] [2022-07-14 04:45:11,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571900,571913] [2022-07-14 04:45:11,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572044,572057] [2022-07-14 04:45:11,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572185,572198] [2022-07-14 04:45:11,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572323,572336] [2022-07-14 04:45:11,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572481,572494] [2022-07-14 04:45:11,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572640,572653] [2022-07-14 04:45:11,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572796,572809] [2022-07-14 04:45:11,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572945,572958] [2022-07-14 04:45:11,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573097,573110] [2022-07-14 04:45:11,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573248,573261] [2022-07-14 04:45:11,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573397,573410] [2022-07-14 04:45:11,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573549,573562] [2022-07-14 04:45:11,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573697,573710] [2022-07-14 04:45:11,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573850,573863] [2022-07-14 04:45:11,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574001,574014] [2022-07-14 04:45:11,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574151,574164] [2022-07-14 04:45:11,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574298,574311] [2022-07-14 04:45:11,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574449,574462] [2022-07-14 04:45:11,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574600,574613] [2022-07-14 04:45:11,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574748,574761] [2022-07-14 04:45:11,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574914,574927] [2022-07-14 04:45:11,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575083,575096] [2022-07-14 04:45:11,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575250,575263] [2022-07-14 04:45:11,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575418,575431] [2022-07-14 04:45:11,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575568,575581] [2022-07-14 04:45:11,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575715,575728] [2022-07-14 04:45:11,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575876,575889] [2022-07-14 04:45:11,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576046,576059] [2022-07-14 04:45:11,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576208,576221] [2022-07-14 04:45:11,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:45:11,352 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:45:11,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562820,562833] [2022-07-14 04:45:11,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[562965,562978] [2022-07-14 04:45:11,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563111,563124] [2022-07-14 04:45:11,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563276,563289] [2022-07-14 04:45:11,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563434,563447] [2022-07-14 04:45:11,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563592,563605] [2022-07-14 04:45:11,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563750,563763] [2022-07-14 04:45:11,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[563910,563923] [2022-07-14 04:45:11,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564069,564082] [2022-07-14 04:45:11,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564208,564221] [2022-07-14 04:45:11,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564350,564363] [2022-07-14 04:45:11,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564499,564512] [2022-07-14 04:45:11,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564638,564651] [2022-07-14 04:45:11,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564793,564806] [2022-07-14 04:45:11,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[564953,564966] [2022-07-14 04:45:11,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565104,565117] [2022-07-14 04:45:11,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565255,565268] [2022-07-14 04:45:11,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565407,565420] [2022-07-14 04:45:11,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565556,565569] [2022-07-14 04:45:11,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565704,565717] [2022-07-14 04:45:11,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[565861,565874] [2022-07-14 04:45:11,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566010,566023] [2022-07-14 04:45:11,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566166,566179] [2022-07-14 04:45:11,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566319,566332] [2022-07-14 04:45:11,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566465,566478] [2022-07-14 04:45:11,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566608,566621] [2022-07-14 04:45:11,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566760,566773] [2022-07-14 04:45:11,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[566906,566919] [2022-07-14 04:45:11,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567051,567064] [2022-07-14 04:45:11,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567205,567218] [2022-07-14 04:45:11,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567356,567369] [2022-07-14 04:45:11,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567511,567524] [2022-07-14 04:45:11,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567663,567676] [2022-07-14 04:45:11,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567818,567831] [2022-07-14 04:45:11,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[567982,567995] [2022-07-14 04:45:11,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568138,568151] [2022-07-14 04:45:11,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568302,568315] [2022-07-14 04:45:11,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568444,568457] [2022-07-14 04:45:11,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568602,568615] [2022-07-14 04:45:11,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568769,568782] [2022-07-14 04:45:11,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[568928,568941] [2022-07-14 04:45:11,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569087,569100] [2022-07-14 04:45:11,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569236,569249] [2022-07-14 04:45:11,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569383,569396] [2022-07-14 04:45:11,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569522,569535] [2022-07-14 04:45:11,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569685,569698] [2022-07-14 04:45:11,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[569851,569864] [2022-07-14 04:45:11,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570015,570028] [2022-07-14 04:45:11,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570180,570193] [2022-07-14 04:45:11,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570345,570358] [2022-07-14 04:45:11,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570511,570524] [2022-07-14 04:45:11,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570676,570689] [2022-07-14 04:45:11,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[570843,570856] [2022-07-14 04:45:11,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571003,571016] [2022-07-14 04:45:11,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571165,571178] [2022-07-14 04:45:11,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571324,571337] [2022-07-14 04:45:11,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571470,571483] [2022-07-14 04:45:11,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571613,571626] [2022-07-14 04:45:11,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571757,571770] [2022-07-14 04:45:11,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[571900,571913] [2022-07-14 04:45:11,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572044,572057] [2022-07-14 04:45:11,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572185,572198] [2022-07-14 04:45:11,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572323,572336] [2022-07-14 04:45:11,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572481,572494] [2022-07-14 04:45:11,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572640,572653] [2022-07-14 04:45:11,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572796,572809] [2022-07-14 04:45:11,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[572945,572958] [2022-07-14 04:45:11,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573097,573110] [2022-07-14 04:45:11,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573248,573261] [2022-07-14 04:45:11,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573397,573410] [2022-07-14 04:45:11,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573549,573562] [2022-07-14 04:45:11,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573697,573710] [2022-07-14 04:45:11,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[573850,573863] [2022-07-14 04:45:11,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574001,574014] [2022-07-14 04:45:11,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574151,574164] [2022-07-14 04:45:11,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574298,574311] [2022-07-14 04:45:11,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574449,574462] [2022-07-14 04:45:11,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574600,574613] [2022-07-14 04:45:11,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574748,574761] [2022-07-14 04:45:11,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[574914,574927] [2022-07-14 04:45:11,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575083,575096] [2022-07-14 04:45:11,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575250,575263] [2022-07-14 04:45:11,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575418,575431] [2022-07-14 04:45:11,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575568,575581] [2022-07-14 04:45:11,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575715,575728] [2022-07-14 04:45:11,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[575876,575889] [2022-07-14 04:45:11,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576046,576059] [2022-07-14 04:45:11,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i[576208,576221] [2022-07-14 04:45:11,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:45:12,005 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:45:12,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12 WrapperNode [2022-07-14 04:45:12,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:45:12,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:45:12,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:45:12,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:45:12,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,327 INFO L137 Inliner]: procedures = 842, calls = 3789, calls flagged for inlining = 410, calls inlined = 310, statements flattened = 9245 [2022-07-14 04:45:12,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:45:12,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:45:12,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:45:12,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:45:12,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:45:12,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:45:12,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:45:12,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:45:12,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (1/1) ... [2022-07-14 04:45:12,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:45:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:45:12,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 04:45:12,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 04:45:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure ipv6_hdr [2022-07-14 04:45:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ipv6_hdr [2022-07-14 04:45:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-14 04:45:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-14 04:45:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:45:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:45:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-14 04:45:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-14 04:45:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 04:45:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure pci_name [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_name [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_maybe_stop_tx [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_maybe_stop_tx [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_suspend [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_suspend [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_assign_vector [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_assign_vector [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_desc_unused [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_desc_unused [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:45:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:45:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_netpoll [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_netpoll [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_reset_interrupt_capability [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_reset_interrupt_capability [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_msg_vf [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_msg_vf [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure skb_transport_header [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_transport_header [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure skb_network_offset [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_network_offset [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure napi_enable [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure napi_enable [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:45:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:45:12,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_calloc [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_calloc [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_configure_msix [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_configure_msix [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_open [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_open [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headlen [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headlen [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_nway_reset [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_nway_reset [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_write_posted_mbx [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_write_posted_mbx [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_irq_enable [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_irq_enable [2022-07-14 04:45:12,684 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-14 04:45:12,684 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_update_stats [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_update_stats [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_bit_vf [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_bit_vf [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_init_hw_vf [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_init_hw_vf [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_ack [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_ack [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_rar_set_vf [2022-07-14 04:45:12,685 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_rar_set_vf [2022-07-14 04:45:12,685 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_down [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_down [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_free_irq [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_free_irq [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure ip_hdr [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ip_hdr [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure ethtool_cmd_speed_set [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ethtool_cmd_speed_set [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_link_vf [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_link_vf [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_v2p_mailbox [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_v2p_mailbox [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_unmap_page [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_unmap_page [2022-07-14 04:45:12,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:45:12,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_single_attrs [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_single_attrs [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_setup_rx_resources [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_setup_rx_resources [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure dma_mapping_error [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_mapping_error [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_poll_for_msg [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_poll_for_msg [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:45:12,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:45:12,687 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_nonatomic [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_nonatomic [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_shutdown [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_shutdown [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_get_eeprom_len [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_get_eeprom_len [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u16~0~X~~bool~0~TO~~s32~0 [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u16~0~X~~bool~0~TO~~s32~0 [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_io_resume [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_io_resume [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_tx_timeout [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_tx_timeout [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2022-07-14 04:45:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2022-07-14 04:45:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_up [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_up [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_page [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_page [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_init_function_pointers_vf [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_init_function_pointers_vf [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure dma_map_page [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_map_page [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_alloc_rx_buffers [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_alloc_rx_buffers [2022-07-14 04:45:12,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:45:12,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_mac_addr_vf [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_mac_addr_vf [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_close [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_close [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_reset_hw_vf [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_reset_hw_vf [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_clean_tx_irq [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_clean_tx_irq [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_attach [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_attach [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2022-07-14 04:45:12,690 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-14 04:45:12,690 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-14 04:45:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 04:45:12,691 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 04:45:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:45:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-14 04:45:12,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-14 04:45:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:45:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:45:12,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:45:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-14 04:45:12,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-14 04:45:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:45:12,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:45:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:45:12,696 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:45:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:45:12,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:45:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-14 04:45:12,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-14 04:45:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_free_tx_resources [2022-07-14 04:45:12,697 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_free_tx_resources [2022-07-14 04:45:12,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:45:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:45:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_1 [2022-07-14 04:45:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_1 [2022-07-14 04:45:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_2 [2022-07-14 04:45:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_2 [2022-07-14 04:45:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-14 04:45:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-14 04:45:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:45:12,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:45:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure __udelay [2022-07-14 04:45:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __udelay [2022-07-14 04:45:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_0 [2022-07-14 04:45:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_0 [2022-07-14 04:45:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure dma_map_single_attrs [2022-07-14 04:45:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_map_single_attrs [2022-07-14 04:45:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-14 04:45:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-14 04:45:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:45:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:45:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_reset [2022-07-14 04:45:12,700 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_reset [2022-07-14 04:45:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-14 04:45:12,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-14 04:45:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_map_page [2022-07-14 04:45:12,700 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_map_page [2022-07-14 04:45:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_reinit_locked [2022-07-14 04:45:12,700 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_reinit_locked [2022-07-14 04:45:12,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:45:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:45:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_vlan_rx_add_vid [2022-07-14 04:45:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_vlan_rx_add_vid [2022-07-14 04:45:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-14 04:45:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-14 04:45:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure tcp_hdr [2022-07-14 04:45:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure tcp_hdr [2022-07-14 04:45:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:45:12,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:45:12,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:45:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure request_irq [2022-07-14 04:45:12,702 INFO L138 BoogieDeclarations]: Found implementation of procedure request_irq [2022-07-14 04:45:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure kmemcheck_mark_initialized [2022-07-14 04:45:12,702 INFO L138 BoogieDeclarations]: Found implementation of procedure kmemcheck_mark_initialized [2022-07-14 04:45:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_get_regs_len [2022-07-14 04:45:12,702 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_get_regs_len [2022-07-14 04:45:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-14 04:45:12,702 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-14 04:45:12,702 INFO L130 BoogieDeclarations]: Found specification of procedure kcalloc [2022-07-14 04:45:12,702 INFO L138 BoogieDeclarations]: Found implementation of procedure kcalloc [2022-07-14 04:45:12,703 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-14 04:45:12,703 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-14 04:45:12,703 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_clean_tx_ring [2022-07-14 04:45:12,703 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_clean_tx_ring [2022-07-14 04:45:12,703 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-14 04:45:12,707 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-14 04:45:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_remove [2022-07-14 04:45:12,707 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_remove [2022-07-14 04:45:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_master [2022-07-14 04:45:12,707 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_master [2022-07-14 04:45:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-14 04:45:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-14 04:45:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_irq_disable [2022-07-14 04:45:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_irq_disable [2022-07-14 04:45:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_configure [2022-07-14 04:45:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_configure [2022-07-14 04:45:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_clean_rx_ring [2022-07-14 04:45:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_clean_rx_ring [2022-07-14 04:45:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~s32~0 [2022-07-14 04:45:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~s32~0 [2022-07-14 04:45:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_obtain_mbx_lock_vf [2022-07-14 04:45:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_obtain_mbx_lock_vf [2022-07-14 04:45:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure is_zero_ether_addr [2022-07-14 04:45:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure is_zero_ether_addr [2022-07-14 04:45:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:45:12,709 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_check_for_ack_vf [2022-07-14 04:45:12,709 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_check_for_ack_vf [2022-07-14 04:45:12,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:45:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:45:12,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq [2022-07-14 04:45:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq [2022-07-14 04:45:12,712 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_request_irq [2022-07-14 04:45:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_request_irq [2022-07-14 04:45:12,713 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_resume [2022-07-14 04:45:12,713 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_resume [2022-07-14 04:45:12,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:45:12,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:45:12,714 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_put_txbuf [2022-07-14 04:45:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_put_txbuf [2022-07-14 04:45:12,714 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2022-07-14 04:45:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~~u16~0~TO~~s32~0 [2022-07-14 04:45:12,714 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-14 04:45:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-14 04:45:12,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:45:12,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:45:12,714 INFO L130 BoogieDeclarations]: Found specification of procedure skb_network_header [2022-07-14 04:45:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_network_header [2022-07-14 04:45:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_setup_tx_resources [2022-07-14 04:45:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_setup_tx_resources [2022-07-14 04:45:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:45:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:45:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:45:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:45:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~$Pointer$~TO~int [2022-07-14 04:45:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~$Pointer$~TO~int [2022-07-14 04:45:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_device_mem [2022-07-14 04:45:12,715 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_enable_device_mem [2022-07-14 04:45:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:45:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:45:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-14 04:45:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-14 04:45:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-14 04:45:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-14 04:45:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure dma_set_mask_and_coherent [2022-07-14 04:45:12,718 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_set_mask_and_coherent [2022-07-14 04:45:12,718 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_free_rx_resources [2022-07-14 04:45:12,718 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_free_rx_resources [2022-07-14 04:45:12,719 INFO L130 BoogieDeclarations]: Found specification of procedure igbvf_set_multi [2022-07-14 04:45:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure igbvf_set_multi [2022-07-14 04:45:12,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:45:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:45:12,719 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2022-07-14 04:45:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2022-07-14 04:45:12,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:45:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:45:12,719 INFO L130 BoogieDeclarations]: Found specification of procedure e1000_read_posted_mbx [2022-07-14 04:45:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure e1000_read_posted_mbx [2022-07-14 04:45:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-14 04:45:12,720 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-14 04:45:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:45:12,720 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-14 04:45:13,639 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:45:13,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:45:13,753 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:45:18,108 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:45:18,131 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:45:18,132 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 04:45:18,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:45:18 BoogieIcfgContainer [2022-07-14 04:45:18,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:45:18,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:45:18,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:45:18,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:45:18,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:45:06" (1/3) ... [2022-07-14 04:45:18,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6617e056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:45:18, skipping insertion in model container [2022-07-14 04:45:18,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:45:12" (2/3) ... [2022-07-14 04:45:18,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6617e056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:45:18, skipping insertion in model container [2022-07-14 04:45:18,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:45:18" (3/3) ... [2022-07-14 04:45:18,144 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--intel--igbvf--igbvf.ko.cil.i [2022-07-14 04:45:18,154 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:45:18,154 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-14 04:45:18,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:45:18,248 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ee9e671, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@725c5ead [2022-07-14 04:45:18,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-14 04:45:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 3169 states, 2192 states have (on average 1.322536496350365) internal successors, (2899), 2278 states have internal predecessors, (2899), 766 states have call successors, (766), 182 states have call predecessors, (766), 181 states have return successors, (760), 743 states have call predecessors, (760), 760 states have call successors, (760) [2022-07-14 04:45:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 04:45:18,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:18,265 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:18,266 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:45:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1113729633, now seen corresponding path program 1 times [2022-07-14 04:45:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:18,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837088221] [2022-07-14 04:45:18,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:18,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:18,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837088221] [2022-07-14 04:45:18,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837088221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:18,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:18,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759547749] [2022-07-14 04:45:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:18,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:18,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:18,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:18,975 INFO L87 Difference]: Start difference. First operand has 3169 states, 2192 states have (on average 1.322536496350365) internal successors, (2899), 2278 states have internal predecessors, (2899), 766 states have call successors, (766), 182 states have call predecessors, (766), 181 states have return successors, (760), 743 states have call predecessors, (760), 760 states have call successors, (760) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:45:21,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:23,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:35,075 INFO L93 Difference]: Finished difference Result 9432 states and 13453 transitions. [2022-07-14 04:45:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:45:35,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-14 04:45:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:35,126 INFO L225 Difference]: With dead ends: 9432 [2022-07-14 04:45:35,126 INFO L226 Difference]: Without dead ends: 6263 [2022-07-14 04:45:35,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:45:35,144 INFO L413 NwaCegarLoop]: 6719 mSDtfsCounter, 7641 mSDsluCounter, 7937 mSDsCounter, 0 mSdLazyCounter, 10068 mSolverCounterSat, 4530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7952 SdHoareTripleChecker+Valid, 14656 SdHoareTripleChecker+Invalid, 14598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4530 IncrementalHoareTripleChecker+Valid, 10068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:35,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7952 Valid, 14656 Invalid, 14598 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4530 Valid, 10068 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2022-07-14 04:45:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2022-07-14 04:45:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 6068. [2022-07-14 04:45:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6068 states, 4232 states have (on average 1.2580340264650283) internal successors, (5324), 4369 states have internal predecessors, (5324), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-14 04:45:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6068 states to 6068 states and 8257 transitions. [2022-07-14 04:45:35,463 INFO L78 Accepts]: Start accepts. Automaton has 6068 states and 8257 transitions. Word has length 64 [2022-07-14 04:45:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:35,464 INFO L495 AbstractCegarLoop]: Abstraction has 6068 states and 8257 transitions. [2022-07-14 04:45:35,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:45:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 6068 states and 8257 transitions. [2022-07-14 04:45:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 04:45:35,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:35,473 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:35,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:45:35,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:45:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1268897674, now seen corresponding path program 1 times [2022-07-14 04:45:35,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:35,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061938541] [2022-07-14 04:45:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:35,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:35,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061938541] [2022-07-14 04:45:35,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061938541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:35,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:35,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571921639] [2022-07-14 04:45:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:35,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:35,974 INFO L87 Difference]: Start difference. First operand 6068 states and 8257 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-14 04:45:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:42,497 INFO L93 Difference]: Finished difference Result 6068 states and 8257 transitions. [2022-07-14 04:45:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2022-07-14 04:45:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:42,523 INFO L225 Difference]: With dead ends: 6068 [2022-07-14 04:45:42,523 INFO L226 Difference]: Without dead ends: 6066 [2022-07-14 04:45:42,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:42,529 INFO L413 NwaCegarLoop]: 3816 mSDtfsCounter, 6399 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6710 SdHoareTripleChecker+Valid, 7305 SdHoareTripleChecker+Invalid, 7233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:42,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6710 Valid, 7305 Invalid, 7233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-14 04:45:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2022-07-14 04:45:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 6066. [2022-07-14 04:45:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6066 states, 4231 states have (on average 1.257858662254786) internal successors, (5322), 4367 states have internal predecessors, (5322), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-14 04:45:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 8255 transitions. [2022-07-14 04:45:42,752 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 8255 transitions. Word has length 70 [2022-07-14 04:45:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:42,755 INFO L495 AbstractCegarLoop]: Abstraction has 6066 states and 8255 transitions. [2022-07-14 04:45:42,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-14 04:45:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 8255 transitions. [2022-07-14 04:45:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 04:45:42,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:42,759 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:42,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:45:42,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:45:42,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1564621767, now seen corresponding path program 1 times [2022-07-14 04:45:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:42,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972333905] [2022-07-14 04:45:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:42,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:42,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:43,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:43,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:43,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:43,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:43,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972333905] [2022-07-14 04:45:43,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972333905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:43,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:43,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925174548] [2022-07-14 04:45:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:43,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:43,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:43,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:43,077 INFO L87 Difference]: Start difference. First operand 6066 states and 8255 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 04:45:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:48,086 INFO L93 Difference]: Finished difference Result 6066 states and 8255 transitions. [2022-07-14 04:45:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:48,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2022-07-14 04:45:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:48,116 INFO L225 Difference]: With dead ends: 6066 [2022-07-14 04:45:48,117 INFO L226 Difference]: Without dead ends: 6064 [2022-07-14 04:45:48,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:48,125 INFO L413 NwaCegarLoop]: 3814 mSDtfsCounter, 6393 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3961 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6703 SdHoareTripleChecker+Valid, 7303 SdHoareTripleChecker+Invalid, 7231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:48,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6703 Valid, 7303 Invalid, 7231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3961 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-14 04:45:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2022-07-14 04:45:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 6064. [2022-07-14 04:45:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6064 states, 4230 states have (on average 1.2576832151300237) internal successors, (5320), 4365 states have internal predecessors, (5320), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-14 04:45:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6064 states to 6064 states and 8253 transitions. [2022-07-14 04:45:48,310 INFO L78 Accepts]: Start accepts. Automaton has 6064 states and 8253 transitions. Word has length 76 [2022-07-14 04:45:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:48,312 INFO L495 AbstractCegarLoop]: Abstraction has 6064 states and 8253 transitions. [2022-07-14 04:45:48,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 04:45:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6064 states and 8253 transitions. [2022-07-14 04:45:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 04:45:48,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:48,314 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:48,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:45:48,314 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:45:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash -772956513, now seen corresponding path program 1 times [2022-07-14 04:45:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:48,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083120544] [2022-07-14 04:45:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:48,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:48,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083120544] [2022-07-14 04:45:48,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083120544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:48,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:48,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070907802] [2022-07-14 04:45:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:48,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:48,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:48,704 INFO L87 Difference]: Start difference. First operand 6064 states and 8253 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 04:45:50,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:54,701 INFO L93 Difference]: Finished difference Result 6064 states and 8253 transitions. [2022-07-14 04:45:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:54,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2022-07-14 04:45:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:54,725 INFO L225 Difference]: With dead ends: 6064 [2022-07-14 04:45:54,725 INFO L226 Difference]: Without dead ends: 6062 [2022-07-14 04:45:54,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:54,728 INFO L413 NwaCegarLoop]: 3812 mSDtfsCounter, 6387 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6696 SdHoareTripleChecker+Valid, 7301 SdHoareTripleChecker+Invalid, 7229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:54,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6696 Valid, 7301 Invalid, 7229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-14 04:45:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2022-07-14 04:45:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 6062. [2022-07-14 04:45:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6062 states, 4229 states have (on average 1.2575076850319225) internal successors, (5318), 4363 states have internal predecessors, (5318), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-14 04:45:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 8251 transitions. [2022-07-14 04:45:54,902 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 8251 transitions. Word has length 82 [2022-07-14 04:45:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:54,902 INFO L495 AbstractCegarLoop]: Abstraction has 6062 states and 8251 transitions. [2022-07-14 04:45:54,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 04:45:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 8251 transitions. [2022-07-14 04:45:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 04:45:54,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:54,903 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:45:54,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:45:54,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:45:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:54,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1443109529, now seen corresponding path program 1 times [2022-07-14 04:45:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:54,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762987010] [2022-07-14 04:45:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:45:55,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:55,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762987010] [2022-07-14 04:45:55,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762987010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:55,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:55,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:55,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289295348] [2022-07-14 04:45:55,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:55,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:55,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:55,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:55,203 INFO L87 Difference]: Start difference. First operand 6062 states and 8251 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:46:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:01,351 INFO L93 Difference]: Finished difference Result 6062 states and 8251 transitions. [2022-07-14 04:46:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2022-07-14 04:46:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:01,379 INFO L225 Difference]: With dead ends: 6062 [2022-07-14 04:46:01,380 INFO L226 Difference]: Without dead ends: 6060 [2022-07-14 04:46:01,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:01,387 INFO L413 NwaCegarLoop]: 3810 mSDtfsCounter, 6381 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3957 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6689 SdHoareTripleChecker+Valid, 7299 SdHoareTripleChecker+Invalid, 7227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:01,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6689 Valid, 7299 Invalid, 7227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3957 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-14 04:46:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2022-07-14 04:46:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 6060. [2022-07-14 04:46:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6060 states, 4228 states have (on average 1.2573320719016083) internal successors, (5316), 4361 states have internal predecessors, (5316), 1467 states have call successors, (1467), 342 states have call predecessors, (1467), 340 states have return successors, (1466), 1426 states have call predecessors, (1466), 1465 states have call successors, (1466) [2022-07-14 04:46:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6060 states to 6060 states and 8249 transitions. [2022-07-14 04:46:01,574 INFO L78 Accepts]: Start accepts. Automaton has 6060 states and 8249 transitions. Word has length 88 [2022-07-14 04:46:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:01,574 INFO L495 AbstractCegarLoop]: Abstraction has 6060 states and 8249 transitions. [2022-07-14 04:46:01,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:46:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6060 states and 8249 transitions. [2022-07-14 04:46:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:46:01,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:01,579 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:01,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:46:01,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash -240102284, now seen corresponding path program 1 times [2022-07-14 04:46:01,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:01,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073857203] [2022-07-14 04:46:01,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:01,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:46:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 04:46:02,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:02,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073857203] [2022-07-14 04:46:02,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073857203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:02,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:02,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772215950] [2022-07-14 04:46:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:02,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:02,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:02,007 INFO L87 Difference]: Start difference. First operand 6060 states and 8249 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:46:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:12,903 INFO L93 Difference]: Finished difference Result 18663 states and 25715 transitions. [2022-07-14 04:46:12,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:46:12,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2022-07-14 04:46:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:12,957 INFO L225 Difference]: With dead ends: 18663 [2022-07-14 04:46:12,957 INFO L226 Difference]: Without dead ends: 12624 [2022-07-14 04:46:12,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:46:12,980 INFO L413 NwaCegarLoop]: 4907 mSDtfsCounter, 13085 mSDsluCounter, 6449 mSDsCounter, 0 mSdLazyCounter, 6454 mSolverCounterSat, 7870 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13428 SdHoareTripleChecker+Valid, 11356 SdHoareTripleChecker+Invalid, 14324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7870 IncrementalHoareTripleChecker+Valid, 6454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:12,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13428 Valid, 11356 Invalid, 14324 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7870 Valid, 6454 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2022-07-14 04:46:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12624 states. [2022-07-14 04:46:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12624 to 10821. [2022-07-14 04:46:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10821 states, 7617 states have (on average 1.2606012865957725) internal successors, (9602), 7823 states have internal predecessors, (9602), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:46:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10821 states to 10821 states and 14756 transitions. [2022-07-14 04:46:13,341 INFO L78 Accepts]: Start accepts. Automaton has 10821 states and 14756 transitions. Word has length 114 [2022-07-14 04:46:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:13,342 INFO L495 AbstractCegarLoop]: Abstraction has 10821 states and 14756 transitions. [2022-07-14 04:46:13,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:46:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 10821 states and 14756 transitions. [2022-07-14 04:46:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:46:13,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:13,344 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:13,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:46:13,344 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1210075495, now seen corresponding path program 1 times [2022-07-14 04:46:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:13,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041911988] [2022-07-14 04:46:13,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:13,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:13,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041911988] [2022-07-14 04:46:13,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041911988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:13,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:13,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129095066] [2022-07-14 04:46:13,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:13,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:13,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:13,670 INFO L87 Difference]: Start difference. First operand 10821 states and 14756 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:46:15,568 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:21,170 INFO L93 Difference]: Finished difference Result 10821 states and 14756 transitions. [2022-07-14 04:46:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:21,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2022-07-14 04:46:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:21,204 INFO L225 Difference]: With dead ends: 10821 [2022-07-14 04:46:21,204 INFO L226 Difference]: Without dead ends: 10819 [2022-07-14 04:46:21,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:21,209 INFO L413 NwaCegarLoop]: 3808 mSDtfsCounter, 6375 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3955 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6682 SdHoareTripleChecker+Valid, 7297 SdHoareTripleChecker+Invalid, 7225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:21,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6682 Valid, 7297 Invalid, 7225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3955 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-14 04:46:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2022-07-14 04:46:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 10819. [2022-07-14 04:46:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10819 states, 7616 states have (on average 1.2605042016806722) internal successors, (9600), 7821 states have internal predecessors, (9600), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:46:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10819 states to 10819 states and 14754 transitions. [2022-07-14 04:46:21,561 INFO L78 Accepts]: Start accepts. Automaton has 10819 states and 14754 transitions. Word has length 94 [2022-07-14 04:46:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:21,561 INFO L495 AbstractCegarLoop]: Abstraction has 10819 states and 14754 transitions. [2022-07-14 04:46:21,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:46:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 10819 states and 14754 transitions. [2022-07-14 04:46:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:46:21,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:21,564 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:21,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:46:21,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:21,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2127157373, now seen corresponding path program 1 times [2022-07-14 04:46:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:21,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825876116] [2022-07-14 04:46:21,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:21,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:46:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:46:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:46:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:46:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-14 04:46:21,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:21,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825876116] [2022-07-14 04:46:21,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825876116] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:46:21,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734993622] [2022-07-14 04:46:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:46:21,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:46:21,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:46:21,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 04:46:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:22,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 3096 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:46:22,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:46:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 04:46:22,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:46:22,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734993622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:22,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:46:22,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-14 04:46:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995659241] [2022-07-14 04:46:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:22,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:46:22,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:22,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:46:22,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:22,904 INFO L87 Difference]: Start difference. First operand 10819 states and 14754 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:46:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:23,285 INFO L93 Difference]: Finished difference Result 21611 states and 29470 transitions. [2022-07-14 04:46:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:46:23,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2022-07-14 04:46:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:23,324 INFO L225 Difference]: With dead ends: 21611 [2022-07-14 04:46:23,325 INFO L226 Difference]: Without dead ends: 10813 [2022-07-14 04:46:23,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:23,359 INFO L413 NwaCegarLoop]: 4242 mSDtfsCounter, 4222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4222 SdHoareTripleChecker+Valid, 4242 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:23,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4222 Valid, 4242 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:46:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10813 states. [2022-07-14 04:46:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10813 to 10813. [2022-07-14 04:46:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10813 states, 7611 states have (on average 1.260149783208514) internal successors, (9591), 7815 states have internal predecessors, (9591), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:46:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10813 states to 10813 states and 14745 transitions. [2022-07-14 04:46:23,730 INFO L78 Accepts]: Start accepts. Automaton has 10813 states and 14745 transitions. Word has length 120 [2022-07-14 04:46:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:23,730 INFO L495 AbstractCegarLoop]: Abstraction has 10813 states and 14745 transitions. [2022-07-14 04:46:23,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:46:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10813 states and 14745 transitions. [2022-07-14 04:46:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:46:23,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:23,732 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:23,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 04:46:23,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:46:23,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1466723574, now seen corresponding path program 1 times [2022-07-14 04:46:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:23,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154143689] [2022-07-14 04:46:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:24,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154143689] [2022-07-14 04:46:24,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154143689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:24,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:24,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:24,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874437729] [2022-07-14 04:46:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:24,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:24,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:24,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:24,347 INFO L87 Difference]: Start difference. First operand 10813 states and 14745 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:46:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:30,206 INFO L93 Difference]: Finished difference Result 10813 states and 14745 transitions. [2022-07-14 04:46:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2022-07-14 04:46:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:30,249 INFO L225 Difference]: With dead ends: 10813 [2022-07-14 04:46:30,249 INFO L226 Difference]: Without dead ends: 10811 [2022-07-14 04:46:30,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:30,258 INFO L413 NwaCegarLoop]: 3801 mSDtfsCounter, 6364 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6670 SdHoareTripleChecker+Valid, 7276 SdHoareTripleChecker+Invalid, 7222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:30,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6670 Valid, 7276 Invalid, 7222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 04:46:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10811 states. [2022-07-14 04:46:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10811 to 10811. [2022-07-14 04:46:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10811 states, 7610 states have (on average 1.2600525624178711) internal successors, (9589), 7813 states have internal predecessors, (9589), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:46:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10811 states to 10811 states and 14743 transitions. [2022-07-14 04:46:30,625 INFO L78 Accepts]: Start accepts. Automaton has 10811 states and 14743 transitions. Word has length 100 [2022-07-14 04:46:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:30,625 INFO L495 AbstractCegarLoop]: Abstraction has 10811 states and 14743 transitions. [2022-07-14 04:46:30,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:46:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 10811 states and 14743 transitions. [2022-07-14 04:46:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:46:30,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:30,639 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:30,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:46:30,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash 235004216, now seen corresponding path program 1 times [2022-07-14 04:46:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:30,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186227015] [2022-07-14 04:46:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:30,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:30,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186227015] [2022-07-14 04:46:30,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186227015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:30,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:30,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:30,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287978539] [2022-07-14 04:46:30,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:30,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:30,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:30,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:30,909 INFO L87 Difference]: Start difference. First operand 10811 states and 14743 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:46:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:36,786 INFO L93 Difference]: Finished difference Result 10811 states and 14743 transitions. [2022-07-14 04:46:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2022-07-14 04:46:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:36,823 INFO L225 Difference]: With dead ends: 10811 [2022-07-14 04:46:36,823 INFO L226 Difference]: Without dead ends: 10809 [2022-07-14 04:46:36,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:36,831 INFO L413 NwaCegarLoop]: 3799 mSDtfsCounter, 6362 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6667 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 7216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:36,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6667 Valid, 7274 Invalid, 7216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 04:46:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10809 states. [2022-07-14 04:46:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10809 to 10809. [2022-07-14 04:46:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10809 states, 7609 states have (on average 1.2599553160730714) internal successors, (9587), 7811 states have internal predecessors, (9587), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:46:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10809 states to 10809 states and 14741 transitions. [2022-07-14 04:46:37,227 INFO L78 Accepts]: Start accepts. Automaton has 10809 states and 14741 transitions. Word has length 106 [2022-07-14 04:46:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:37,228 INFO L495 AbstractCegarLoop]: Abstraction has 10809 states and 14741 transitions. [2022-07-14 04:46:37,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:46:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 10809 states and 14741 transitions. [2022-07-14 04:46:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 04:46:37,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:37,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:37,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:46:37,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1794012517, now seen corresponding path program 1 times [2022-07-14 04:46:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:37,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841356209] [2022-07-14 04:46:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:37,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841356209] [2022-07-14 04:46:37,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841356209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:37,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:37,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042326259] [2022-07-14 04:46:37,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:37,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:37,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:37,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:37,469 INFO L87 Difference]: Start difference. First operand 10809 states and 14741 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:46:39,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:44,169 INFO L93 Difference]: Finished difference Result 10809 states and 14741 transitions. [2022-07-14 04:46:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2022-07-14 04:46:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:44,200 INFO L225 Difference]: With dead ends: 10809 [2022-07-14 04:46:44,201 INFO L226 Difference]: Without dead ends: 10807 [2022-07-14 04:46:44,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:44,207 INFO L413 NwaCegarLoop]: 3797 mSDtfsCounter, 6350 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3948 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6655 SdHoareTripleChecker+Valid, 7272 SdHoareTripleChecker+Invalid, 7218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:44,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6655 Valid, 7272 Invalid, 7218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3948 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-14 04:46:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10807 states. [2022-07-14 04:46:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10807 to 10807. [2022-07-14 04:46:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10807 states, 7608 states have (on average 1.259858044164038) internal successors, (9585), 7809 states have internal predecessors, (9585), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:46:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10807 states to 10807 states and 14739 transitions. [2022-07-14 04:46:44,556 INFO L78 Accepts]: Start accepts. Automaton has 10807 states and 14739 transitions. Word has length 108 [2022-07-14 04:46:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:44,556 INFO L495 AbstractCegarLoop]: Abstraction has 10807 states and 14739 transitions. [2022-07-14 04:46:44,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:46:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 10807 states and 14739 transitions. [2022-07-14 04:46:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:46:44,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:44,557 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:44,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:46:44,558 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1084745860, now seen corresponding path program 1 times [2022-07-14 04:46:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:44,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252445206] [2022-07-14 04:46:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:44,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:44,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252445206] [2022-07-14 04:46:44,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252445206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:44,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:44,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854752162] [2022-07-14 04:46:44,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:44,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:44,844 INFO L87 Difference]: Start difference. First operand 10807 states and 14739 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 04:46:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:50,438 INFO L93 Difference]: Finished difference Result 10807 states and 14739 transitions. [2022-07-14 04:46:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2022-07-14 04:46:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:50,471 INFO L225 Difference]: With dead ends: 10807 [2022-07-14 04:46:50,472 INFO L226 Difference]: Without dead ends: 10805 [2022-07-14 04:46:50,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:50,488 INFO L413 NwaCegarLoop]: 3795 mSDtfsCounter, 6346 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6650 SdHoareTripleChecker+Valid, 7270 SdHoareTripleChecker+Invalid, 7216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:50,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6650 Valid, 7270 Invalid, 7216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-14 04:46:50,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10805 states. [2022-07-14 04:46:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10805 to 10805. [2022-07-14 04:46:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10805 states, 7607 states have (on average 1.2597607466806888) internal successors, (9583), 7807 states have internal predecessors, (9583), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:46:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10805 states to 10805 states and 14737 transitions. [2022-07-14 04:46:51,022 INFO L78 Accepts]: Start accepts. Automaton has 10805 states and 14737 transitions. Word has length 114 [2022-07-14 04:46:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:51,023 INFO L495 AbstractCegarLoop]: Abstraction has 10805 states and 14737 transitions. [2022-07-14 04:46:51,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 04:46:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 10805 states and 14737 transitions. [2022-07-14 04:46:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:46:51,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:51,024 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:51,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:46:51,025 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:51,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash 305349525, now seen corresponding path program 1 times [2022-07-14 04:46:51,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:51,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909338848] [2022-07-14 04:46:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:46:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:51,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909338848] [2022-07-14 04:46:51,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909338848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:51,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:51,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:51,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431934720] [2022-07-14 04:46:51,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:51,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:51,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:51,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:51,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:51,284 INFO L87 Difference]: Start difference. First operand 10805 states and 14737 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:46:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:57,026 INFO L93 Difference]: Finished difference Result 10805 states and 14737 transitions. [2022-07-14 04:46:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:57,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-07-14 04:46:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:57,054 INFO L225 Difference]: With dead ends: 10805 [2022-07-14 04:46:57,055 INFO L226 Difference]: Without dead ends: 10803 [2022-07-14 04:46:57,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:57,061 INFO L413 NwaCegarLoop]: 3793 mSDtfsCounter, 6340 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3944 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6643 SdHoareTripleChecker+Valid, 7268 SdHoareTripleChecker+Invalid, 7214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:57,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6643 Valid, 7268 Invalid, 7214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3944 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-14 04:46:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10803 states. [2022-07-14 04:46:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10803 to 10803. [2022-07-14 04:46:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10803 states, 7606 states have (on average 1.2596634236129371) internal successors, (9581), 7805 states have internal predecessors, (9581), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:46:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10803 states to 10803 states and 14735 transitions. [2022-07-14 04:46:57,433 INFO L78 Accepts]: Start accepts. Automaton has 10803 states and 14735 transitions. Word has length 120 [2022-07-14 04:46:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:57,433 INFO L495 AbstractCegarLoop]: Abstraction has 10803 states and 14735 transitions. [2022-07-14 04:46:57,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:46:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 10803 states and 14735 transitions. [2022-07-14 04:46:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 04:46:57,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:57,435 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:57,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:46:57,435 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:46:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1557366619, now seen corresponding path program 1 times [2022-07-14 04:46:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:57,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195044406] [2022-07-14 04:46:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:46:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:46:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:46:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:46:57,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:57,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195044406] [2022-07-14 04:46:57,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195044406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:57,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:57,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:57,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200643308] [2022-07-14 04:46:57,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:57,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:57,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:57,718 INFO L87 Difference]: Start difference. First operand 10803 states and 14735 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:47:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:03,628 INFO L93 Difference]: Finished difference Result 10803 states and 14735 transitions. [2022-07-14 04:47:03,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:03,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2022-07-14 04:47:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:03,665 INFO L225 Difference]: With dead ends: 10803 [2022-07-14 04:47:03,666 INFO L226 Difference]: Without dead ends: 10801 [2022-07-14 04:47:03,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:03,675 INFO L413 NwaCegarLoop]: 3791 mSDtfsCounter, 6334 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3942 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6636 SdHoareTripleChecker+Valid, 7266 SdHoareTripleChecker+Invalid, 7212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:03,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6636 Valid, 7266 Invalid, 7212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3942 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 04:47:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10801 states. [2022-07-14 04:47:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10801 to 10801. [2022-07-14 04:47:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10801 states, 7605 states have (on average 1.2595660749506903) internal successors, (9579), 7803 states have internal predecessors, (9579), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:47:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10801 states to 10801 states and 14733 transitions. [2022-07-14 04:47:04,142 INFO L78 Accepts]: Start accepts. Automaton has 10801 states and 14733 transitions. Word has length 126 [2022-07-14 04:47:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:04,142 INFO L495 AbstractCegarLoop]: Abstraction has 10801 states and 14733 transitions. [2022-07-14 04:47:04,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:47:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10801 states and 14733 transitions. [2022-07-14 04:47:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:47:04,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:04,144 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:04,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:47:04,144 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:47:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1878397111, now seen corresponding path program 1 times [2022-07-14 04:47:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:04,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424460714] [2022-07-14 04:47:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:47:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:47:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:47:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:47:04,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424460714] [2022-07-14 04:47:04,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424460714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:04,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:04,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:04,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364804967] [2022-07-14 04:47:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:04,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:04,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:04,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:04,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:04,441 INFO L87 Difference]: Start difference. First operand 10801 states and 14733 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:47:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:10,259 INFO L93 Difference]: Finished difference Result 10801 states and 14733 transitions. [2022-07-14 04:47:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:10,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2022-07-14 04:47:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:10,287 INFO L225 Difference]: With dead ends: 10801 [2022-07-14 04:47:10,287 INFO L226 Difference]: Without dead ends: 10799 [2022-07-14 04:47:10,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:10,292 INFO L413 NwaCegarLoop]: 3789 mSDtfsCounter, 6328 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6629 SdHoareTripleChecker+Valid, 7264 SdHoareTripleChecker+Invalid, 7210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:10,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6629 Valid, 7264 Invalid, 7210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3940 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-14 04:47:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10799 states. [2022-07-14 04:47:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10799 to 10799. [2022-07-14 04:47:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10799 states, 7604 states have (on average 1.2594687006838505) internal successors, (9577), 7801 states have internal predecessors, (9577), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:47:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10799 states to 10799 states and 14731 transitions. [2022-07-14 04:47:10,692 INFO L78 Accepts]: Start accepts. Automaton has 10799 states and 14731 transitions. Word has length 132 [2022-07-14 04:47:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:10,692 INFO L495 AbstractCegarLoop]: Abstraction has 10799 states and 14731 transitions. [2022-07-14 04:47:10,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:47:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 10799 states and 14731 transitions. [2022-07-14 04:47:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 04:47:10,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:10,694 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:10,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:47:10,694 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:47:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1999329498, now seen corresponding path program 1 times [2022-07-14 04:47:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907005655] [2022-07-14 04:47:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:47:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:47:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:47:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:47:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:47:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:10,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907005655] [2022-07-14 04:47:10,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907005655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:10,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:10,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62114715] [2022-07-14 04:47:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:10,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:10,981 INFO L87 Difference]: Start difference. First operand 10799 states and 14731 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:47:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:17,095 INFO L93 Difference]: Finished difference Result 10799 states and 14731 transitions. [2022-07-14 04:47:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2022-07-14 04:47:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:17,126 INFO L225 Difference]: With dead ends: 10799 [2022-07-14 04:47:17,127 INFO L226 Difference]: Without dead ends: 10797 [2022-07-14 04:47:17,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:17,134 INFO L413 NwaCegarLoop]: 3787 mSDtfsCounter, 6322 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3938 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6622 SdHoareTripleChecker+Valid, 7262 SdHoareTripleChecker+Invalid, 7208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:17,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6622 Valid, 7262 Invalid, 7208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3938 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-14 04:47:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10797 states. [2022-07-14 04:47:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10797 to 10797. [2022-07-14 04:47:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10797 states, 7603 states have (on average 1.2593713008023149) internal successors, (9575), 7799 states have internal predecessors, (9575), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:47:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10797 states to 10797 states and 14729 transitions. [2022-07-14 04:47:17,612 INFO L78 Accepts]: Start accepts. Automaton has 10797 states and 14729 transitions. Word has length 138 [2022-07-14 04:47:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:17,612 INFO L495 AbstractCegarLoop]: Abstraction has 10797 states and 14729 transitions. [2022-07-14 04:47:17,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:47:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 10797 states and 14729 transitions. [2022-07-14 04:47:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-14 04:47:17,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:17,614 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:17,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:47:17,614 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:47:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash -965668694, now seen corresponding path program 1 times [2022-07-14 04:47:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:17,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213615368] [2022-07-14 04:47:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:17,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:47:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:47:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:47:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:47:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:47:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:47:17,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:17,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213615368] [2022-07-14 04:47:17,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213615368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:17,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:17,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:17,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909627346] [2022-07-14 04:47:17,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:17,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:17,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:17,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:17,950 INFO L87 Difference]: Start difference. First operand 10797 states and 14729 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:47:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:24,046 INFO L93 Difference]: Finished difference Result 10797 states and 14729 transitions. [2022-07-14 04:47:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:24,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2022-07-14 04:47:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:24,073 INFO L225 Difference]: With dead ends: 10797 [2022-07-14 04:47:24,073 INFO L226 Difference]: Without dead ends: 10795 [2022-07-14 04:47:24,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:24,078 INFO L413 NwaCegarLoop]: 3785 mSDtfsCounter, 6316 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3936 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6615 SdHoareTripleChecker+Valid, 7260 SdHoareTripleChecker+Invalid, 7206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:24,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6615 Valid, 7260 Invalid, 7206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3936 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-14 04:47:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2022-07-14 04:47:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 10795. [2022-07-14 04:47:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10795 states, 7602 states have (on average 1.2592738752959747) internal successors, (9573), 7797 states have internal predecessors, (9573), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:47:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10795 states to 10795 states and 14727 transitions. [2022-07-14 04:47:24,547 INFO L78 Accepts]: Start accepts. Automaton has 10795 states and 14727 transitions. Word has length 144 [2022-07-14 04:47:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:24,547 INFO L495 AbstractCegarLoop]: Abstraction has 10795 states and 14727 transitions. [2022-07-14 04:47:24,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:47:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 10795 states and 14727 transitions. [2022-07-14 04:47:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-14 04:47:24,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:24,549 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:24,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:47:24,549 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:47:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -466485909, now seen corresponding path program 1 times [2022-07-14 04:47:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:24,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993258371] [2022-07-14 04:47:24,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:47:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:47:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:47:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:47:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:47:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:47:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:47:24,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:24,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993258371] [2022-07-14 04:47:24,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993258371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:24,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:24,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:24,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892103399] [2022-07-14 04:47:24,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:24,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:24,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:24,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:24,876 INFO L87 Difference]: Start difference. First operand 10795 states and 14727 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 04:47:27,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:32,487 INFO L93 Difference]: Finished difference Result 10795 states and 14727 transitions. [2022-07-14 04:47:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:32,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2022-07-14 04:47:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:32,516 INFO L225 Difference]: With dead ends: 10795 [2022-07-14 04:47:32,516 INFO L226 Difference]: Without dead ends: 10793 [2022-07-14 04:47:32,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:32,522 INFO L413 NwaCegarLoop]: 3783 mSDtfsCounter, 6310 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3934 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6608 SdHoareTripleChecker+Valid, 7258 SdHoareTripleChecker+Invalid, 7204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:32,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6608 Valid, 7258 Invalid, 7204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3934 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-14 04:47:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10793 states. [2022-07-14 04:47:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10793 to 10793. [2022-07-14 04:47:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10793 states, 7601 states have (on average 1.2591764241547165) internal successors, (9571), 7795 states have internal predecessors, (9571), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:47:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10793 states to 10793 states and 14725 transitions. [2022-07-14 04:47:32,931 INFO L78 Accepts]: Start accepts. Automaton has 10793 states and 14725 transitions. Word has length 150 [2022-07-14 04:47:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:32,931 INFO L495 AbstractCegarLoop]: Abstraction has 10793 states and 14725 transitions. [2022-07-14 04:47:32,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 04:47:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 10793 states and 14725 transitions. [2022-07-14 04:47:32,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-14 04:47:32,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:32,933 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:32,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:47:32,933 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:47:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1386346816, now seen corresponding path program 1 times [2022-07-14 04:47:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:32,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295645881] [2022-07-14 04:47:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:47:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:47:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:47:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:47:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:47:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:47:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:47:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:47:33,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:33,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295645881] [2022-07-14 04:47:33,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295645881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:33,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:33,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219597584] [2022-07-14 04:47:33,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:33,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:33,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:33,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:33,222 INFO L87 Difference]: Start difference. First operand 10793 states and 14725 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 04:47:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:39,278 INFO L93 Difference]: Finished difference Result 10793 states and 14725 transitions. [2022-07-14 04:47:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:39,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-07-14 04:47:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:39,318 INFO L225 Difference]: With dead ends: 10793 [2022-07-14 04:47:39,318 INFO L226 Difference]: Without dead ends: 10791 [2022-07-14 04:47:39,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:39,326 INFO L413 NwaCegarLoop]: 3781 mSDtfsCounter, 6304 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3932 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6601 SdHoareTripleChecker+Valid, 7256 SdHoareTripleChecker+Invalid, 7202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:39,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6601 Valid, 7256 Invalid, 7202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3932 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-14 04:47:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10791 states. [2022-07-14 04:47:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10791 to 10791. [2022-07-14 04:47:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10791 states, 7600 states have (on average 1.259078947368421) internal successors, (9569), 7793 states have internal predecessors, (9569), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:47:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10791 states to 10791 states and 14723 transitions. [2022-07-14 04:47:39,832 INFO L78 Accepts]: Start accepts. Automaton has 10791 states and 14723 transitions. Word has length 156 [2022-07-14 04:47:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:39,832 INFO L495 AbstractCegarLoop]: Abstraction has 10791 states and 14723 transitions. [2022-07-14 04:47:39,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 04:47:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 10791 states and 14723 transitions. [2022-07-14 04:47:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 04:47:39,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:39,835 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:39,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:47:39,835 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:47:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash 603439633, now seen corresponding path program 1 times [2022-07-14 04:47:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:39,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706236298] [2022-07-14 04:47:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:47:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:47:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:47:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:47:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:47:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:47:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:47:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:47:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:47:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706236298] [2022-07-14 04:47:40,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706236298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:40,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:40,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937403384] [2022-07-14 04:47:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:40,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:40,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:40,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:40,125 INFO L87 Difference]: Start difference. First operand 10791 states and 14723 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:47:42,103 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 [] [2022-07-14 04:47:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:47,438 INFO L93 Difference]: Finished difference Result 10791 states and 14723 transitions. [2022-07-14 04:47:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2022-07-14 04:47:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:47,472 INFO L225 Difference]: With dead ends: 10791 [2022-07-14 04:47:47,472 INFO L226 Difference]: Without dead ends: 10789 [2022-07-14 04:47:47,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:47,479 INFO L413 NwaCegarLoop]: 3779 mSDtfsCounter, 6298 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3930 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6594 SdHoareTripleChecker+Valid, 7254 SdHoareTripleChecker+Invalid, 7200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:47,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6594 Valid, 7254 Invalid, 7200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3930 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-14 04:47:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10789 states. [2022-07-14 04:47:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10789 to 10789. [2022-07-14 04:47:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10789 states, 7599 states have (on average 1.258981444926964) internal successors, (9567), 7791 states have internal predecessors, (9567), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:47:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 14721 transitions. [2022-07-14 04:47:47,957 INFO L78 Accepts]: Start accepts. Automaton has 10789 states and 14721 transitions. Word has length 162 [2022-07-14 04:47:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:47,957 INFO L495 AbstractCegarLoop]: Abstraction has 10789 states and 14721 transitions. [2022-07-14 04:47:47,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:47:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10789 states and 14721 transitions. [2022-07-14 04:47:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-14 04:47:47,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:47,960 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:47,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:47:47,960 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:47:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash -956161991, now seen corresponding path program 1 times [2022-07-14 04:47:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:47,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243882709] [2022-07-14 04:47:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:47:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:47:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:47:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:47:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:47:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 04:47:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:47:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 04:47:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-14 04:47:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:47:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243882709] [2022-07-14 04:47:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243882709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:48,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:48,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934765371] [2022-07-14 04:47:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:48,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:48,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:48,280 INFO L87 Difference]: Start difference. First operand 10789 states and 14721 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 04:47:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:54,726 INFO L93 Difference]: Finished difference Result 10789 states and 14721 transitions. [2022-07-14 04:47:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:54,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2022-07-14 04:47:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:54,757 INFO L225 Difference]: With dead ends: 10789 [2022-07-14 04:47:54,757 INFO L226 Difference]: Without dead ends: 10787 [2022-07-14 04:47:54,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:54,764 INFO L413 NwaCegarLoop]: 3777 mSDtfsCounter, 6292 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 3270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6587 SdHoareTripleChecker+Valid, 7252 SdHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3270 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:54,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6587 Valid, 7252 Invalid, 7198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3270 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-14 04:47:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10787 states. [2022-07-14 04:47:55,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10787 to 10787. [2022-07-14 04:47:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10787 states, 7598 states have (on average 1.258883916820216) internal successors, (9565), 7789 states have internal predecessors, (9565), 2566 states have call successors, (2566), 609 states have call predecessors, (2566), 613 states have return successors, (2588), 2505 states have call predecessors, (2588), 2564 states have call successors, (2588) [2022-07-14 04:47:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10787 states to 10787 states and 14719 transitions. [2022-07-14 04:47:55,221 INFO L78 Accepts]: Start accepts. Automaton has 10787 states and 14719 transitions. Word has length 168 [2022-07-14 04:47:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:55,221 INFO L495 AbstractCegarLoop]: Abstraction has 10787 states and 14719 transitions. [2022-07-14 04:47:55,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 04:47:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states and 14719 transitions. [2022-07-14 04:47:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-14 04:47:55,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:55,224 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:55,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:47:55,225 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:47:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:55,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2017162721, now seen corresponding path program 1 times [2022-07-14 04:47:55,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:55,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543309808] [2022-07-14 04:47:55,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:55,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:47:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:47:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:47:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:47:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:47:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:47:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:47:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:47:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 04:47:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:47:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 04:47:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:47:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 04:47:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-14 04:47:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:55,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543309808] [2022-07-14 04:47:55,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543309808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:55,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:55,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 04:47:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563757814] [2022-07-14 04:47:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:55,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 04:47:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 04:47:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:47:55,740 INFO L87 Difference]: Start difference. First operand 10787 states and 14719 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-14 04:48:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:48:21,617 INFO L93 Difference]: Finished difference Result 22801 states and 32626 transitions. [2022-07-14 04:48:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:48:21,618 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 192 [2022-07-14 04:48:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:48:21,674 INFO L225 Difference]: With dead ends: 22801 [2022-07-14 04:48:21,674 INFO L226 Difference]: Without dead ends: 17281 [2022-07-14 04:48:21,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-07-14 04:48:21,702 INFO L413 NwaCegarLoop]: 5293 mSDtfsCounter, 8904 mSDsluCounter, 19353 mSDsCounter, 0 mSdLazyCounter, 24375 mSolverCounterSat, 7067 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9239 SdHoareTripleChecker+Valid, 24646 SdHoareTripleChecker+Invalid, 31442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7067 IncrementalHoareTripleChecker+Valid, 24375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:48:21,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9239 Valid, 24646 Invalid, 31442 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7067 Valid, 24375 Invalid, 0 Unknown, 0 Unchecked, 24.4s Time] [2022-07-14 04:48:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17281 states. [2022-07-14 04:48:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17281 to 10846. [2022-07-14 04:48:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10846 states, 7642 states have (on average 1.2589636220884586) internal successors, (9621), 7836 states have internal predecessors, (9621), 2573 states have call successors, (2573), 609 states have call predecessors, (2573), 621 states have return successors, (2677), 2517 states have call predecessors, (2677), 2571 states have call successors, (2677) [2022-07-14 04:48:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10846 states to 10846 states and 14871 transitions. [2022-07-14 04:48:22,402 INFO L78 Accepts]: Start accepts. Automaton has 10846 states and 14871 transitions. Word has length 192 [2022-07-14 04:48:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:48:22,403 INFO L495 AbstractCegarLoop]: Abstraction has 10846 states and 14871 transitions. [2022-07-14 04:48:22,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 6 states have internal predecessors, (90), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-14 04:48:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 10846 states and 14871 transitions. [2022-07-14 04:48:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-14 04:48:22,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:48:22,407 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:48:22,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:48:22,407 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-14 04:48:22,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:48:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash -646737710, now seen corresponding path program 1 times [2022-07-14 04:48:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:48:22,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314713595] [2022-07-14 04:48:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:48:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:48:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:48:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:48:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:48:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:48:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:48:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:48:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:48:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:48:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:48:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:48:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:48:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:48:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:48:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 04:48:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 04:48:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:48:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 04:48:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 04:48:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 04:48:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 04:48:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-14 04:48:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-14 04:48:22,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:48:22,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314713595] [2022-07-14 04:48:22,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314713595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:48:22,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:48:22,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 04:48:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324393339] [2022-07-14 04:48:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:48:22,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 04:48:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:48:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 04:48:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:48:22,847 INFO L87 Difference]: Start difference. First operand 10846 states and 14871 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-14 04:48:26,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:48:28,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:48:30,104 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 [] [2022-07-14 04:48:32,133 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 []