./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--vme--bridges--vme_ca91cx42.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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--vme--bridges--vme_ca91cx42.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 a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:12:47,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:12:47,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:12:47,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:12:47,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:12:47,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:12:47,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:12:47,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:12:47,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:12:47,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:12:47,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:12:47,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:12:47,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:12:47,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:12:47,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:12:47,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:12:47,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:12:47,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:12:47,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:12:47,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:12:47,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:12:47,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:12:47,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:12:47,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:12:47,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:12:47,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:12:47,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:12:47,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:12:47,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:12:47,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:12:47,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:12:47,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:12:47,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:12:47,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:12:47,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:12:47,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:12:47,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:12:47,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:12:47,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:12:47,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:12:47,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:12:47,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 19:12:47,268 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:12:47,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:12:47,272 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:12:47,272 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:12:47,273 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:12:47,273 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:12:47,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:12:47,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:12:47,274 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:12:47,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:12:47,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:12:47,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:12:47,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 19:12:47,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:12:47,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 19:12:47,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 19:12:47,275 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:12:47,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 19:12:47,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:12:47,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:12:47,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:12:47,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:12:47,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:12:47,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:12:47,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 19:12:47,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:12:47,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:12:47,277 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 19:12:47,277 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 19:12:47,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 19:12:47,277 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:12:47,277 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 -> a4ce0bc2df24452096decdc7e961550a8934d52ee8eab37caec2ef22f016be61 [2021-12-14 19:12:47,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:12:47,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:12:47,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:12:47,474 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:12:47,493 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:12:47,500 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--vme--bridges--vme_ca91cx42.ko.cil.i [2021-12-14 19:12:47,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698d3c1b8/b66b1adf2e56460999169cf2b1b3b22a/FLAGb885e4d61 [2021-12-14 19:12:48,179 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:12:48,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2021-12-14 19:12:48,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698d3c1b8/b66b1adf2e56460999169cf2b1b3b22a/FLAGb885e4d61 [2021-12-14 19:12:48,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/698d3c1b8/b66b1adf2e56460999169cf2b1b3b22a [2021-12-14 19:12:48,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:12:48,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:12:48,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:12:48,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:12:48,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:12:48,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:12:48" (1/1) ... [2021-12-14 19:12:48,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295799c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:48, skipping insertion in model container [2021-12-14 19:12:48,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:12:48" (1/1) ... [2021-12-14 19:12:48,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:12:48,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:12:50,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2021-12-14 19:12:50,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2021-12-14 19:12:50,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2021-12-14 19:12:50,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2021-12-14 19:12:50,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2021-12-14 19:12:50,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2021-12-14 19:12:50,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2021-12-14 19:12:50,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2021-12-14 19:12:50,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2021-12-14 19:12:50,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2021-12-14 19:12:50,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2021-12-14 19:12:50,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2021-12-14 19:12:50,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2021-12-14 19:12:50,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2021-12-14 19:12:50,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2021-12-14 19:12:50,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2021-12-14 19:12:50,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2021-12-14 19:12:50,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2021-12-14 19:12:50,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2021-12-14 19:12:50,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2021-12-14 19:12:50,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2021-12-14 19:12:50,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2021-12-14 19:12:50,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2021-12-14 19:12:50,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2021-12-14 19:12:50,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2021-12-14 19:12:50,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2021-12-14 19:12:50,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2021-12-14 19:12:50,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2021-12-14 19:12:50,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2021-12-14 19:12:50,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2021-12-14 19:12:50,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2021-12-14 19:12:50,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2021-12-14 19:12:50,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2021-12-14 19:12:50,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2021-12-14 19:12:50,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2021-12-14 19:12:50,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2021-12-14 19:12:50,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2021-12-14 19:12:50,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2021-12-14 19:12:50,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2021-12-14 19:12:50,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2021-12-14 19:12:50,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2021-12-14 19:12:50,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2021-12-14 19:12:50,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2021-12-14 19:12:50,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2021-12-14 19:12:50,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2021-12-14 19:12:50,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2021-12-14 19:12:50,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2021-12-14 19:12:50,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2021-12-14 19:12:50,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2021-12-14 19:12:50,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2021-12-14 19:12:50,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2021-12-14 19:12:50,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2021-12-14 19:12:50,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2021-12-14 19:12:50,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2021-12-14 19:12:50,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2021-12-14 19:12:50,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2021-12-14 19:12:50,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2021-12-14 19:12:50,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2021-12-14 19:12:50,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2021-12-14 19:12:50,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2021-12-14 19:12:50,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2021-12-14 19:12:50,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2021-12-14 19:12:50,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2021-12-14 19:12:50,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2021-12-14 19:12:50,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2021-12-14 19:12:50,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2021-12-14 19:12:50,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2021-12-14 19:12:50,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2021-12-14 19:12:50,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2021-12-14 19:12:50,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2021-12-14 19:12:50,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2021-12-14 19:12:50,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2021-12-14 19:12:50,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2021-12-14 19:12:50,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2021-12-14 19:12:50,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2021-12-14 19:12:50,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2021-12-14 19:12:50,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2021-12-14 19:12:50,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2021-12-14 19:12:50,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2021-12-14 19:12:50,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2021-12-14 19:12:50,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2021-12-14 19:12:50,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2021-12-14 19:12:50,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2021-12-14 19:12:50,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2021-12-14 19:12:50,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2021-12-14 19:12:50,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2021-12-14 19:12:50,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2021-12-14 19:12:50,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2021-12-14 19:12:50,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:12:50,654 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:12:50,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[309910,309923] [2021-12-14 19:12:50,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2021-12-14 19:12:50,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2021-12-14 19:12:50,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2021-12-14 19:12:50,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2021-12-14 19:12:50,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2021-12-14 19:12:50,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2021-12-14 19:12:50,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2021-12-14 19:12:50,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2021-12-14 19:12:50,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2021-12-14 19:12:50,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2021-12-14 19:12:50,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2021-12-14 19:12:50,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2021-12-14 19:12:50,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2021-12-14 19:12:50,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2021-12-14 19:12:50,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2021-12-14 19:12:50,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2021-12-14 19:12:50,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2021-12-14 19:12:50,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2021-12-14 19:12:50,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2021-12-14 19:12:50,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2021-12-14 19:12:50,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2021-12-14 19:12:50,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2021-12-14 19:12:50,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2021-12-14 19:12:50,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2021-12-14 19:12:50,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2021-12-14 19:12:50,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2021-12-14 19:12:50,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2021-12-14 19:12:50,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2021-12-14 19:12:50,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2021-12-14 19:12:50,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2021-12-14 19:12:50,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2021-12-14 19:12:50,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2021-12-14 19:12:50,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2021-12-14 19:12:50,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2021-12-14 19:12:50,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2021-12-14 19:12:50,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2021-12-14 19:12:50,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2021-12-14 19:12:50,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2021-12-14 19:12:50,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2021-12-14 19:12:50,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2021-12-14 19:12:50,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2021-12-14 19:12:50,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2021-12-14 19:12:50,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2021-12-14 19:12:50,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2021-12-14 19:12:50,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2021-12-14 19:12:50,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2021-12-14 19:12:50,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2021-12-14 19:12:50,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2021-12-14 19:12:50,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2021-12-14 19:12:50,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2021-12-14 19:12:50,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2021-12-14 19:12:50,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2021-12-14 19:12:50,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2021-12-14 19:12:50,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2021-12-14 19:12:50,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2021-12-14 19:12:50,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2021-12-14 19:12:50,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2021-12-14 19:12:50,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2021-12-14 19:12:50,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2021-12-14 19:12:50,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2021-12-14 19:12:50,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2021-12-14 19:12:50,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2021-12-14 19:12:50,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2021-12-14 19:12:50,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2021-12-14 19:12:50,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2021-12-14 19:12:50,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2021-12-14 19:12:50,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2021-12-14 19:12:50,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2021-12-14 19:12:50,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2021-12-14 19:12:50,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2021-12-14 19:12:50,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2021-12-14 19:12:50,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2021-12-14 19:12:50,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2021-12-14 19:12:50,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2021-12-14 19:12:50,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2021-12-14 19:12:50,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2021-12-14 19:12:50,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2021-12-14 19:12:50,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2021-12-14 19:12:50,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2021-12-14 19:12:50,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2021-12-14 19:12:50,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2021-12-14 19:12:50,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2021-12-14 19:12:50,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2021-12-14 19:12:50,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2021-12-14 19:12:50,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2021-12-14 19:12:50,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2021-12-14 19:12:50,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2021-12-14 19:12:50,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:12:51,026 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:12:51,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51 WrapperNode [2021-12-14 19:12:51,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:12:51,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:12:51,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:12:51,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:12:51,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,213 INFO L137 Inliner]: procedures = 571, calls = 1721, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2362 [2021-12-14 19:12:51,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:12:51,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:12:51,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:12:51,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:12:51,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:12:51,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:12:51,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:12:51,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:12:51,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (1/1) ... [2021-12-14 19:12:51,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:12:51,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:12:51,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:12:51,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:12:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:12:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-14 19:12:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2021-12-14 19:12:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2021-12-14 19:12:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-14 19:12:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-14 19:12:51,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-14 19:12:51,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-14 19:12:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2021-12-14 19:12:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2021-12-14 19:12:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:12:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-14 19:12:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2021-12-14 19:12:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2021-12-14 19:12:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:12:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-14 19:12:51,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:12:51,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-14 19:12:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2021-12-14 19:12:51,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2021-12-14 19:12:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-14 19:12:51,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-14 19:12:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2021-12-14 19:12:51,407 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2021-12-14 19:12:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-14 19:12:51,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-14 19:12:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:12:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-14 19:12:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:12:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-12-14 19:12:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-12-14 19:12:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-14 19:12:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-14 19:12:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:12:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-14 19:12:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2021-12-14 19:12:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2021-12-14 19:12:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2021-12-14 19:12:51,409 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2021-12-14 19:12:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2021-12-14 19:12:51,409 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2021-12-14 19:12:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-14 19:12:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-14 19:12:51,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-14 19:12:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-14 19:12:51,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-14 19:12:51,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:12:51,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-14 19:12:51,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:12:51,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:12:51,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-14 19:12:51,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-14 19:12:51,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-14 19:12:51,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:12:51,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-14 19:12:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-12-14 19:12:51,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-12-14 19:12:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-14 19:12:51,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-14 19:12:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2021-12-14 19:12:51,411 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2021-12-14 19:12:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2021-12-14 19:12:51,411 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2021-12-14 19:12:51,411 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2021-12-14 19:12:51,412 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2021-12-14 19:12:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:12:51,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-14 19:12:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2021-12-14 19:12:51,412 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2021-12-14 19:12:51,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:12:51,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-14 19:12:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2021-12-14 19:12:51,415 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2021-12-14 19:12:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:12:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-12-14 19:12:51,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-12-14 19:12:51,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:12:51,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-14 19:12:51,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-14 19:12:51,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:12:51,416 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-12-14 19:12:51,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-12-14 19:12:51,417 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-14 19:12:51,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-14 19:12:51,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2021-12-14 19:12:51,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2021-12-14 19:12:51,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:12:51,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-14 19:12:51,418 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-12-14 19:12:51,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-12-14 19:12:51,418 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2021-12-14 19:12:51,418 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2021-12-14 19:12:51,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:12:51,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:12:51,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-14 19:12:51,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-14 19:12:51,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-14 19:12:51,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-14 19:12:51,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2021-12-14 19:12:51,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2021-12-14 19:12:51,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:12:51,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-14 19:12:51,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:12:51,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-14 19:12:51,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:12:51,419 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-14 19:12:51,419 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-14 19:12:51,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:12:51,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-14 19:12:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:12:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:12:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2021-12-14 19:12:51,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2021-12-14 19:12:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2021-12-14 19:12:51,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2021-12-14 19:12:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-14 19:12:51,420 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-14 19:12:51,420 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2021-12-14 19:12:51,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2021-12-14 19:12:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:12:51,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-14 19:12:51,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-14 19:12:51,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-14 19:12:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2021-12-14 19:12:51,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2021-12-14 19:12:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-14 19:12:51,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-14 19:12:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:12:51,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-14 19:12:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-14 19:12:51,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-14 19:12:51,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:12:51,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-14 19:12:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2021-12-14 19:12:51,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2021-12-14 19:12:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:12:51,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-14 19:12:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-14 19:12:51,423 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-14 19:12:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-14 19:12:51,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-14 19:12:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:12:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2021-12-14 19:12:51,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2021-12-14 19:12:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:12:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-14 19:12:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-14 19:12:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-14 19:12:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:12:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-14 19:12:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-12-14 19:12:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-12-14 19:12:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-14 19:12:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-14 19:12:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:12:51,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-14 19:12:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2021-12-14 19:12:51,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2021-12-14 19:12:51,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:12:51,807 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:12:51,809 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:12:51,928 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-14 19:12:53,555 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:12:53,569 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:12:53,570 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 19:12:53,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:12:53 BoogieIcfgContainer [2021-12-14 19:12:53,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:12:53,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:12:53,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:12:53,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:12:53,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:12:48" (1/3) ... [2021-12-14 19:12:53,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cb2506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:12:53, skipping insertion in model container [2021-12-14 19:12:53,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:12:51" (2/3) ... [2021-12-14 19:12:53,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cb2506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:12:53, skipping insertion in model container [2021-12-14 19:12:53,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:12:53" (3/3) ... [2021-12-14 19:12:53,580 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2021-12-14 19:12:53,586 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:12:53,586 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-14 19:12:53,646 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:12:53,657 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:12:53,657 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-14 19:12:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 959 states, 608 states have (on average 1.238486842105263) internal successors, (753), 649 states have internal predecessors, (753), 250 states have call successors, (250), 73 states have call predecessors, (250), 72 states have return successors, (247), 247 states have call predecessors, (247), 247 states have call successors, (247) [2021-12-14 19:12:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 19:12:53,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:12:53,715 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:12:53,715 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:12:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:12:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash 628355767, now seen corresponding path program 1 times [2021-12-14 19:12:53,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:12:53,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886122024] [2021-12-14 19:12:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:12:53,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:12:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:12:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:12:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:12:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:12:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:12:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:12:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:12:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:12:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:12:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:12:54,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:12:54,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886122024] [2021-12-14 19:12:54,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886122024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:12:54,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:12:54,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:12:54,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284310921] [2021-12-14 19:12:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:12:54,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:12:54,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:12:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:12:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:12:54,249 INFO L87 Difference]: Start difference. First operand has 959 states, 608 states have (on average 1.238486842105263) internal successors, (753), 649 states have internal predecessors, (753), 250 states have call successors, (250), 73 states have call predecessors, (250), 72 states have return successors, (247), 247 states have call predecessors, (247), 247 states have call successors, (247) 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) [2021-12-14 19:12:56,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:12:56,977 INFO L93 Difference]: Finished difference Result 2805 states and 3794 transitions. [2021-12-14 19:12:56,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:12:56,979 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 [2021-12-14 19:12:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:12:57,017 INFO L225 Difference]: With dead ends: 2805 [2021-12-14 19:12:57,018 INFO L226 Difference]: Without dead ends: 1852 [2021-12-14 19:12:57,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:12:57,045 INFO L933 BasicCegarLoop]: 1476 mSDtfsCounter, 2409 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 1418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2548 SdHoareTripleChecker+Valid, 4030 SdHoareTripleChecker+Invalid, 3353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1418 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:12:57,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2548 Valid, 4030 Invalid, 3353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1418 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-14 19:12:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-12-14 19:12:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1659. [2021-12-14 19:12:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1067 states have (on average 1.1883786316776008) internal successors, (1268), 1122 states have internal predecessors, (1268), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:12:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2153 transitions. [2021-12-14 19:12:57,171 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2153 transitions. Word has length 64 [2021-12-14 19:12:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:12:57,172 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2153 transitions. [2021-12-14 19:12:57,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-14 19:12:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2153 transitions. [2021-12-14 19:12:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 19:12:57,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:12:57,174 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:12:57,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:12:57,175 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:12:57,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:12:57,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1959425756, now seen corresponding path program 1 times [2021-12-14 19:12:57,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:12:57,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311778169] [2021-12-14 19:12:57,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:12:57,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:12:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:12:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:12:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:12:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:12:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:12:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:12:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:12:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:12:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:12:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:12:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:12:57,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:12:57,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311778169] [2021-12-14 19:12:57,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311778169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:12:57,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:12:57,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:12:57,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758473930] [2021-12-14 19:12:57,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:12:57,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:12:57,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:12:57,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:12:57,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:12:57,311 INFO L87 Difference]: Start difference. First operand 1659 states and 2153 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) [2021-12-14 19:12:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:12:58,580 INFO L93 Difference]: Finished difference Result 1659 states and 2153 transitions. [2021-12-14 19:12:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:12:58,580 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 [2021-12-14 19:12:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:12:58,587 INFO L225 Difference]: With dead ends: 1659 [2021-12-14 19:12:58,587 INFO L226 Difference]: Without dead ends: 1657 [2021-12-14 19:12:58,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:12:58,589 INFO L933 BasicCegarLoop]: 1102 mSDtfsCounter, 1652 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:12:58,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1792 Valid, 2401 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:12:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-12-14 19:12:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-12-14 19:12:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1066 states have (on average 1.1876172607879925) internal successors, (1266), 1120 states have internal predecessors, (1266), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:12:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2151 transitions. [2021-12-14 19:12:58,647 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2151 transitions. Word has length 70 [2021-12-14 19:12:58,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:12:58,648 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2151 transitions. [2021-12-14 19:12:58,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 19:12:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2151 transitions. [2021-12-14 19:12:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-14 19:12:58,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:12:58,650 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:12:58,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:12:58,651 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:12:58,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:12:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1402994656, now seen corresponding path program 1 times [2021-12-14 19:12:58,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:12:58,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925171659] [2021-12-14 19:12:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:12:58,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:12:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:12:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:12:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:12:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:12:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:12:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:12:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:12:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:12:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:12:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:12:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:12:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:12:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:12:58,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:12:58,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925171659] [2021-12-14 19:12:58,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925171659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:12:58,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:12:58,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:12:58,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617673737] [2021-12-14 19:12:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:12:58,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:12:58,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:12:58,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:12:58,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:12:58,786 INFO L87 Difference]: Start difference. First operand 1657 states and 2151 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) [2021-12-14 19:12:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:12:59,983 INFO L93 Difference]: Finished difference Result 1657 states and 2151 transitions. [2021-12-14 19:12:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:12:59,983 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 [2021-12-14 19:12:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:12:59,989 INFO L225 Difference]: With dead ends: 1657 [2021-12-14 19:12:59,990 INFO L226 Difference]: Without dead ends: 1655 [2021-12-14 19:12:59,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:12:59,993 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 1646 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1785 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:12:59,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1785 Valid, 2399 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:12:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2021-12-14 19:13:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2021-12-14 19:13:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1065 states have (on average 1.1868544600938966) internal successors, (1264), 1118 states have internal predecessors, (1264), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2149 transitions. [2021-12-14 19:13:00,045 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2149 transitions. Word has length 76 [2021-12-14 19:13:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:00,047 INFO L470 AbstractCegarLoop]: Abstraction has 1655 states and 2149 transitions. [2021-12-14 19:13:00,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 19:13:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2149 transitions. [2021-12-14 19:13:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-14 19:13:00,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:00,051 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:00,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:13:00,051 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1342220052, now seen corresponding path program 1 times [2021-12-14 19:13:00,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:00,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93869097] [2021-12-14 19:13:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:00,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:00,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:00,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93869097] [2021-12-14 19:13:00,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93869097] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:00,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:00,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:00,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787115864] [2021-12-14 19:13:00,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:00,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:00,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:00,241 INFO L87 Difference]: Start difference. First operand 1655 states and 2149 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) [2021-12-14 19:13:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:01,439 INFO L93 Difference]: Finished difference Result 1655 states and 2149 transitions. [2021-12-14 19:13:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:01,440 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 [2021-12-14 19:13:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:01,447 INFO L225 Difference]: With dead ends: 1655 [2021-12-14 19:13:01,447 INFO L226 Difference]: Without dead ends: 1653 [2021-12-14 19:13:01,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:01,449 INFO L933 BasicCegarLoop]: 1098 mSDtfsCounter, 1640 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:01,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1778 Valid, 2397 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-12-14 19:13:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2021-12-14 19:13:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1064 states have (on average 1.1860902255639099) internal successors, (1262), 1116 states have internal predecessors, (1262), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2147 transitions. [2021-12-14 19:13:01,534 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2147 transitions. Word has length 82 [2021-12-14 19:13:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:01,534 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2147 transitions. [2021-12-14 19:13:01,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-14 19:13:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2147 transitions. [2021-12-14 19:13:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-14 19:13:01,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:01,536 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:01,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:13:01,537 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash 148000434, now seen corresponding path program 1 times [2021-12-14 19:13:01,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:01,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763674780] [2021-12-14 19:13:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:01,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:01,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:01,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763674780] [2021-12-14 19:13:01,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763674780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:01,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:01,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:01,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254874463] [2021-12-14 19:13:01,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:01,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:01,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:01,714 INFO L87 Difference]: Start difference. First operand 1653 states and 2147 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) [2021-12-14 19:13:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:03,004 INFO L93 Difference]: Finished difference Result 1653 states and 2147 transitions. [2021-12-14 19:13:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:03,005 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 [2021-12-14 19:13:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:03,011 INFO L225 Difference]: With dead ends: 1653 [2021-12-14 19:13:03,011 INFO L226 Difference]: Without dead ends: 1651 [2021-12-14 19:13:03,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:03,012 INFO L933 BasicCegarLoop]: 1096 mSDtfsCounter, 1634 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:03,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1771 Valid, 2395 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-14 19:13:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-12-14 19:13:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2021-12-14 19:13:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1063 states have (on average 1.1853245531514582) internal successors, (1260), 1114 states have internal predecessors, (1260), 443 states have call successors, (443), 124 states have call predecessors, (443), 121 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2145 transitions. [2021-12-14 19:13:03,058 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2145 transitions. Word has length 88 [2021-12-14 19:13:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:03,059 INFO L470 AbstractCegarLoop]: Abstraction has 1651 states and 2145 transitions. [2021-12-14 19:13:03,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:13:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2145 transitions. [2021-12-14 19:13:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-14 19:13:03,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:03,063 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:03,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:13:03,064 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:03,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1268832777, now seen corresponding path program 1 times [2021-12-14 19:13:03,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:03,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128598633] [2021-12-14 19:13:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:03,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:13:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 19:13:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:13:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-14 19:13:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 19:13:03,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:03,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128598633] [2021-12-14 19:13:03,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128598633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:03,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:03,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:13:03,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874743439] [2021-12-14 19:13:03,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:03,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:13:03,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:13:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:13:03,318 INFO L87 Difference]: Start difference. First operand 1651 states and 2145 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:13:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:05,598 INFO L93 Difference]: Finished difference Result 3395 states and 4442 transitions. [2021-12-14 19:13:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:13:05,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2021-12-14 19:13:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:05,605 INFO L225 Difference]: With dead ends: 3395 [2021-12-14 19:13:05,606 INFO L226 Difference]: Without dead ends: 1765 [2021-12-14 19:13:05,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:13:05,610 INFO L933 BasicCegarLoop]: 1090 mSDtfsCounter, 2007 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 1327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 3783 SdHoareTripleChecker+Invalid, 3963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1327 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:05,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2147 Valid, 3783 Invalid, 3963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1327 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-14 19:13:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2021-12-14 19:13:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1669. [2021-12-14 19:13:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1075 states have (on average 1.1813953488372093) internal successors, (1270), 1126 states have internal predecessors, (1270), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2155 transitions. [2021-12-14 19:13:05,674 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2155 transitions. Word has length 116 [2021-12-14 19:13:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:05,674 INFO L470 AbstractCegarLoop]: Abstraction has 1669 states and 2155 transitions. [2021-12-14 19:13:05,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:13:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2155 transitions. [2021-12-14 19:13:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-14 19:13:05,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:05,677 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:05,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:13:05,677 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1268773195, now seen corresponding path program 1 times [2021-12-14 19:13:05,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:05,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652324328] [2021-12-14 19:13:05,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:05,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:13:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 19:13:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:13:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-14 19:13:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 19:13:05,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:05,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652324328] [2021-12-14 19:13:05,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652324328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:05,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:05,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:13:05,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012802579] [2021-12-14 19:13:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:05,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:13:05,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:13:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:13:05,869 INFO L87 Difference]: Start difference. First operand 1669 states and 2155 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2021-12-14 19:13:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:07,525 INFO L93 Difference]: Finished difference Result 1765 states and 2308 transitions. [2021-12-14 19:13:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:13:07,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2021-12-14 19:13:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:07,532 INFO L225 Difference]: With dead ends: 1765 [2021-12-14 19:13:07,532 INFO L226 Difference]: Without dead ends: 1763 [2021-12-14 19:13:07,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:13:07,534 INFO L933 BasicCegarLoop]: 1087 mSDtfsCounter, 1210 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:07,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1210 Valid, 3387 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1088 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-14 19:13:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2021-12-14 19:13:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1667. [2021-12-14 19:13:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1074 states have (on average 1.179702048417132) internal successors, (1267), 1124 states have internal predecessors, (1267), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2152 transitions. [2021-12-14 19:13:07,609 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2152 transitions. Word has length 116 [2021-12-14 19:13:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:07,609 INFO L470 AbstractCegarLoop]: Abstraction has 1667 states and 2152 transitions. [2021-12-14 19:13:07,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2021-12-14 19:13:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2152 transitions. [2021-12-14 19:13:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-14 19:13:07,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:07,611 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:07,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:13:07,612 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:07,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash -93320400, now seen corresponding path program 1 times [2021-12-14 19:13:07,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:07,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974634666] [2021-12-14 19:13:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:07,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:07,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:07,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974634666] [2021-12-14 19:13:07,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974634666] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:07,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:07,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:07,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954084623] [2021-12-14 19:13:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:07,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:07,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:07,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:07,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:07,757 INFO L87 Difference]: Start difference. First operand 1667 states and 2152 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) [2021-12-14 19:13:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:08,869 INFO L93 Difference]: Finished difference Result 1667 states and 2152 transitions. [2021-12-14 19:13:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:08,872 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 [2021-12-14 19:13:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:08,877 INFO L225 Difference]: With dead ends: 1667 [2021-12-14 19:13:08,877 INFO L226 Difference]: Without dead ends: 1665 [2021-12-14 19:13:08,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:08,878 INFO L933 BasicCegarLoop]: 1091 mSDtfsCounter, 1619 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:08,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1755 Valid, 2390 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-14 19:13:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2021-12-14 19:13:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2021-12-14 19:13:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1073 states have (on average 1.1789375582479031) internal successors, (1265), 1122 states have internal predecessors, (1265), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2150 transitions. [2021-12-14 19:13:08,926 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2150 transitions. Word has length 94 [2021-12-14 19:13:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:08,926 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 2150 transitions. [2021-12-14 19:13:08,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-14 19:13:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2150 transitions. [2021-12-14 19:13:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-14 19:13:08,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:08,928 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:08,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:13:08,928 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1533254331, now seen corresponding path program 1 times [2021-12-14 19:13:08,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:08,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890639646] [2021-12-14 19:13:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:08,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:08,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:08,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:13:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 19:13:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:13:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-14 19:13:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 19:13:09,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890639646] [2021-12-14 19:13:09,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890639646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:09,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:09,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:09,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761035363] [2021-12-14 19:13:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:09,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:09,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:09,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:09,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:09,112 INFO L87 Difference]: Start difference. First operand 1665 states and 2150 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:13:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:10,365 INFO L93 Difference]: Finished difference Result 3399 states and 4433 transitions. [2021-12-14 19:13:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-12-14 19:13:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:10,373 INFO L225 Difference]: With dead ends: 3399 [2021-12-14 19:13:10,373 INFO L226 Difference]: Without dead ends: 1755 [2021-12-14 19:13:10,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:10,379 INFO L933 BasicCegarLoop]: 1081 mSDtfsCounter, 2011 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 1321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1321 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:10,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2161 Valid, 1987 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1321 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-12-14 19:13:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1659. [2021-12-14 19:13:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1068 states have (on average 1.1760299625468165) internal successors, (1256), 1116 states have internal predecessors, (1256), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2141 transitions. [2021-12-14 19:13:10,435 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2141 transitions. Word has length 120 [2021-12-14 19:13:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:10,435 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2141 transitions. [2021-12-14 19:13:10,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-14 19:13:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2141 transitions. [2021-12-14 19:13:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 19:13:10,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:10,436 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:10,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:13:10,437 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1709105799, now seen corresponding path program 1 times [2021-12-14 19:13:10,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:10,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091531402] [2021-12-14 19:13:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:10,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:10,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:10,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091531402] [2021-12-14 19:13:10,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091531402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:10,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:10,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:10,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133776116] [2021-12-14 19:13:10,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:10,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:10,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:10,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:10,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:10,581 INFO L87 Difference]: Start difference. First operand 1659 states and 2141 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) [2021-12-14 19:13:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:11,789 INFO L93 Difference]: Finished difference Result 1659 states and 2141 transitions. [2021-12-14 19:13:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:11,790 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 [2021-12-14 19:13:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:11,795 INFO L225 Difference]: With dead ends: 1659 [2021-12-14 19:13:11,795 INFO L226 Difference]: Without dead ends: 1657 [2021-12-14 19:13:11,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:11,796 INFO L933 BasicCegarLoop]: 1084 mSDtfsCounter, 1598 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:11,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1733 Valid, 2383 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-12-14 19:13:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-12-14 19:13:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1067 states have (on average 1.175257731958763) internal successors, (1254), 1114 states have internal predecessors, (1254), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2139 transitions. [2021-12-14 19:13:11,847 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2139 transitions. Word has length 100 [2021-12-14 19:13:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:11,847 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2139 transitions. [2021-12-14 19:13:11,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-14 19:13:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2139 transitions. [2021-12-14 19:13:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-14 19:13:11,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:11,849 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:11,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:13:11,849 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2127900869, now seen corresponding path program 1 times [2021-12-14 19:13:11,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:11,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456837472] [2021-12-14 19:13:11,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:11,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:11,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:11,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456837472] [2021-12-14 19:13:11,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456837472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:11,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:11,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:11,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305678750] [2021-12-14 19:13:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:11,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:12,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:12,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:12,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:12,000 INFO L87 Difference]: Start difference. First operand 1657 states and 2139 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) [2021-12-14 19:13:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:13,162 INFO L93 Difference]: Finished difference Result 1657 states and 2139 transitions. [2021-12-14 19:13:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:13,163 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 [2021-12-14 19:13:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:13,168 INFO L225 Difference]: With dead ends: 1657 [2021-12-14 19:13:13,168 INFO L226 Difference]: Without dead ends: 1655 [2021-12-14 19:13:13,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:13,169 INFO L933 BasicCegarLoop]: 1082 mSDtfsCounter, 1596 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:13,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1730 Valid, 2381 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2021-12-14 19:13:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2021-12-14 19:13:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1066 states have (on average 1.174484052532833) internal successors, (1252), 1112 states have internal predecessors, (1252), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2137 transitions. [2021-12-14 19:13:13,233 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2137 transitions. Word has length 106 [2021-12-14 19:13:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:13,234 INFO L470 AbstractCegarLoop]: Abstraction has 1655 states and 2137 transitions. [2021-12-14 19:13:13,234 INFO L471 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) [2021-12-14 19:13:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2137 transitions. [2021-12-14 19:13:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-14 19:13:13,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:13,235 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:13,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:13:13,235 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash 508438824, now seen corresponding path program 1 times [2021-12-14 19:13:13,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:13,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935463789] [2021-12-14 19:13:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:13,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:13,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:13,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935463789] [2021-12-14 19:13:13,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935463789] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:13,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:13,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:13,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059920479] [2021-12-14 19:13:13,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:13,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:13,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:13,375 INFO L87 Difference]: Start difference. First operand 1655 states and 2137 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) [2021-12-14 19:13:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:14,603 INFO L93 Difference]: Finished difference Result 1655 states and 2137 transitions. [2021-12-14 19:13:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:14,604 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 [2021-12-14 19:13:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:14,609 INFO L225 Difference]: With dead ends: 1655 [2021-12-14 19:13:14,609 INFO L226 Difference]: Without dead ends: 1653 [2021-12-14 19:13:14,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:14,610 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 1584 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:14,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1718 Valid, 2379 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-12-14 19:13:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2021-12-14 19:13:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1065 states have (on average 1.1737089201877935) internal successors, (1250), 1110 states have internal predecessors, (1250), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2135 transitions. [2021-12-14 19:13:14,666 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2135 transitions. Word has length 108 [2021-12-14 19:13:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:14,666 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2135 transitions. [2021-12-14 19:13:14,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-14 19:13:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2135 transitions. [2021-12-14 19:13:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-14 19:13:14,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:14,668 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:14,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:13:14,668 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:14,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1683136456, now seen corresponding path program 1 times [2021-12-14 19:13:14,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:14,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065240344] [2021-12-14 19:13:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:14,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:14,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:14,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065240344] [2021-12-14 19:13:14,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065240344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:14,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:14,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:14,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982673583] [2021-12-14 19:13:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:14,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:14,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:14,829 INFO L87 Difference]: Start difference. First operand 1653 states and 2135 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) [2021-12-14 19:13:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:16,020 INFO L93 Difference]: Finished difference Result 1653 states and 2135 transitions. [2021-12-14 19:13:16,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:16,021 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 [2021-12-14 19:13:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:16,027 INFO L225 Difference]: With dead ends: 1653 [2021-12-14 19:13:16,027 INFO L226 Difference]: Without dead ends: 1651 [2021-12-14 19:13:16,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:16,028 INFO L933 BasicCegarLoop]: 1078 mSDtfsCounter, 1580 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:16,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1713 Valid, 2377 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-12-14 19:13:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2021-12-14 19:13:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1064 states have (on average 1.1729323308270676) internal successors, (1248), 1108 states have internal predecessors, (1248), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2133 transitions. [2021-12-14 19:13:16,086 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2133 transitions. Word has length 114 [2021-12-14 19:13:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:16,087 INFO L470 AbstractCegarLoop]: Abstraction has 1651 states and 2133 transitions. [2021-12-14 19:13:16,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-14 19:13:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2133 transitions. [2021-12-14 19:13:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-14 19:13:16,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:16,088 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:16,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:13:16,088 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:16,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1638841309, now seen corresponding path program 1 times [2021-12-14 19:13:16,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:16,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367188346] [2021-12-14 19:13:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:16,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:16,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:16,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367188346] [2021-12-14 19:13:16,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367188346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:16,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:16,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:16,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314852686] [2021-12-14 19:13:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:16,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:16,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:16,249 INFO L87 Difference]: Start difference. First operand 1651 states and 2133 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) [2021-12-14 19:13:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:17,446 INFO L93 Difference]: Finished difference Result 1651 states and 2133 transitions. [2021-12-14 19:13:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:17,446 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 [2021-12-14 19:13:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:17,452 INFO L225 Difference]: With dead ends: 1651 [2021-12-14 19:13:17,452 INFO L226 Difference]: Without dead ends: 1649 [2021-12-14 19:13:17,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:17,453 INFO L933 BasicCegarLoop]: 1076 mSDtfsCounter, 1574 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:17,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1706 Valid, 2375 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2021-12-14 19:13:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2021-12-14 19:13:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1063 states have (on average 1.1721542803386642) internal successors, (1246), 1106 states have internal predecessors, (1246), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2131 transitions. [2021-12-14 19:13:17,525 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2131 transitions. Word has length 120 [2021-12-14 19:13:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:17,525 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2131 transitions. [2021-12-14 19:13:17,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-14 19:13:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2131 transitions. [2021-12-14 19:13:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-14 19:13:17,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:17,527 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:17,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:13:17,527 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash 941688793, now seen corresponding path program 1 times [2021-12-14 19:13:17,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:17,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055053579] [2021-12-14 19:13:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:17,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:17,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:17,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055053579] [2021-12-14 19:13:17,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055053579] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:17,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:17,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:17,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23829059] [2021-12-14 19:13:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:17,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:17,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:17,717 INFO L87 Difference]: Start difference. First operand 1649 states and 2131 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) [2021-12-14 19:13:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:18,903 INFO L93 Difference]: Finished difference Result 1649 states and 2131 transitions. [2021-12-14 19:13:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:18,903 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 [2021-12-14 19:13:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:18,909 INFO L225 Difference]: With dead ends: 1649 [2021-12-14 19:13:18,909 INFO L226 Difference]: Without dead ends: 1647 [2021-12-14 19:13:18,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:18,911 INFO L933 BasicCegarLoop]: 1074 mSDtfsCounter, 1568 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 2373 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:18,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1699 Valid, 2373 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2021-12-14 19:13:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2021-12-14 19:13:18,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1062 states have (on average 1.1713747645951036) internal successors, (1244), 1104 states have internal predecessors, (1244), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2129 transitions. [2021-12-14 19:13:18,994 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2129 transitions. Word has length 126 [2021-12-14 19:13:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:18,994 INFO L470 AbstractCegarLoop]: Abstraction has 1647 states and 2129 transitions. [2021-12-14 19:13:18,995 INFO L471 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) [2021-12-14 19:13:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2129 transitions. [2021-12-14 19:13:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-14 19:13:18,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:18,996 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:18,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:13:18,996 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1629151933, now seen corresponding path program 1 times [2021-12-14 19:13:18,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:18,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414644391] [2021-12-14 19:13:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:18,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:13:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 19:13:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:13:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:13:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:13:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 19:13:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-12-14 19:13:19,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:19,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414644391] [2021-12-14 19:13:19,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414644391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:19,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:19,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:13:19,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408466087] [2021-12-14 19:13:19,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:19,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:13:19,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:13:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:13:19,167 INFO L87 Difference]: Start difference. First operand 1647 states and 2129 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-14 19:13:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:20,553 INFO L93 Difference]: Finished difference Result 3369 states and 4381 transitions. [2021-12-14 19:13:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:20,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2021-12-14 19:13:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:20,560 INFO L225 Difference]: With dead ends: 3369 [2021-12-14 19:13:20,560 INFO L226 Difference]: Without dead ends: 1743 [2021-12-14 19:13:20,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:13:20,565 INFO L933 BasicCegarLoop]: 910 mSDtfsCounter, 2289 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 1658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2443 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1658 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:20,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2443 Valid, 1778 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1658 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-14 19:13:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2021-12-14 19:13:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1641. [2021-12-14 19:13:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1057 states have (on average 1.1684011352885526) internal successors, (1235), 1098 states have internal predecessors, (1235), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2120 transitions. [2021-12-14 19:13:20,628 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2120 transitions. Word has length 149 [2021-12-14 19:13:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:20,628 INFO L470 AbstractCegarLoop]: Abstraction has 1641 states and 2120 transitions. [2021-12-14 19:13:20,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-14 19:13:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2120 transitions. [2021-12-14 19:13:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-14 19:13:20,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:20,630 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:13:20,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:13:20,630 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -547875515, now seen corresponding path program 1 times [2021-12-14 19:13:20,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:20,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399779164] [2021-12-14 19:13:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:20,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:13:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:20,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:20,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399779164] [2021-12-14 19:13:20,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399779164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:20,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:20,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:20,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394983869] [2021-12-14 19:13:20,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:20,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:20,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:20,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:20,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:20,808 INFO L87 Difference]: Start difference. First operand 1641 states and 2120 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) [2021-12-14 19:13:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:21,943 INFO L93 Difference]: Finished difference Result 1641 states and 2120 transitions. [2021-12-14 19:13:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:21,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2021-12-14 19:13:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:21,949 INFO L225 Difference]: With dead ends: 1641 [2021-12-14 19:13:21,949 INFO L226 Difference]: Without dead ends: 1639 [2021-12-14 19:13:21,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:21,950 INFO L933 BasicCegarLoop]: 1067 mSDtfsCounter, 1557 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:21,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1687 Valid, 2352 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-14 19:13:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2021-12-14 19:13:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2021-12-14 19:13:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1056 states have (on average 1.1676136363636365) internal successors, (1233), 1096 states have internal predecessors, (1233), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2118 transitions. [2021-12-14 19:13:22,012 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2118 transitions. Word has length 132 [2021-12-14 19:13:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:22,013 INFO L470 AbstractCegarLoop]: Abstraction has 1639 states and 2118 transitions. [2021-12-14 19:13:22,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-14 19:13:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2118 transitions. [2021-12-14 19:13:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-14 19:13:22,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:22,014 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:22,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:13:22,015 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2144276236, now seen corresponding path program 1 times [2021-12-14 19:13:22,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:22,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470261616] [2021-12-14 19:13:22,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:22,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:13:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 19:13:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:13:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:13:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:13:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 19:13:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-14 19:13:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2021-12-14 19:13:22,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470261616] [2021-12-14 19:13:22,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470261616] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:13:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511262064] [2021-12-14 19:13:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:22,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:13:22,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:13:22,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:13:22,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:13:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:22,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 1801 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:13:22,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:13:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-14 19:13:22,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:13:22,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511262064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:22,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:13:22,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-14 19:13:22,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336359797] [2021-12-14 19:13:22,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:22,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:13:22,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:22,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:13:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:13:22,998 INFO L87 Difference]: Start difference. First operand 1639 states and 2118 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-14 19:13:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:23,115 INFO L93 Difference]: Finished difference Result 3251 states and 4198 transitions. [2021-12-14 19:13:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:13:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2021-12-14 19:13:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:23,132 INFO L225 Difference]: With dead ends: 3251 [2021-12-14 19:13:23,132 INFO L226 Difference]: Without dead ends: 1633 [2021-12-14 19:13:23,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:13:23,137 INFO L933 BasicCegarLoop]: 1159 mSDtfsCounter, 1104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 1159 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 [2021-12-14 19:13:23,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1104 Valid, 1159 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:13:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-12-14 19:13:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2021-12-14 19:13:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1051 states have (on average 1.164605137963844) internal successors, (1224), 1090 states have internal predecessors, (1224), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2109 transitions. [2021-12-14 19:13:23,216 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2109 transitions. Word has length 155 [2021-12-14 19:13:23,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:23,216 INFO L470 AbstractCegarLoop]: Abstraction has 1633 states and 2109 transitions. [2021-12-14 19:13:23,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-14 19:13:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2109 transitions. [2021-12-14 19:13:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-14 19:13:23,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:23,218 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:23,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:13:23,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 19:13:23,431 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:23,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:23,432 INFO L85 PathProgramCache]: Analyzing trace with hash 90130754, now seen corresponding path program 1 times [2021-12-14 19:13:23,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:23,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170539658] [2021-12-14 19:13:23,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:23,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:13:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:13:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:23,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:23,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170539658] [2021-12-14 19:13:23,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170539658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:23,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:23,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:23,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107156563] [2021-12-14 19:13:23,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:23,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:23,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:23,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:23,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:23,609 INFO L87 Difference]: Start difference. First operand 1633 states and 2109 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-14 19:13:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:24,796 INFO L93 Difference]: Finished difference Result 1633 states and 2109 transitions. [2021-12-14 19:13:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:24,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2021-12-14 19:13:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:24,801 INFO L225 Difference]: With dead ends: 1633 [2021-12-14 19:13:24,802 INFO L226 Difference]: Without dead ends: 1631 [2021-12-14 19:13:24,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:24,803 INFO L933 BasicCegarLoop]: 1060 mSDtfsCounter, 1546 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:24,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1675 Valid, 2331 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-12-14 19:13:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-12-14 19:13:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1050 states have (on average 1.1638095238095238) internal successors, (1222), 1088 states have internal predecessors, (1222), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2107 transitions. [2021-12-14 19:13:24,901 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2107 transitions. Word has length 138 [2021-12-14 19:13:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:24,902 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2107 transitions. [2021-12-14 19:13:24,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-14 19:13:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2107 transitions. [2021-12-14 19:13:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-14 19:13:24,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:24,903 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:24,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:13:24,903 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:24,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1354484047, now seen corresponding path program 1 times [2021-12-14 19:13:24,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:24,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503527056] [2021-12-14 19:13:24,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:24,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:24,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:24,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:24,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:13:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:13:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:13:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:25,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:25,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503527056] [2021-12-14 19:13:25,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503527056] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:25,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:25,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:25,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848012850] [2021-12-14 19:13:25,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:25,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:25,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:25,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:25,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:25,060 INFO L87 Difference]: Start difference. First operand 1631 states and 2107 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-14 19:13:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:26,158 INFO L93 Difference]: Finished difference Result 1631 states and 2107 transitions. [2021-12-14 19:13:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2021-12-14 19:13:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:26,164 INFO L225 Difference]: With dead ends: 1631 [2021-12-14 19:13:26,164 INFO L226 Difference]: Without dead ends: 1629 [2021-12-14 19:13:26,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:26,165 INFO L933 BasicCegarLoop]: 1058 mSDtfsCounter, 1540 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:26,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1668 Valid, 2329 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-14 19:13:26,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2021-12-14 19:13:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2021-12-14 19:13:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1049 states have (on average 1.1630123927550047) internal successors, (1220), 1086 states have internal predecessors, (1220), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2105 transitions. [2021-12-14 19:13:26,234 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2105 transitions. Word has length 144 [2021-12-14 19:13:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:26,234 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2105 transitions. [2021-12-14 19:13:26,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-14 19:13:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2105 transitions. [2021-12-14 19:13:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-14 19:13:26,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:26,235 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:26,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 19:13:26,235 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1382898488, now seen corresponding path program 1 times [2021-12-14 19:13:26,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:26,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675216276] [2021-12-14 19:13:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:26,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:13:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:13:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:13:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-14 19:13:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:26,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:26,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675216276] [2021-12-14 19:13:26,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675216276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:26,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:26,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:26,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071064353] [2021-12-14 19:13:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:26,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:26,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:26,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:26,416 INFO L87 Difference]: Start difference. First operand 1629 states and 2105 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-14 19:13:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:27,584 INFO L93 Difference]: Finished difference Result 1629 states and 2105 transitions. [2021-12-14 19:13:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:27,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2021-12-14 19:13:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:27,589 INFO L225 Difference]: With dead ends: 1629 [2021-12-14 19:13:27,589 INFO L226 Difference]: Without dead ends: 1627 [2021-12-14 19:13:27,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:27,590 INFO L933 BasicCegarLoop]: 1056 mSDtfsCounter, 1534 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:27,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1661 Valid, 2327 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-14 19:13:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-12-14 19:13:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2021-12-14 19:13:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1048 states have (on average 1.1622137404580153) internal successors, (1218), 1084 states have internal predecessors, (1218), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2103 transitions. [2021-12-14 19:13:27,660 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2103 transitions. Word has length 150 [2021-12-14 19:13:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:27,661 INFO L470 AbstractCegarLoop]: Abstraction has 1627 states and 2103 transitions. [2021-12-14 19:13:27,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-14 19:13:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2103 transitions. [2021-12-14 19:13:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-14 19:13:27,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:27,662 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:27,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 19:13:27,662 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1820291379, now seen corresponding path program 1 times [2021-12-14 19:13:27,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:27,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563987683] [2021-12-14 19:13:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:27,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:13:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:13:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:13:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-14 19:13:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 19:13:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:27,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:27,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563987683] [2021-12-14 19:13:27,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563987683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:27,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:27,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:27,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891762001] [2021-12-14 19:13:27,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:27,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:27,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:27,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:27,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:27,856 INFO L87 Difference]: Start difference. First operand 1627 states and 2103 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-14 19:13:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:28,968 INFO L93 Difference]: Finished difference Result 1627 states and 2103 transitions. [2021-12-14 19:13:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:28,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2021-12-14 19:13:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:28,972 INFO L225 Difference]: With dead ends: 1627 [2021-12-14 19:13:28,972 INFO L226 Difference]: Without dead ends: 1625 [2021-12-14 19:13:28,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:28,973 INFO L933 BasicCegarLoop]: 1054 mSDtfsCounter, 1528 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2325 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:28,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1654 Valid, 2325 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-14 19:13:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2021-12-14 19:13:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1625. [2021-12-14 19:13:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1047 states have (on average 1.1614135625596944) internal successors, (1216), 1082 states have internal predecessors, (1216), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2101 transitions. [2021-12-14 19:13:29,041 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2101 transitions. Word has length 156 [2021-12-14 19:13:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:29,041 INFO L470 AbstractCegarLoop]: Abstraction has 1625 states and 2101 transitions. [2021-12-14 19:13:29,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-14 19:13:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2101 transitions. [2021-12-14 19:13:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-14 19:13:29,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:29,043 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:29,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 19:13:29,043 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1658758885, now seen corresponding path program 1 times [2021-12-14 19:13:29,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:29,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455514609] [2021-12-14 19:13:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:29,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:13:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:13:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:13:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-14 19:13:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 19:13:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-14 19:13:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:29,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:29,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455514609] [2021-12-14 19:13:29,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455514609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:29,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:29,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:29,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290893332] [2021-12-14 19:13:29,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:29,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:29,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:29,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:29,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:29,187 INFO L87 Difference]: Start difference. First operand 1625 states and 2101 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-14 19:13:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:30,411 INFO L93 Difference]: Finished difference Result 1625 states and 2101 transitions. [2021-12-14 19:13:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:30,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2021-12-14 19:13:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:30,415 INFO L225 Difference]: With dead ends: 1625 [2021-12-14 19:13:30,416 INFO L226 Difference]: Without dead ends: 1623 [2021-12-14 19:13:30,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:30,416 INFO L933 BasicCegarLoop]: 1052 mSDtfsCounter, 1522 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:30,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1647 Valid, 2323 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-14 19:13:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-12-14 19:13:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1623. [2021-12-14 19:13:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1046 states have (on average 1.1606118546845123) internal successors, (1214), 1080 states have internal predecessors, (1214), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2099 transitions. [2021-12-14 19:13:30,510 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2099 transitions. Word has length 162 [2021-12-14 19:13:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:30,510 INFO L470 AbstractCegarLoop]: Abstraction has 1623 states and 2099 transitions. [2021-12-14 19:13:30,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-14 19:13:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2099 transitions. [2021-12-14 19:13:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-12-14 19:13:30,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:30,512 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:30,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 19:13:30,513 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash 243227707, now seen corresponding path program 1 times [2021-12-14 19:13:30,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:30,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069123375] [2021-12-14 19:13:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:30,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 19:13:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-14 19:13:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-14 19:13:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 19:13:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-14 19:13:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 19:13:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-14 19:13:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 19:13:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 19:13:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-14 19:13:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-14 19:13:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-14 19:13:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-14 19:13:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-14 19:13:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-14 19:13:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-14 19:13:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-14 19:13:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-14 19:13:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-14 19:13:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-14 19:13:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-14 19:13:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 19:13:30,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:30,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069123375] [2021-12-14 19:13:30,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069123375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:30,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:30,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:13:30,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364585732] [2021-12-14 19:13:30,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:30,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:13:30,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:30,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:13:30,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:13:30,720 INFO L87 Difference]: Start difference. First operand 1623 states and 2099 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-14 19:13:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:31,879 INFO L93 Difference]: Finished difference Result 1623 states and 2099 transitions. [2021-12-14 19:13:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:13:31,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2021-12-14 19:13:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:31,883 INFO L225 Difference]: With dead ends: 1623 [2021-12-14 19:13:31,884 INFO L226 Difference]: Without dead ends: 1621 [2021-12-14 19:13:31,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:13:31,884 INFO L933 BasicCegarLoop]: 1050 mSDtfsCounter, 1516 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:31,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1640 Valid, 2321 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-14 19:13:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2021-12-14 19:13:31,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2021-12-14 19:13:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1045 states have (on average 1.1598086124401914) internal successors, (1212), 1078 states have internal predecessors, (1212), 443 states have call successors, (443), 130 states have call predecessors, (443), 127 states have return successors, (442), 434 states have call predecessors, (442), 441 states have call successors, (442) [2021-12-14 19:13:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2097 transitions. [2021-12-14 19:13:31,958 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2097 transitions. Word has length 168 [2021-12-14 19:13:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:31,958 INFO L470 AbstractCegarLoop]: Abstraction has 1621 states and 2097 transitions. [2021-12-14 19:13:31,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-14 19:13:31,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2097 transitions. [2021-12-14 19:13:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-14 19:13:31,960 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:31,960 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:31,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 19:13:31,960 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1956759216, now seen corresponding path program 1 times [2021-12-14 19:13:31,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:31,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600373963] [2021-12-14 19:13:31,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:31,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:13:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 19:13:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:13:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:13:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:13:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 19:13:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-14 19:13:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:13:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 19:13:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-14 19:13:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-14 19:13:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-12-14 19:13:32,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:32,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600373963] [2021-12-14 19:13:32,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600373963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:13:32,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:13:32,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-14 19:13:32,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192688882] [2021-12-14 19:13:32,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:13:32,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 19:13:32,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:13:32,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 19:13:32,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:13:32,289 INFO L87 Difference]: Start difference. First operand 1621 states and 2097 transitions. Second operand has 13 states, 12 states have (on average 6.916666666666667) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2021-12-14 19:13:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:13:40,477 INFO L93 Difference]: Finished difference Result 2815 states and 3640 transitions. [2021-12-14 19:13:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-14 19:13:40,477 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.916666666666667) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 217 [2021-12-14 19:13:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:13:40,498 INFO L225 Difference]: With dead ends: 2815 [2021-12-14 19:13:40,498 INFO L226 Difference]: Without dead ends: 2813 [2021-12-14 19:13:40,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2021-12-14 19:13:40,500 INFO L933 BasicCegarLoop]: 1997 mSDtfsCounter, 6131 mSDsluCounter, 5140 mSDsCounter, 0 mSdLazyCounter, 8801 mSolverCounterSat, 5320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6419 SdHoareTripleChecker+Valid, 7137 SdHoareTripleChecker+Invalid, 14121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5320 IncrementalHoareTripleChecker+Valid, 8801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:13:40,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6419 Valid, 7137 Invalid, 14121 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5320 Valid, 8801 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2021-12-14 19:13:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2021-12-14 19:13:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2343. [2021-12-14 19:13:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1512 states have (on average 1.164021164021164) internal successors, (1760), 1561 states have internal predecessors, (1760), 642 states have call successors, (642), 185 states have call predecessors, (642), 183 states have return successors, (642), 628 states have call predecessors, (642), 640 states have call successors, (642) [2021-12-14 19:13:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3044 transitions. [2021-12-14 19:13:40,619 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3044 transitions. Word has length 217 [2021-12-14 19:13:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:13:40,620 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3044 transitions. [2021-12-14 19:13:40,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.916666666666667) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (24), 7 states have call predecessors, (24), 2 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2021-12-14 19:13:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3044 transitions. [2021-12-14 19:13:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-14 19:13:40,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:13:40,622 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:13:40,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 19:13:40,622 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-12-14 19:13:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:13:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -603449519, now seen corresponding path program 1 times [2021-12-14 19:13:40,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:13:40,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356829519] [2021-12-14 19:13:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:40,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:13:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:13:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 19:13:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 19:13:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 19:13:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-14 19:13:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 19:13:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 19:13:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 19:13:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-14 19:13:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 19:13:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 19:13:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 19:13:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:13:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 19:13:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-14 19:13:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 19:13:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-14 19:13:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-14 19:13:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 19:13:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-14 19:13:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-12-14 19:13:41,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:13:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356829519] [2021-12-14 19:13:41,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356829519] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:13:41,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80933267] [2021-12-14 19:13:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:13:41,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:13:41,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:13:41,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:13:41,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:13:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:13:41,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 2094 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-14 19:13:41,590 INFO L286 TraceCheckSpWp]: Computing forward predicates...