./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--ethoc.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--ethoc.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 4c876950d5c00e8640720d61b331acdf557de17a26b73c3a1c23616adb1922b3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:44:24,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:44:24,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:44:24,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:44:24,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:44:24,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:44:24,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:44:24,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:44:24,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:44:24,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:44:24,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:44:24,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:44:24,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:44:24,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:44:24,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:44:24,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:44:24,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:44:24,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:44:24,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:44:24,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:44:24,142 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:44:24,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:44:24,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:44:24,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:44:24,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:44:24,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:44:24,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:44:24,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:44:24,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:44:24,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:44:24,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:44:24,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:44:24,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:44:24,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:44:24,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:44:24,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:44:24,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:44:24,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:44:24,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:44:24,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:44:24,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:44:24,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:44:24,169 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:44:24,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:44:24,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:44:24,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:44:24,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:44:24,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:44:24,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:44:24,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:44:24,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:44:24,206 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:44:24,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:44:24,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:44:24,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:44:24,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:44:24,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:44:24,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:44:24,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:44:24,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:44:24,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:44:24,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:44:24,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:44:24,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:44:24,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:44:24,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:44:24,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:44:24,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:44:24,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:44:24,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:44:24,210 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:44:24,210 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:44:24,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:44:24,211 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 -> 4c876950d5c00e8640720d61b331acdf557de17a26b73c3a1c23616adb1922b3 [2022-07-14 04:44:24,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:44:24,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:44:24,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:44:24,454 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:44:24,455 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:44:24,456 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--ethoc.ko.cil.i [2022-07-14 04:44:24,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9551526/1c5d83351e9b4df5a292c9654a79df24/FLAGc56830c14 [2022-07-14 04:44:25,261 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:44:25,262 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--ethoc.ko.cil.i [2022-07-14 04:44:25,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9551526/1c5d83351e9b4df5a292c9654a79df24/FLAGc56830c14 [2022-07-14 04:44:25,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e9551526/1c5d83351e9b4df5a292c9654a79df24 [2022-07-14 04:44:25,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:44:25,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:44:25,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:44:25,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:44:25,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:44:25,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:44:25" (1/1) ... [2022-07-14 04:44:25,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6817d45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:25, skipping insertion in model container [2022-07-14 04:44:25,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:44:25" (1/1) ... [2022-07-14 04:44:25,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:44:25,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:44:29,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[379831,379844] [2022-07-14 04:44:29,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[379976,379989] [2022-07-14 04:44:29,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[380122,380135] [2022-07-14 04:44:29,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380287,380300] [2022-07-14 04:44:29,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380445,380458] [2022-07-14 04:44:29,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380603,380616] [2022-07-14 04:44:29,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[380761,380774] [2022-07-14 04:44:29,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[380921,380934] [2022-07-14 04:44:29,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[381080,381093] [2022-07-14 04:44:29,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381219,381232] [2022-07-14 04:44:29,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381361,381374] [2022-07-14 04:44:29,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381510,381523] [2022-07-14 04:44:29,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381649,381662] [2022-07-14 04:44:29,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381804,381817] [2022-07-14 04:44:29,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381964,381977] [2022-07-14 04:44:29,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[382115,382128] [2022-07-14 04:44:29,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[382266,382279] [2022-07-14 04:44:29,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[382418,382431] [2022-07-14 04:44:29,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[382567,382580] [2022-07-14 04:44:29,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[382715,382728] [2022-07-14 04:44:29,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[382872,382885] [2022-07-14 04:44:29,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[383021,383034] [2022-07-14 04:44:29,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[383177,383190] [2022-07-14 04:44:29,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[383330,383343] [2022-07-14 04:44:29,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[383476,383489] [2022-07-14 04:44:29,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[383619,383632] [2022-07-14 04:44:29,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[383771,383784] [2022-07-14 04:44:29,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[383917,383930] [2022-07-14 04:44:29,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[384062,384075] [2022-07-14 04:44:29,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[384216,384229] [2022-07-14 04:44:29,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[384367,384380] [2022-07-14 04:44:29,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[384522,384535] [2022-07-14 04:44:29,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[384674,384687] [2022-07-14 04:44:29,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[384829,384842] [2022-07-14 04:44:29,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[384993,385006] [2022-07-14 04:44:29,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[385149,385162] [2022-07-14 04:44:29,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[385313,385326] [2022-07-14 04:44:29,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[385455,385468] [2022-07-14 04:44:29,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[385613,385626] [2022-07-14 04:44:29,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[385780,385793] [2022-07-14 04:44:29,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[385939,385952] [2022-07-14 04:44:29,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[386098,386111] [2022-07-14 04:44:29,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[386247,386260] [2022-07-14 04:44:29,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[386394,386407] [2022-07-14 04:44:29,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[386533,386546] [2022-07-14 04:44:29,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[386696,386709] [2022-07-14 04:44:29,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[386862,386875] [2022-07-14 04:44:29,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[387026,387039] [2022-07-14 04:44:29,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[387191,387204] [2022-07-14 04:44:29,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[387356,387369] [2022-07-14 04:44:29,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[387522,387535] [2022-07-14 04:44:29,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[387687,387700] [2022-07-14 04:44:29,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[387854,387867] [2022-07-14 04:44:29,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[388014,388027] [2022-07-14 04:44:29,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[388176,388189] [2022-07-14 04:44:29,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[388335,388348] [2022-07-14 04:44:29,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[388481,388494] [2022-07-14 04:44:29,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[388624,388637] [2022-07-14 04:44:29,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[388768,388781] [2022-07-14 04:44:29,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[388911,388924] [2022-07-14 04:44:29,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[389055,389068] [2022-07-14 04:44:29,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[389196,389209] [2022-07-14 04:44:29,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[389334,389347] [2022-07-14 04:44:29,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[389492,389505] [2022-07-14 04:44:29,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[389651,389664] [2022-07-14 04:44:29,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[389807,389820] [2022-07-14 04:44:29,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[389956,389969] [2022-07-14 04:44:29,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390108,390121] [2022-07-14 04:44:29,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390259,390272] [2022-07-14 04:44:29,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390408,390421] [2022-07-14 04:44:29,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390560,390573] [2022-07-14 04:44:29,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390708,390721] [2022-07-14 04:44:29,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390861,390874] [2022-07-14 04:44:29,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391012,391025] [2022-07-14 04:44:29,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391162,391175] [2022-07-14 04:44:29,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391309,391322] [2022-07-14 04:44:29,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391460,391473] [2022-07-14 04:44:29,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391611,391624] [2022-07-14 04:44:29,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391759,391772] [2022-07-14 04:44:29,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391925,391938] [2022-07-14 04:44:29,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392094,392107] [2022-07-14 04:44:29,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392261,392274] [2022-07-14 04:44:29,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392429,392442] [2022-07-14 04:44:29,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392579,392592] [2022-07-14 04:44:29,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392726,392739] [2022-07-14 04:44:29,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392887,392900] [2022-07-14 04:44:29,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[393057,393070] [2022-07-14 04:44:29,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[393219,393232] [2022-07-14 04:44:29,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:44:29,143 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:44:29,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[379831,379844] [2022-07-14 04:44:29,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[379976,379989] [2022-07-14 04:44:29,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380122,380135] [2022-07-14 04:44:29,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380287,380300] [2022-07-14 04:44:29,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380445,380458] [2022-07-14 04:44:29,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380603,380616] [2022-07-14 04:44:29,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380761,380774] [2022-07-14 04:44:29,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[380921,380934] [2022-07-14 04:44:29,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381080,381093] [2022-07-14 04:44:29,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381219,381232] [2022-07-14 04:44:29,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381361,381374] [2022-07-14 04:44:29,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381510,381523] [2022-07-14 04:44:29,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381649,381662] [2022-07-14 04:44:29,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381804,381817] [2022-07-14 04:44:29,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[381964,381977] [2022-07-14 04:44:29,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[382115,382128] [2022-07-14 04:44:29,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[382266,382279] [2022-07-14 04:44:29,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[382418,382431] [2022-07-14 04:44:29,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[382567,382580] [2022-07-14 04:44:29,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[382715,382728] [2022-07-14 04:44:29,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[382872,382885] [2022-07-14 04:44:29,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[383021,383034] [2022-07-14 04:44:29,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[383177,383190] [2022-07-14 04:44:29,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[383330,383343] [2022-07-14 04:44:29,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[383476,383489] [2022-07-14 04:44:29,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[383619,383632] [2022-07-14 04:44:29,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[383771,383784] [2022-07-14 04:44:29,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[383917,383930] [2022-07-14 04:44:29,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[384062,384075] [2022-07-14 04:44:29,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[384216,384229] [2022-07-14 04:44:29,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[384367,384380] [2022-07-14 04:44:29,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[384522,384535] [2022-07-14 04:44:29,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[384674,384687] [2022-07-14 04:44:29,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[384829,384842] [2022-07-14 04:44:29,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[384993,385006] [2022-07-14 04:44:29,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[385149,385162] [2022-07-14 04:44:29,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[385313,385326] [2022-07-14 04:44:29,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[385455,385468] [2022-07-14 04:44:29,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[385613,385626] [2022-07-14 04:44:29,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[385780,385793] [2022-07-14 04:44:29,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[385939,385952] [2022-07-14 04:44:29,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[386098,386111] [2022-07-14 04:44:29,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[386247,386260] [2022-07-14 04:44:29,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[386394,386407] [2022-07-14 04:44:29,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[386533,386546] [2022-07-14 04:44:29,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[386696,386709] [2022-07-14 04:44:29,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[386862,386875] [2022-07-14 04:44:29,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[387026,387039] [2022-07-14 04:44:29,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[387191,387204] [2022-07-14 04:44:29,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[387356,387369] [2022-07-14 04:44:29,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[387522,387535] [2022-07-14 04:44:29,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[387687,387700] [2022-07-14 04:44:29,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[387854,387867] [2022-07-14 04:44:29,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[388014,388027] [2022-07-14 04:44:29,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[388176,388189] [2022-07-14 04:44:29,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[388335,388348] [2022-07-14 04:44:29,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[388481,388494] [2022-07-14 04:44:29,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[388624,388637] [2022-07-14 04:44:29,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[388768,388781] [2022-07-14 04:44:29,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[388911,388924] [2022-07-14 04:44:29,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[389055,389068] [2022-07-14 04:44:29,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[389196,389209] [2022-07-14 04:44:29,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[389334,389347] [2022-07-14 04:44:29,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[389492,389505] [2022-07-14 04:44:29,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[389651,389664] [2022-07-14 04:44:29,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[389807,389820] [2022-07-14 04:44:29,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[389956,389969] [2022-07-14 04:44:29,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[390108,390121] [2022-07-14 04:44:29,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390259,390272] [2022-07-14 04:44:29,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390408,390421] [2022-07-14 04:44:29,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390560,390573] [2022-07-14 04:44:29,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--ethoc.ko.cil.i[390708,390721] [2022-07-14 04:44:29,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[390861,390874] [2022-07-14 04:44:29,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391012,391025] [2022-07-14 04:44:29,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391162,391175] [2022-07-14 04:44:29,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391309,391322] [2022-07-14 04:44:29,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391460,391473] [2022-07-14 04:44:29,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391611,391624] [2022-07-14 04:44:29,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391759,391772] [2022-07-14 04:44:29,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[391925,391938] [2022-07-14 04:44:29,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392094,392107] [2022-07-14 04:44:29,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392261,392274] [2022-07-14 04:44:29,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392429,392442] [2022-07-14 04:44:29,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392579,392592] [2022-07-14 04:44:29,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392726,392739] [2022-07-14 04:44:29,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[392887,392900] [2022-07-14 04:44:29,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[393057,393070] [2022-07-14 04:44:29,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i[393219,393232] [2022-07-14 04:44:29,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:44:29,651 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:44:29,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29 WrapperNode [2022-07-14 04:44:29,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:44:29,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:44:29,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:44:29,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:44:29,658 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:44:29" (1/1) ... [2022-07-14 04:44:29,742 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:44:29" (1/1) ... [2022-07-14 04:44:29,862 INFO L137 Inliner]: procedures = 660, calls = 1827, calls flagged for inlining = 326, calls inlined = 232, statements flattened = 3930 [2022-07-14 04:44:29,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:44:29,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:44:29,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:44:29,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:44:29,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (1/1) ... [2022-07-14 04:44:29,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (1/1) ... [2022-07-14 04:44:29,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (1/1) ... [2022-07-14 04:44:29,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (1/1) ... [2022-07-14 04:44:29,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (1/1) ... [2022-07-14 04:44:29,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (1/1) ... [2022-07-14 04:44:29,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (1/1) ... [2022-07-14 04:44:30,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:44:30,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:44:30,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:44:30,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:44:30,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (1/1) ... [2022-07-14 04:44:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:44:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:44:30,038 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:44:30,053 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:44:30,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:44:30,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:44:30,075 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_read_bd [2022-07-14 04:44:30,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_read_bd [2022-07-14 04:44:30,075 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-14 04:44:30,075 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-14 04:44:30,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:44:30,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:44:30,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:44:30,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:44:30,076 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_mdio_poll [2022-07-14 04:44:30,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_mdio_poll [2022-07-14 04:44:30,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:44:30,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:44:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure netif_napi_del [2022-07-14 04:44:30,077 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_napi_del [2022-07-14 04:44:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 04:44:30,077 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 04:44:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:44:30,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:44:30,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:44:30,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:44:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:44:30,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:44:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-07-14 04:44:30,079 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-07-14 04:44:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:44:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:44:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:44:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:44:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-14 04:44:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-14 04:44:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:44:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_get_regs_len [2022-07-14 04:44:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_get_regs_len [2022-07-14 04:44:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_read [2022-07-14 04:44:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_read [2022-07-14 04:44:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-14 04:44:30,081 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-14 04:44:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_do_set_mac_address [2022-07-14 04:44:30,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_do_set_mac_address [2022-07-14 04:44:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_init_ring [2022-07-14 04:44:30,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_init_ring [2022-07-14 04:44:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure devm_ioremap_nocache [2022-07-14 04:44:30,081 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_ioremap_nocache [2022-07-14 04:44:30,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:44:30,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:44:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 04:44:30,082 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 04:44:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure __rounddown_pow_of_two [2022-07-14 04:44:30,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __rounddown_pow_of_two [2022-07-14 04:44:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure clk_unprepare [2022-07-14 04:44:30,082 INFO L138 BoogieDeclarations]: Found implementation of procedure clk_unprepare [2022-07-14 04:44:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:44:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:44:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:44:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:44:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:44:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:44:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:44:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:44:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:44:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:44:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:44:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-14 04:44:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-14 04:44:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:44:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:44:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:44:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:44:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_interrupt [2022-07-14 04:44:30,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_interrupt [2022-07-14 04:44:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:44:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:44:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:44:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:44:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:44:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:44:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_probe [2022-07-14 04:44:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_probe [2022-07-14 04:44:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:44:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure __devm_request_region [2022-07-14 04:44:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __devm_request_region [2022-07-14 04:44:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_resume [2022-07-14 04:44:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_resume [2022-07-14 04:44:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure __bitrev8 [2022-07-14 04:44:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure __bitrev8 [2022-07-14 04:44:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:44:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-14 04:44:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-14 04:44:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_write_bd [2022-07-14 04:44:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_write_bd [2022-07-14 04:44:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:44:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:44:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:44:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-14 04:44:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_write [2022-07-14 04:44:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_write [2022-07-14 04:44:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:44:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:44:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:44:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:44:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:44:30,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:44:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-14 04:44:30,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-14 04:44:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_remove [2022-07-14 04:44:30,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_remove [2022-07-14 04:44:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_tx_timeout [2022-07-14 04:44:30,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_tx_timeout [2022-07-14 04:44:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_free [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_free [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_unregister [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_unregister [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_stop [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_stop [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_ack_irq [2022-07-14 04:44:30,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_ack_irq [2022-07-14 04:44:30,133 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_disable_rx_and_tx [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_disable_rx_and_tx [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_enable_rx_and_tx [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_enable_rx_and_tx [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure clk_disable_unprepare [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure clk_disable_unprepare [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:44:30,134 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:44:30,134 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure __bitrev16 [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __bitrev16 [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_stop_queue [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_stop_queue [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_enable_irq [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_enable_irq [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_open [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_open [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure ethoc_disable_irq [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ethoc_disable_irq [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:44:30,135 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-14 04:44:30,135 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-14 04:44:30,744 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:44:30,746 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:44:30,789 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:44:44,554 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:44:44,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:44:44,572 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-14 04:44:44,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:44:44 BoogieIcfgContainer [2022-07-14 04:44:44,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:44:44,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:44:44,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:44:44,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:44:44,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:44:25" (1/3) ... [2022-07-14 04:44:44,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131c64a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:44:44, skipping insertion in model container [2022-07-14 04:44:44,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:44:29" (2/3) ... [2022-07-14 04:44:44,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131c64a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:44:44, skipping insertion in model container [2022-07-14 04:44:44,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:44:44" (3/3) ... [2022-07-14 04:44:44,587 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--ethoc.ko.cil.i [2022-07-14 04:44:44,599 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:44:44,599 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-14 04:44:44,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:44:44,693 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@1e0e55a1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@468da8c1 [2022-07-14 04:44:44,694 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-14 04:44:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 1443 states, 1016 states have (on average 1.3051181102362204) internal successors, (1326), 1064 states have internal predecessors, (1326), 315 states have call successors, (315), 85 states have call predecessors, (315), 84 states have return successors, (309), 307 states have call predecessors, (309), 309 states have call successors, (309) [2022-07-14 04:44:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 04:44:44,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:44:44,720 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:44:44,721 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:44:44,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:44:44,728 INFO L85 PathProgramCache]: Analyzing trace with hash 136173705, now seen corresponding path program 1 times [2022-07-14 04:44:44,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:44:44,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690876691] [2022-07-14 04:44:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:44:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:44:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:44:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:44:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:44:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:44:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:44:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:44:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:44:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:44:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:44:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:44:45,653 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:44:45,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:44:45,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690876691] [2022-07-14 04:44:45,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690876691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:44:45,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:44:45,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:44:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162991029] [2022-07-14 04:44:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:44:45,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:44:45,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:44:45,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:44:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:44:45,687 INFO L87 Difference]: Start difference. First operand has 1443 states, 1016 states have (on average 1.3051181102362204) internal successors, (1326), 1064 states have internal predecessors, (1326), 315 states have call successors, (315), 85 states have call predecessors, (315), 84 states have return successors, (309), 307 states have call predecessors, (309), 309 states have call successors, (309) 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:44:47,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:44:49,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:00,571 INFO L93 Difference]: Finished difference Result 3094 states and 4315 transitions. [2022-07-14 04:45:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:00,573 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:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:00,599 INFO L225 Difference]: With dead ends: 3094 [2022-07-14 04:45:00,600 INFO L226 Difference]: Without dead ends: 1661 [2022-07-14 04:45:00,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:00,613 INFO L413 NwaCegarLoop]: 1702 mSDtfsCounter, 3646 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 1736 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3757 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 4172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1736 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:00,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3757 Valid, 2463 Invalid, 4172 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1736 Valid, 2434 Invalid, 2 Unknown, 0 Unchecked, 14.2s Time] [2022-07-14 04:45:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2022-07-14 04:45:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1401. [2022-07-14 04:45:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 983 states have (on average 1.2238046795523907) internal successors, (1203), 1026 states have internal predecessors, (1203), 309 states have call successors, (309), 84 states have call predecessors, (309), 83 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2022-07-14 04:45:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1819 transitions. [2022-07-14 04:45:00,734 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1819 transitions. Word has length 64 [2022-07-14 04:45:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:00,735 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1819 transitions. [2022-07-14 04:45:00,735 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:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1819 transitions. [2022-07-14 04:45:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 04:45:00,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:00,737 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:00,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:45:00,738 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:45:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:00,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2060594057, now seen corresponding path program 1 times [2022-07-14 04:45:00,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:00,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076734863] [2022-07-14 04:45:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:01,181 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:01,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:01,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076734863] [2022-07-14 04:45:01,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076734863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:01,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:01,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:01,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497340668] [2022-07-14 04:45:01,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:01,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:01,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:01,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:01,184 INFO L87 Difference]: Start difference. First operand 1401 states and 1819 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:03,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:05,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:16,103 INFO L93 Difference]: Finished difference Result 1661 states and 2207 transitions. [2022-07-14 04:45:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:16,103 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:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:16,110 INFO L225 Difference]: With dead ends: 1661 [2022-07-14 04:45:16,111 INFO L226 Difference]: Without dead ends: 1659 [2022-07-14 04:45:16,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:16,113 INFO L413 NwaCegarLoop]: 1727 mSDtfsCounter, 3521 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 1708 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3629 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 4174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1708 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:16,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3629 Valid, 2468 Invalid, 4174 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1708 Valid, 2464 Invalid, 2 Unknown, 0 Unchecked, 14.3s Time] [2022-07-14 04:45:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2022-07-14 04:45:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1399. [2022-07-14 04:45:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 982 states have (on average 1.2230142566191446) internal successors, (1201), 1024 states have internal predecessors, (1201), 309 states have call successors, (309), 84 states have call predecessors, (309), 83 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2022-07-14 04:45:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1817 transitions. [2022-07-14 04:45:16,177 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1817 transitions. Word has length 70 [2022-07-14 04:45:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:16,179 INFO L495 AbstractCegarLoop]: Abstraction has 1399 states and 1817 transitions. [2022-07-14 04:45:16,180 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:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1817 transitions. [2022-07-14 04:45:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 04:45:16,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:16,188 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:16,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:45:16,189 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:45:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1622933905, now seen corresponding path program 1 times [2022-07-14 04:45:16,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:16,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016514599] [2022-07-14 04:45:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:16,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:16,620 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:16,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:16,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016514599] [2022-07-14 04:45:16,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016514599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:16,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:16,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14146076] [2022-07-14 04:45:16,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:16,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:16,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:16,624 INFO L87 Difference]: Start difference. First operand 1399 states and 1817 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:18,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:20,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:31,512 INFO L93 Difference]: Finished difference Result 1659 states and 2205 transitions. [2022-07-14 04:45:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:31,513 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:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:31,521 INFO L225 Difference]: With dead ends: 1659 [2022-07-14 04:45:31,521 INFO L226 Difference]: Without dead ends: 1657 [2022-07-14 04:45:31,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:31,526 INFO L413 NwaCegarLoop]: 1655 mSDtfsCounter, 3629 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 1747 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3736 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 4141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1747 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:31,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3736 Valid, 2396 Invalid, 4141 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1747 Valid, 2392 Invalid, 2 Unknown, 0 Unchecked, 14.4s Time] [2022-07-14 04:45:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-07-14 04:45:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1397. [2022-07-14 04:45:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 981 states have (on average 1.2222222222222223) internal successors, (1199), 1022 states have internal predecessors, (1199), 309 states have call successors, (309), 84 states have call predecessors, (309), 83 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2022-07-14 04:45:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1815 transitions. [2022-07-14 04:45:31,596 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1815 transitions. Word has length 76 [2022-07-14 04:45:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:31,597 INFO L495 AbstractCegarLoop]: Abstraction has 1397 states and 1815 transitions. [2022-07-14 04:45:31,598 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:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1815 transitions. [2022-07-14 04:45:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 04:45:31,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:31,600 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:31,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:45:31,601 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:45:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1511111317, now seen corresponding path program 1 times [2022-07-14 04:45:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:31,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489061455] [2022-07-14 04:45:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:31,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:31,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:32,039 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:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:32,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489061455] [2022-07-14 04:45:32,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489061455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:32,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:32,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672032345] [2022-07-14 04:45:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:32,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:32,042 INFO L87 Difference]: Start difference. First operand 1397 states and 1815 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:34,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:36,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:45:47,849 INFO L93 Difference]: Finished difference Result 1657 states and 2203 transitions. [2022-07-14 04:45:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:45:47,850 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:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:45:47,859 INFO L225 Difference]: With dead ends: 1657 [2022-07-14 04:45:47,859 INFO L226 Difference]: Without dead ends: 1655 [2022-07-14 04:45:47,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:45:47,862 INFO L413 NwaCegarLoop]: 1695 mSDtfsCounter, 3555 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 1723 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3661 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1723 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:45:47,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3661 Valid, 2436 Invalid, 4157 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1723 Valid, 2432 Invalid, 2 Unknown, 0 Unchecked, 15.3s Time] [2022-07-14 04:45:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2022-07-14 04:45:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1395. [2022-07-14 04:45:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 980 states have (on average 1.2214285714285715) internal successors, (1197), 1020 states have internal predecessors, (1197), 309 states have call successors, (309), 84 states have call predecessors, (309), 83 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2022-07-14 04:45:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1813 transitions. [2022-07-14 04:45:47,939 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1813 transitions. Word has length 82 [2022-07-14 04:45:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:45:47,940 INFO L495 AbstractCegarLoop]: Abstraction has 1395 states and 1813 transitions. [2022-07-14 04:45:47,940 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:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1813 transitions. [2022-07-14 04:45:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 04:45:47,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:45:47,942 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:47,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:45:47,942 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:45:47,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:45:47,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1648512030, now seen corresponding path program 1 times [2022-07-14 04:45:47,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:45:47,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791715959] [2022-07-14 04:45:47,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:45:47,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:45:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:45:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:45:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:45:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:45:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:45:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:45:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:45:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:45:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:45:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:45:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:45:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:45:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:45:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:45:48,533 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,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:45:48,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791715959] [2022-07-14 04:45:48,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791715959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:45:48,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:45:48,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:45:48,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476463610] [2022-07-14 04:45:48,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:45:48,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:45:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:45:48,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:45:48,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:45:48,535 INFO L87 Difference]: Start difference. First operand 1395 states and 1813 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:45:50,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:45:52,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:02,976 INFO L93 Difference]: Finished difference Result 1655 states and 2201 transitions. [2022-07-14 04:46:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:02,976 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:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:02,983 INFO L225 Difference]: With dead ends: 1655 [2022-07-14 04:46:02,984 INFO L226 Difference]: Without dead ends: 1653 [2022-07-14 04:46:02,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:02,986 INFO L413 NwaCegarLoop]: 1685 mSDtfsCounter, 3573 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 1711 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3678 SdHoareTripleChecker+Valid, 2426 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1711 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:02,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3678 Valid, 2426 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1711 Valid, 2422 Invalid, 2 Unknown, 0 Unchecked, 13.9s Time] [2022-07-14 04:46:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-07-14 04:46:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1393. [2022-07-14 04:46:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 979 states have (on average 1.2206332992849847) internal successors, (1195), 1018 states have internal predecessors, (1195), 309 states have call successors, (309), 84 states have call predecessors, (309), 83 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2022-07-14 04:46:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1811 transitions. [2022-07-14 04:46:03,038 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1811 transitions. Word has length 88 [2022-07-14 04:46:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:03,038 INFO L495 AbstractCegarLoop]: Abstraction has 1393 states and 1811 transitions. [2022-07-14 04:46:03,039 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:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1811 transitions. [2022-07-14 04:46:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 04:46:03,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:03,040 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:03,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:46:03,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:46:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1478399947, now seen corresponding path program 1 times [2022-07-14 04:46:03,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:03,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204304128] [2022-07-14 04:46:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:03,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:03,430 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:03,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:03,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204304128] [2022-07-14 04:46:03,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204304128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:03,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:03,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:03,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753440427] [2022-07-14 04:46:03,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:03,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:03,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:03,432 INFO L87 Difference]: Start difference. First operand 1393 states and 1811 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:05,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:07,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:19,010 INFO L93 Difference]: Finished difference Result 1653 states and 2199 transitions. [2022-07-14 04:46:19,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:19,010 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:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:19,017 INFO L225 Difference]: With dead ends: 1653 [2022-07-14 04:46:19,017 INFO L226 Difference]: Without dead ends: 1651 [2022-07-14 04:46:19,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:19,018 INFO L413 NwaCegarLoop]: 1719 mSDtfsCounter, 3499 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 1705 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3603 SdHoareTripleChecker+Valid, 2460 SdHoareTripleChecker+Invalid, 4163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1705 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:19,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3603 Valid, 2460 Invalid, 4163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1705 Valid, 2456 Invalid, 2 Unknown, 0 Unchecked, 15.1s Time] [2022-07-14 04:46:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2022-07-14 04:46:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1391. [2022-07-14 04:46:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 978 states have (on average 1.2198364008179958) internal successors, (1193), 1016 states have internal predecessors, (1193), 309 states have call successors, (309), 84 states have call predecessors, (309), 83 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2022-07-14 04:46:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1809 transitions. [2022-07-14 04:46:19,072 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1809 transitions. Word has length 94 [2022-07-14 04:46:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:19,072 INFO L495 AbstractCegarLoop]: Abstraction has 1391 states and 1809 transitions. [2022-07-14 04:46:19,072 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:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1809 transitions. [2022-07-14 04:46:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 04:46:19,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:19,073 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:19,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:46:19,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:46:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash -700697365, now seen corresponding path program 1 times [2022-07-14 04:46:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:19,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492057475] [2022-07-14 04:46:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:19,420 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:19,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:19,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492057475] [2022-07-14 04:46:19,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492057475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:19,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:19,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673715012] [2022-07-14 04:46:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:19,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:19,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:19,423 INFO L87 Difference]: Start difference. First operand 1391 states and 1809 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:21,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:23,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:34,337 INFO L93 Difference]: Finished difference Result 1651 states and 2197 transitions. [2022-07-14 04:46:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:34,337 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:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:34,343 INFO L225 Difference]: With dead ends: 1651 [2022-07-14 04:46:34,343 INFO L226 Difference]: Without dead ends: 1649 [2022-07-14 04:46:34,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:34,344 INFO L413 NwaCegarLoop]: 1753 mSDtfsCounter, 3443 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 1672 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3546 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 4164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1672 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:34,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3546 Valid, 2494 Invalid, 4164 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1672 Valid, 2490 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2022-07-14 04:46:34,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2022-07-14 04:46:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1389. [2022-07-14 04:46:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 977 states have (on average 1.2190378710337768) internal successors, (1191), 1014 states have internal predecessors, (1191), 309 states have call successors, (309), 84 states have call predecessors, (309), 83 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2022-07-14 04:46:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1807 transitions. [2022-07-14 04:46:34,396 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1807 transitions. Word has length 100 [2022-07-14 04:46:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:34,397 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1807 transitions. [2022-07-14 04:46:34,397 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:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1807 transitions. [2022-07-14 04:46:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 04:46:34,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:34,398 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:34,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:46:34,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:46:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1141859929, now seen corresponding path program 1 times [2022-07-14 04:46:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:34,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738219081] [2022-07-14 04:46:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:46:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:46:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:46:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:46:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:46:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:46:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:46:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:46:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:46:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:46:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:46:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:46:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:34,765 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:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:34,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738219081] [2022-07-14 04:46:34,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738219081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:34,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:34,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:46:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495269387] [2022-07-14 04:46:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:46:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:46:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:46:34,767 INFO L87 Difference]: Start difference. First operand 1389 states and 1807 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,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:38,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:46:49,333 INFO L93 Difference]: Finished difference Result 1649 states and 2195 transitions. [2022-07-14 04:46:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:46:49,333 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:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:46:49,339 INFO L225 Difference]: With dead ends: 1649 [2022-07-14 04:46:49,339 INFO L226 Difference]: Without dead ends: 1647 [2022-07-14 04:46:49,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:46:49,340 INFO L413 NwaCegarLoop]: 1648 mSDtfsCounter, 3607 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 1732 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3709 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 4115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1732 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:46:49,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3709 Valid, 2389 Invalid, 4115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1732 Valid, 2381 Invalid, 2 Unknown, 0 Unchecked, 14.1s Time] [2022-07-14 04:46:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2022-07-14 04:46:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1387. [2022-07-14 04:46:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 976 states have (on average 1.2182377049180328) internal successors, (1189), 1012 states have internal predecessors, (1189), 309 states have call successors, (309), 84 states have call predecessors, (309), 83 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2022-07-14 04:46:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1805 transitions. [2022-07-14 04:46:49,389 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1805 transitions. Word has length 106 [2022-07-14 04:46:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:46:49,390 INFO L495 AbstractCegarLoop]: Abstraction has 1387 states and 1805 transitions. [2022-07-14 04:46:49,390 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:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1805 transitions. [2022-07-14 04:46:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-14 04:46:49,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:46:49,391 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:46:49,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:46:49,391 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:46:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:46:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash 186850867, now seen corresponding path program 1 times [2022-07-14 04:46:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:46:49,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334715928] [2022-07-14 04:46:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:46:49,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:46:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:46:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:46:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:46:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:46:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:46:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:46:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:46:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:46:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:46:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:46:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:46:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:46:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:46:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:46:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-14 04:46:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:46:49,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334715928] [2022-07-14 04:46:49,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334715928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:46:49,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:46:49,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:46:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369977822] [2022-07-14 04:46:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:46:49,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:46:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:46:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:46:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:46:49,950 INFO L87 Difference]: Start difference. First operand 1387 states and 1805 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-14 04:46:51,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:46:54,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:16,140 INFO L93 Difference]: Finished difference Result 4305 states and 5786 transitions. [2022-07-14 04:47:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:47:16,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2022-07-14 04:47:16,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:16,156 INFO L225 Difference]: With dead ends: 4305 [2022-07-14 04:47:16,157 INFO L226 Difference]: Without dead ends: 2937 [2022-07-14 04:47:16,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-07-14 04:47:16,164 INFO L413 NwaCegarLoop]: 1808 mSDtfsCounter, 5590 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 4367 mSolverCounterSat, 3249 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5726 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 7618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3249 IncrementalHoareTripleChecker+Valid, 4367 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:16,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5726 Valid, 2652 Invalid, 7618 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3249 Valid, 4367 Invalid, 2 Unknown, 0 Unchecked, 24.9s Time] [2022-07-14 04:47:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2022-07-14 04:47:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 2776. [2022-07-14 04:47:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2776 states, 1994 states have (on average 1.2256770310932799) internal successors, (2444), 2050 states have internal predecessors, (2444), 617 states have call successors, (617), 145 states have call predecessors, (617), 146 states have return successors, (662), 611 states have call predecessors, (662), 615 states have call successors, (662) [2022-07-14 04:47:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3723 transitions. [2022-07-14 04:47:16,338 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3723 transitions. Word has length 116 [2022-07-14 04:47:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:16,338 INFO L495 AbstractCegarLoop]: Abstraction has 2776 states and 3723 transitions. [2022-07-14 04:47:16,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-14 04:47:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3723 transitions. [2022-07-14 04:47:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 04:47:16,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:16,340 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:47:16,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:47:16,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:47:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2110597494, now seen corresponding path program 1 times [2022-07-14 04:47:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:16,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334868012] [2022-07-14 04:47:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:16,748 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:16,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:16,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334868012] [2022-07-14 04:47:16,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334868012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:16,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:16,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066878189] [2022-07-14 04:47:16,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:16,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:16,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:16,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:16,751 INFO L87 Difference]: Start difference. First operand 2776 states and 3723 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:47:18,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:20,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:32,471 INFO L93 Difference]: Finished difference Result 2776 states and 3723 transitions. [2022-07-14 04:47:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:32,472 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:47:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:32,486 INFO L225 Difference]: With dead ends: 2776 [2022-07-14 04:47:32,487 INFO L226 Difference]: Without dead ends: 2774 [2022-07-14 04:47:32,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:32,489 INFO L413 NwaCegarLoop]: 1868 mSDtfsCounter, 3231 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2605 mSolverCounterSat, 1612 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 4219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1612 IncrementalHoareTripleChecker+Valid, 2605 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:32,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 2609 Invalid, 4219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1612 Valid, 2605 Invalid, 2 Unknown, 0 Unchecked, 15.2s Time] [2022-07-14 04:47:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-07-14 04:47:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2774. [2022-07-14 04:47:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 1993 states have (on average 1.2252885097842448) internal successors, (2442), 2048 states have internal predecessors, (2442), 617 states have call successors, (617), 145 states have call predecessors, (617), 146 states have return successors, (662), 611 states have call predecessors, (662), 615 states have call successors, (662) [2022-07-14 04:47:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3721 transitions. [2022-07-14 04:47:32,695 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3721 transitions. Word has length 108 [2022-07-14 04:47:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:32,696 INFO L495 AbstractCegarLoop]: Abstraction has 2774 states and 3721 transitions. [2022-07-14 04:47:32,696 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:47:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3721 transitions. [2022-07-14 04:47:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-14 04:47:32,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:32,699 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:47:32,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:47:32,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:47:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 305742498, now seen corresponding path program 1 times [2022-07-14 04:47:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:32,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57543856] [2022-07-14 04:47:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:33,028 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 22 [2022-07-14 04:47:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:47:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:47:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:47:33,140 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 65 [2022-07-14 04:47:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:47:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:47:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 04:47:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 04:47:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:47:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-14 04:47:33,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:33,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57543856] [2022-07-14 04:47:33,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57543856] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:47:33,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504931390] [2022-07-14 04:47:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:33,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:47:33,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:47:33,601 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:47:33,607 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:47:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:34,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 2559 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 04:47:34,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:47:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-14 04:47:35,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:47:35,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504931390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:35,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:47:35,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-14 04:47:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367706968] [2022-07-14 04:47:35,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:35,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:47:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:47:35,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:47:35,148 INFO L87 Difference]: Start difference. First operand 2774 states and 3721 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:47:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:35,362 INFO L93 Difference]: Finished difference Result 5525 states and 7410 transitions. [2022-07-14 04:47:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:47:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 122 [2022-07-14 04:47:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:35,380 INFO L225 Difference]: With dead ends: 5525 [2022-07-14 04:47:35,380 INFO L226 Difference]: Without dead ends: 2770 [2022-07-14 04:47:35,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:47:35,393 INFO L413 NwaCegarLoop]: 1797 mSDtfsCounter, 1756 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 1797 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:47:35,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 1797 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:47:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-07-14 04:47:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2022-07-14 04:47:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 1990 states have (on average 1.2246231155778895) internal successors, (2437), 2044 states have internal predecessors, (2437), 617 states have call successors, (617), 145 states have call predecessors, (617), 146 states have return successors, (662), 611 states have call predecessors, (662), 615 states have call successors, (662) [2022-07-14 04:47:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3716 transitions. [2022-07-14 04:47:35,694 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3716 transitions. Word has length 122 [2022-07-14 04:47:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:35,696 INFO L495 AbstractCegarLoop]: Abstraction has 2770 states and 3716 transitions. [2022-07-14 04:47:35,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:47:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3716 transitions. [2022-07-14 04:47:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 04:47:35,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:35,697 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:47:35,723 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:47:35,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-14 04:47:35,905 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:47:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash 412782822, now seen corresponding path program 1 times [2022-07-14 04:47:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:35,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775015674] [2022-07-14 04:47:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:36,371 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:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:36,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775015674] [2022-07-14 04:47:36,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775015674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:36,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:36,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:36,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160433438] [2022-07-14 04:47:36,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:36,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:36,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:36,375 INFO L87 Difference]: Start difference. First operand 2770 states and 3716 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:47:38,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:40,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:47:52,430 INFO L93 Difference]: Finished difference Result 2770 states and 3716 transitions. [2022-07-14 04:47:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:47:52,430 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:47:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:47:52,444 INFO L225 Difference]: With dead ends: 2770 [2022-07-14 04:47:52,445 INFO L226 Difference]: Without dead ends: 2768 [2022-07-14 04:47:52,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:47:52,447 INFO L413 NwaCegarLoop]: 1861 mSDtfsCounter, 3222 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 1612 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3323 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 4216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1612 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:47:52,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3323 Valid, 2588 Invalid, 4216 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1612 Valid, 2602 Invalid, 2 Unknown, 0 Unchecked, 15.4s Time] [2022-07-14 04:47:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2022-07-14 04:47:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2768. [2022-07-14 04:47:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 1989 states have (on average 1.2242332830568126) internal successors, (2435), 2042 states have internal predecessors, (2435), 617 states have call successors, (617), 145 states have call predecessors, (617), 146 states have return successors, (662), 611 states have call predecessors, (662), 615 states have call successors, (662) [2022-07-14 04:47:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 3714 transitions. [2022-07-14 04:47:52,644 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 3714 transitions. Word has length 114 [2022-07-14 04:47:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:47:52,645 INFO L495 AbstractCegarLoop]: Abstraction has 2768 states and 3714 transitions. [2022-07-14 04:47:52,645 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:47:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3714 transitions. [2022-07-14 04:47:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:47:52,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:47:52,646 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:47:52,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:47:52,647 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:47:52,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:47:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 99295502, now seen corresponding path program 1 times [2022-07-14 04:47:52,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:47:52,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214764914] [2022-07-14 04:47:52,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:47:52,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:47:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:47:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:47:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:47:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:47:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:47:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:47:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:47:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:47:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:47:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:47:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:47:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:47:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:47:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:53,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:47:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:47:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:53,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:47:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:53,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:47:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:53,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:47:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:47:53,064 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:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:47:53,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214764914] [2022-07-14 04:47:53,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214764914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:47:53,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:47:53,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:47:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303056455] [2022-07-14 04:47:53,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:47:53,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:47:53,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:47:53,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:47:53,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:47:53,066 INFO L87 Difference]: Start difference. First operand 2768 states and 3714 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:47:55,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:47:57,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:48:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:48:09,559 INFO L93 Difference]: Finished difference Result 2768 states and 3714 transitions. [2022-07-14 04:48:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:48:09,559 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:48:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:48:09,571 INFO L225 Difference]: With dead ends: 2768 [2022-07-14 04:48:09,572 INFO L226 Difference]: Without dead ends: 2766 [2022-07-14 04:48:09,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:48:09,574 INFO L413 NwaCegarLoop]: 1859 mSDtfsCounter, 3216 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 1612 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3316 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 4214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1612 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:48:09,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3316 Valid, 2586 Invalid, 4214 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1612 Valid, 2600 Invalid, 2 Unknown, 0 Unchecked, 15.9s Time] [2022-07-14 04:48:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2022-07-14 04:48:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2766. [2022-07-14 04:48:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2766 states, 1988 states have (on average 1.2238430583501005) internal successors, (2433), 2040 states have internal predecessors, (2433), 617 states have call successors, (617), 145 states have call predecessors, (617), 146 states have return successors, (662), 611 states have call predecessors, (662), 615 states have call successors, (662) [2022-07-14 04:48:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 3712 transitions. [2022-07-14 04:48:09,793 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 3712 transitions. Word has length 120 [2022-07-14 04:48:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:48:09,794 INFO L495 AbstractCegarLoop]: Abstraction has 2766 states and 3712 transitions. [2022-07-14 04:48:09,794 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:48:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 3712 transitions. [2022-07-14 04:48:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-14 04:48:09,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:48:09,796 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:48:09,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:48:09,797 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:48:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:48:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 924858769, now seen corresponding path program 1 times [2022-07-14 04:48:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:48:09,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055972893] [2022-07-14 04:48:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:48:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:48:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:48:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:48:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:48:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:48:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:48:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:48:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:48:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:48:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:48:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:48:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:48:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:48:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:48:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:48:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:48:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:48:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:48:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:48:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:10,329 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:48:10,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:48:10,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055972893] [2022-07-14 04:48:10,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055972893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:48:10,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:48:10,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:48:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584798998] [2022-07-14 04:48:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:48:10,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:48:10,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:48:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:48:10,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:48:10,332 INFO L87 Difference]: Start difference. First operand 2766 states and 3712 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:48:12,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:48:14,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 04:48:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:48:26,849 INFO L93 Difference]: Finished difference Result 2766 states and 3712 transitions. [2022-07-14 04:48:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:48:26,849 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:48:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:48:26,865 INFO L225 Difference]: With dead ends: 2766 [2022-07-14 04:48:26,865 INFO L226 Difference]: Without dead ends: 2764 [2022-07-14 04:48:26,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:48:26,867 INFO L413 NwaCegarLoop]: 1857 mSDtfsCounter, 3210 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 1612 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3309 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 4212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1612 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:48:26,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3309 Valid, 2584 Invalid, 4212 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1612 Valid, 2598 Invalid, 2 Unknown, 0 Unchecked, 15.9s Time] [2022-07-14 04:48:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2022-07-14 04:48:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2022-07-14 04:48:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 1987 states have (on average 1.2234524408656267) internal successors, (2431), 2038 states have internal predecessors, (2431), 617 states have call successors, (617), 145 states have call predecessors, (617), 146 states have return successors, (662), 611 states have call predecessors, (662), 615 states have call successors, (662) [2022-07-14 04:48:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3710 transitions. [2022-07-14 04:48:27,016 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3710 transitions. Word has length 126 [2022-07-14 04:48:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:48:27,016 INFO L495 AbstractCegarLoop]: Abstraction has 2764 states and 3710 transitions. [2022-07-14 04:48:27,016 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:48:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3710 transitions. [2022-07-14 04:48:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-14 04:48:27,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:48:27,018 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:48:27,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:48:27,018 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_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-14 04:48:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:48:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1328575984, now seen corresponding path program 1 times [2022-07-14 04:48:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:48:27,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156746842] [2022-07-14 04:48:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:48:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:48:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:48:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:48:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:48:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 04:48:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 04:48:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 04:48:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:48:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:48:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-14 04:48:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 04:48:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:48:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:48:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 04:48:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 04:48:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 04:48:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:48:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:48:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:48:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 04:48:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-14 04:48:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:48:27,425 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:48:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:48:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156746842] [2022-07-14 04:48:27,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156746842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:48:27,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:48:27,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:48:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379631146] [2022-07-14 04:48:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:48:27,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:48:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:48:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:48:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:48:27,430 INFO L87 Difference]: Start difference. First operand 2764 states and 3710 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:48:29,462 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 [] [2022-07-14 04:48:31,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []