./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---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-tmp.no-commuhash-c3fed41 [2021-12-16 05:26:56,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:26:56,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:26:56,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:26:56,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:26:56,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:26:56,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:26:56,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:26:56,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:26:56,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:26:56,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:26:56,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:26:56,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:26:56,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:26:56,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:26:56,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:26:56,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:26:56,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:26:56,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:26:56,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:26:56,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:26:56,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:26:56,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:26:56,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:26:57,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:26:57,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:26:57,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:26:57,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:26:57,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:26:57,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:26:57,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:26:57,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:26:57,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:26:57,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:26:57,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:26:57,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:26:57,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:26:57,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:26:57,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:26:57,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:26:57,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:26:57,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-16 05:26:57,042 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:26:57,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:26:57,043 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:26:57,043 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:26:57,044 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:26:57,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:26:57,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:26:57,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:26:57,046 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:26:57,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:26:57,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:26:57,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:26:57,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 05:26:57,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:26:57,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 05:26:57,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 05:26:57,047 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:26:57,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 05:26:57,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:26:57,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:26:57,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:26:57,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:26:57,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:26:57,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:26:57,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 05:26:57,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:26:57,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:26:57,049 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 05:26:57,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 05:26:57,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 05:26:57,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:26:57,050 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-16 05:26:57,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:26:57,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:26:57,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:26:57,310 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:26:57,311 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:26:57,312 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-16 05:26:57,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16726495/21e99739dc8b4546b40bcfba022e5eb1/FLAG334607354 [2021-12-16 05:26:58,036 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:26:58,037 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-16 05:26:58,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16726495/21e99739dc8b4546b40bcfba022e5eb1/FLAG334607354 [2021-12-16 05:26:58,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16726495/21e99739dc8b4546b40bcfba022e5eb1 [2021-12-16 05:26:58,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:26:58,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:26:58,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:26:58,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:26:58,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:26:58,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:26:58" (1/1) ... [2021-12-16 05:26:58,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7586617a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:26:58, skipping insertion in model container [2021-12-16 05:26:58,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:26:58" (1/1) ... [2021-12-16 05:26:58,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:26:58,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:27:00,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310055,310068] [2021-12-16 05:27:00,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310201,310214] [2021-12-16 05:27:00,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310366,310379] [2021-12-16 05:27:00,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2021-12-16 05:27:00,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2021-12-16 05:27:00,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2021-12-16 05:27:00,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2021-12-16 05:27:00,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2021-12-16 05:27:00,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2021-12-16 05:27:00,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2021-12-16 05:27:00,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2021-12-16 05:27:00,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2021-12-16 05:27:00,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2021-12-16 05:27:00,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2021-12-16 05:27:00,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2021-12-16 05:27:00,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2021-12-16 05:27:00,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2021-12-16 05:27:00,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2021-12-16 05:27:00,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2021-12-16 05:27:00,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2021-12-16 05:27:00,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2021-12-16 05:27:00,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2021-12-16 05:27:00,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2021-12-16 05:27:00,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2021-12-16 05:27:00,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2021-12-16 05:27:00,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2021-12-16 05:27:00,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2021-12-16 05:27:00,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2021-12-16 05:27:00,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2021-12-16 05:27:00,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2021-12-16 05:27:00,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2021-12-16 05:27:00,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2021-12-16 05:27:00,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2021-12-16 05:27:00,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315072,315085] [2021-12-16 05:27:00,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315228,315241] [2021-12-16 05:27:00,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315392,315405] [2021-12-16 05:27:00,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2021-12-16 05:27:00,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2021-12-16 05:27:00,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2021-12-16 05:27:00,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2021-12-16 05:27:00,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2021-12-16 05:27:00,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2021-12-16 05:27:00,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2021-12-16 05:27:00,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2021-12-16 05:27:00,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2021-12-16 05:27:00,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2021-12-16 05:27:00,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2021-12-16 05:27:00,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2021-12-16 05:27:00,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2021-12-16 05:27:00,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2021-12-16 05:27:00,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2021-12-16 05:27:00,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2021-12-16 05:27:00,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2021-12-16 05:27:00,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2021-12-16 05:27:00,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2021-12-16 05:27:00,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2021-12-16 05:27:00,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2021-12-16 05:27:00,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2021-12-16 05:27:00,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2021-12-16 05:27:00,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2021-12-16 05:27:00,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2021-12-16 05:27:00,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2021-12-16 05:27:00,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2021-12-16 05:27:00,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2021-12-16 05:27:00,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2021-12-16 05:27:00,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2021-12-16 05:27:00,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2021-12-16 05:27:00,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320338,320351] [2021-12-16 05:27:00,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320487,320500] [2021-12-16 05:27:00,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320639,320652] [2021-12-16 05:27:00,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320787,320800] [2021-12-16 05:27:00,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320940,320953] [2021-12-16 05:27:00,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321091,321104] [2021-12-16 05:27:00,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321241,321254] [2021-12-16 05:27:00,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321388,321401] [2021-12-16 05:27:00,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321539,321552] [2021-12-16 05:27:00,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321690,321703] [2021-12-16 05:27:00,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[321838,321851] [2021-12-16 05:27:00,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322004,322017] [2021-12-16 05:27:00,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322173,322186] [2021-12-16 05:27:00,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2021-12-16 05:27:00,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2021-12-16 05:27:00,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2021-12-16 05:27:00,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:27:00,469 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:27:00,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310524,310537] [2021-12-16 05:27:00,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310682,310695] [2021-12-16 05:27:00,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[310840,310853] [2021-12-16 05:27:00,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311000,311013] [2021-12-16 05:27:00,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311159,311172] [2021-12-16 05:27:00,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311298,311311] [2021-12-16 05:27:00,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311440,311453] [2021-12-16 05:27:00,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311589,311602] [2021-12-16 05:27:00,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311728,311741] [2021-12-16 05:27:00,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[311883,311896] [2021-12-16 05:27:00,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312043,312056] [2021-12-16 05:27:00,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312194,312207] [2021-12-16 05:27:00,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312345,312358] [2021-12-16 05:27:00,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312497,312510] [2021-12-16 05:27:00,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312646,312659] [2021-12-16 05:27:00,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312794,312807] [2021-12-16 05:27:00,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[312951,312964] [2021-12-16 05:27:00,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313100,313113] [2021-12-16 05:27:00,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313256,313269] [2021-12-16 05:27:00,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313409,313422] [2021-12-16 05:27:00,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313555,313568] [2021-12-16 05:27:00,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313698,313711] [2021-12-16 05:27:00,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313850,313863] [2021-12-16 05:27:00,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[313996,314009] [2021-12-16 05:27:00,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314141,314154] [2021-12-16 05:27:00,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314295,314308] [2021-12-16 05:27:00,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314446,314459] [2021-12-16 05:27:00,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314601,314614] [2021-12-16 05:27:00,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314753,314766] [2021-12-16 05:27:00,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[314908,314921] [2021-12-16 05:27:00,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315534,315547] [2021-12-16 05:27:00,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315692,315705] [2021-12-16 05:27:00,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[315859,315872] [2021-12-16 05:27:00,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316018,316031] [2021-12-16 05:27:00,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316177,316190] [2021-12-16 05:27:00,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316326,316339] [2021-12-16 05:27:00,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316473,316486] [2021-12-16 05:27:00,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316612,316625] [2021-12-16 05:27:00,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316775,316788] [2021-12-16 05:27:00,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[316941,316954] [2021-12-16 05:27:00,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317105,317118] [2021-12-16 05:27:00,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317270,317283] [2021-12-16 05:27:00,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317435,317448] [2021-12-16 05:27:00,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317601,317614] [2021-12-16 05:27:00,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317766,317779] [2021-12-16 05:27:00,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[317933,317946] [2021-12-16 05:27:00,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318093,318106] [2021-12-16 05:27:00,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318255,318268] [2021-12-16 05:27:00,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318414,318427] [2021-12-16 05:27:00,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318560,318573] [2021-12-16 05:27:00,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318703,318716] [2021-12-16 05:27:00,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318847,318860] [2021-12-16 05:27:00,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[318990,319003] [2021-12-16 05:27:00,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319134,319147] [2021-12-16 05:27:00,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319275,319288] [2021-12-16 05:27:00,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319413,319426] [2021-12-16 05:27:00,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319571,319584] [2021-12-16 05:27:00,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319730,319743] [2021-12-16 05:27:00,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[319886,319899] [2021-12-16 05:27:00,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320035,320048] [2021-12-16 05:27:00,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[320187,320200] [2021-12-16 05:27:00,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-16 05:27:00,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322340,322353] [2021-12-16 05:27:00,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322508,322521] [2021-12-16 05:27:00,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322658,322671] [2021-12-16 05:27:00,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322805,322818] [2021-12-16 05:27:00,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[322966,322979] [2021-12-16 05:27:00,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323136,323149] [2021-12-16 05:27:00,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i[323298,323311] [2021-12-16 05:27:00,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:27:00,851 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:27:00,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00 WrapperNode [2021-12-16 05:27:00,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:27:00,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:27:00,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:27:00,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:27:00,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:00,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:00,994 INFO L137 Inliner]: procedures = 571, calls = 1721, calls flagged for inlining = 244, calls inlined = 125, statements flattened = 2362 [2021-12-16 05:27:00,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:27:00,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:27:00,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:27:00,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:27:01,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:01,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:01,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:01,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:01,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:01,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:01,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:01,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:27:01,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:27:01,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:27:01,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:27:01,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (1/1) ... [2021-12-16 05:27:01,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:27:01,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:27:01,169 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-16 05:27:01,200 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-16 05:27:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-16 05:27:01,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-16 05:27:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2021-12-16 05:27:01,220 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2021-12-16 05:27:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-16 05:27:01,221 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-16 05:27:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-16 05:27:01,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-16 05:27:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2021-12-16 05:27:01,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2021-12-16 05:27:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-16 05:27:01,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-16 05:27:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2021-12-16 05:27:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2021-12-16 05:27:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-16 05:27:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-16 05:27:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-16 05:27:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-16 05:27:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32 [2021-12-16 05:27:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32 [2021-12-16 05:27:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-16 05:27:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-16 05:27:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32 [2021-12-16 05:27:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32 [2021-12-16 05:27:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-16 05:27:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-16 05:27:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-16 05:27:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-16 05:27:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:27:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2021-12-16 05:27:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2021-12-16 05:27:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-16 05:27:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-16 05:27:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-16 05:27:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-16 05:27:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2021-12-16 05:27:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mtx_of_vme_dma_resource [2021-12-16 05:27:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2021-12-16 05:27:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2021-12-16 05:27:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2021-12-16 05:27:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2021-12-16 05:27:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-16 05:27:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-16 05:27:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-16 05:27:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-16 05:27:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-16 05:27:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-16 05:27:01,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-16 05:27:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 05:27:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-16 05:27:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-16 05:27:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-16 05:27:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-16 05:27:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-16 05:27:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-16 05:27:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2021-12-16 05:27:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2021-12-16 05:27:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-16 05:27:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-16 05:27:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2021-12-16 05:27:01,227 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2021-12-16 05:27:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2021-12-16 05:27:01,227 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2021-12-16 05:27:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2021-12-16 05:27:01,227 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2021-12-16 05:27:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-16 05:27:01,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-16 05:27:01,227 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2021-12-16 05:27:01,228 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2021-12-16 05:27:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-16 05:27:01,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-16 05:27:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_phys [2021-12-16 05:27:01,257 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_phys [2021-12-16 05:27:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:27:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-12-16 05:27:01,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-12-16 05:27:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:27:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-16 05:27:01,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-16 05:27:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:27:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-12-16 05:27:01,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-12-16 05:27:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-16 05:27:01,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-16 05:27:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2021-12-16 05:27:01,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mtx_of_vme_dma_resource [2021-12-16 05:27:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-16 05:27:01,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-16 05:27:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-12-16 05:27:01,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-12-16 05:27:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2021-12-16 05:27:01,259 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2021-12-16 05:27:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:27:01,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:27:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-16 05:27:01,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-16 05:27:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-16 05:27:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-16 05:27:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2021-12-16 05:27:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2021-12-16 05:27:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-16 05:27:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-16 05:27:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-16 05:27:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-16 05:27:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 05:27:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-16 05:27:01,260 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-16 05:27:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-16 05:27:01,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-16 05:27:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:27:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 05:27:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_slot_get [2021-12-16 05:27:01,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_slot_get [2021-12-16 05:27:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2021-12-16 05:27:01,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2021-12-16 05:27:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-16 05:27:01,261 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-16 05:27:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2021-12-16 05:27:01,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2021-12-16 05:27:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-16 05:27:01,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-16 05:27:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-16 05:27:01,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-16 05:27:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_irq_exit [2021-12-16 05:27:01,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_irq_exit [2021-12-16 05:27:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-16 05:27:01,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-16 05:27:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-16 05:27:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-16 05:27:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-16 05:27:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-16 05:27:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-16 05:27:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-16 05:27:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_crcsr_exit [2021-12-16 05:27:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_crcsr_exit [2021-12-16 05:27:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-16 05:27:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-16 05:27:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-16 05:27:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-16 05:27:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-16 05:27:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-16 05:27:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:27:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_remove [2021-12-16 05:27:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_remove [2021-12-16 05:27:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-16 05:27:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-16 05:27:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-16 05:27:01,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-16 05:27:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-16 05:27:01,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-16 05:27:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-12-16 05:27:01,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-12-16 05:27:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-16 05:27:01,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-16 05:27:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-16 05:27:01,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-16 05:27:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure ca91cx42_dma_busy [2021-12-16 05:27:01,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ca91cx42_dma_busy [2021-12-16 05:27:01,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:27:01,587 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:27:01,589 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:27:01,696 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-16 05:27:03,336 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:27:03,345 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:27:03,345 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 05:27:03,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:27:03 BoogieIcfgContainer [2021-12-16 05:27:03,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:27:03,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:27:03,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:27:03,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:27:03,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:26:58" (1/3) ... [2021-12-16 05:27:03,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203f0c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:27:03, skipping insertion in model container [2021-12-16 05:27:03,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:00" (2/3) ... [2021-12-16 05:27:03,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203f0c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:27:03, skipping insertion in model container [2021-12-16 05:27:03,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:27:03" (3/3) ... [2021-12-16 05:27:03,353 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--vme--bridges--vme_ca91cx42.ko.cil.i [2021-12-16 05:27:03,356 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:27:03,356 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-16 05:27:03,387 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:27:03,391 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-16 05:27:03,391 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-16 05:27:03,413 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-16 05:27:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 05:27:03,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:03,418 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-16 05:27:03,419 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-16 05:27:03,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash 628355767, now seen corresponding path program 1 times [2021-12-16 05:27:03,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:03,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142291048] [2021-12-16 05:27:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:03,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:03,911 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-16 05:27:03,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:03,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142291048] [2021-12-16 05:27:03,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142291048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:03,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:03,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:03,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300892307] [2021-12-16 05:27:03,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:03,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:03,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:03,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:03,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:03,945 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-16 05:27:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:06,768 INFO L93 Difference]: Finished difference Result 2805 states and 3794 transitions. [2021-12-16 05:27:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:27:06,772 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-16 05:27:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:06,795 INFO L225 Difference]: With dead ends: 2805 [2021-12-16 05:27:06,795 INFO L226 Difference]: Without dead ends: 1852 [2021-12-16 05:27:06,801 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-16 05:27:06,803 INFO L933 BasicCegarLoop]: 1476 mSDtfsCounter, 2409 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 1418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:06,804 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.5s Time] [2021-12-16 05:27:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-12-16 05:27:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1659. [2021-12-16 05:27:06,913 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-16 05:27:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2153 transitions. [2021-12-16 05:27:06,937 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2153 transitions. Word has length 64 [2021-12-16 05:27:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:06,947 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2153 transitions. [2021-12-16 05:27:06,948 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-16 05:27:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2153 transitions. [2021-12-16 05:27:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-16 05:27:06,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:06,950 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-16 05:27:06,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:27:06,951 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-16 05:27:06,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1959425756, now seen corresponding path program 1 times [2021-12-16 05:27:06,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:06,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736035281] [2021-12-16 05:27:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:06,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:07,144 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-16 05:27:07,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:07,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736035281] [2021-12-16 05:27:07,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736035281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:07,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:07,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:07,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852375282] [2021-12-16 05:27:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:07,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:07,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:07,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:07,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:07,147 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-16 05:27:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:08,478 INFO L93 Difference]: Finished difference Result 1659 states and 2153 transitions. [2021-12-16 05:27:08,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:08,478 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-16 05:27:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:08,485 INFO L225 Difference]: With dead ends: 1659 [2021-12-16 05:27:08,485 INFO L226 Difference]: Without dead ends: 1657 [2021-12-16 05:27:08,486 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-16 05:27:08,486 INFO L933 BasicCegarLoop]: 1102 mSDtfsCounter, 1652 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:08,487 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.2s Time] [2021-12-16 05:27:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-12-16 05:27:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-12-16 05:27:08,530 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-16 05:27:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2151 transitions. [2021-12-16 05:27:08,536 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2151 transitions. Word has length 70 [2021-12-16 05:27:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:08,537 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2151 transitions. [2021-12-16 05:27:08,537 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-16 05:27:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2151 transitions. [2021-12-16 05:27:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-16 05:27:08,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:08,539 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-16 05:27:08,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:27:08,539 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-16 05:27:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1402994656, now seen corresponding path program 1 times [2021-12-16 05:27:08,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:08,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659703511] [2021-12-16 05:27:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:08,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:08,681 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-16 05:27:08,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:08,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659703511] [2021-12-16 05:27:08,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659703511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:08,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:08,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:08,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806013962] [2021-12-16 05:27:08,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:08,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:08,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:08,683 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-16 05:27:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:09,992 INFO L93 Difference]: Finished difference Result 1657 states and 2151 transitions. [2021-12-16 05:27:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:09,993 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-16 05:27:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:09,999 INFO L225 Difference]: With dead ends: 1657 [2021-12-16 05:27:09,999 INFO L226 Difference]: Without dead ends: 1655 [2021-12-16 05:27:10,000 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-16 05:27:10,001 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 1646 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:10,001 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.2s Time] [2021-12-16 05:27:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2021-12-16 05:27:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2021-12-16 05:27:10,057 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-16 05:27:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2149 transitions. [2021-12-16 05:27:10,064 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2149 transitions. Word has length 76 [2021-12-16 05:27:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:10,064 INFO L470 AbstractCegarLoop]: Abstraction has 1655 states and 2149 transitions. [2021-12-16 05:27:10,064 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-16 05:27:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2149 transitions. [2021-12-16 05:27:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-16 05:27:10,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:10,066 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-16 05:27:10,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:27:10,067 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-16 05:27:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1342220052, now seen corresponding path program 1 times [2021-12-16 05:27:10,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:10,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501809478] [2021-12-16 05:27:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:10,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:10,255 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-16 05:27:10,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:10,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501809478] [2021-12-16 05:27:10,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501809478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:10,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:10,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:10,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632345598] [2021-12-16 05:27:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:10,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:10,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:10,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:10,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:10,258 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-16 05:27:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:11,629 INFO L93 Difference]: Finished difference Result 1655 states and 2149 transitions. [2021-12-16 05:27:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:11,630 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-16 05:27:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:11,637 INFO L225 Difference]: With dead ends: 1655 [2021-12-16 05:27:11,638 INFO L226 Difference]: Without dead ends: 1653 [2021-12-16 05:27:11,638 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-16 05:27:11,640 INFO L933 BasicCegarLoop]: 1098 mSDtfsCounter, 1640 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:11,641 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.3s Time] [2021-12-16 05:27:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-12-16 05:27:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2021-12-16 05:27:11,737 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-16 05:27:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2147 transitions. [2021-12-16 05:27:11,744 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2147 transitions. Word has length 82 [2021-12-16 05:27:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:11,744 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2147 transitions. [2021-12-16 05:27:11,744 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-16 05:27:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2147 transitions. [2021-12-16 05:27:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-16 05:27:11,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:11,746 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-16 05:27:11,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:27:11,747 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-16 05:27:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash 148000434, now seen corresponding path program 1 times [2021-12-16 05:27:11,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:11,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753817156] [2021-12-16 05:27:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:11,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:11,917 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-16 05:27:11,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753817156] [2021-12-16 05:27:11,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753817156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:11,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:11,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:11,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829309122] [2021-12-16 05:27:11,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:11,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:11,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:11,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:11,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:11,920 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-16 05:27:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:13,173 INFO L93 Difference]: Finished difference Result 1653 states and 2147 transitions. [2021-12-16 05:27:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:13,174 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-16 05:27:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:13,180 INFO L225 Difference]: With dead ends: 1653 [2021-12-16 05:27:13,180 INFO L226 Difference]: Without dead ends: 1651 [2021-12-16 05:27:13,181 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-16 05:27:13,182 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-16 05:27:13,182 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-16 05:27:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-12-16 05:27:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2021-12-16 05:27:13,223 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-16 05:27:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2145 transitions. [2021-12-16 05:27:13,229 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2145 transitions. Word has length 88 [2021-12-16 05:27:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:13,230 INFO L470 AbstractCegarLoop]: Abstraction has 1651 states and 2145 transitions. [2021-12-16 05:27:13,230 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-16 05:27:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2145 transitions. [2021-12-16 05:27:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-16 05:27:13,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:13,231 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-16 05:27:13,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:27:13,231 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-16 05:27:13,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1268832777, now seen corresponding path program 1 times [2021-12-16 05:27:13,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:13,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424152875] [2021-12-16 05:27:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:13,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 05:27:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 05:27:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 05:27:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-16 05:27:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:13,530 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-16 05:27:13,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:13,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424152875] [2021-12-16 05:27:13,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424152875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:13,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:13,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:27:13,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134634922] [2021-12-16 05:27:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:13,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:27:13,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:27:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:27:13,536 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-16 05:27:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:15,625 INFO L93 Difference]: Finished difference Result 3395 states and 4442 transitions. [2021-12-16 05:27:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:27:15,626 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-16 05:27:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:15,633 INFO L225 Difference]: With dead ends: 3395 [2021-12-16 05:27:15,633 INFO L226 Difference]: Without dead ends: 1765 [2021-12-16 05:27:15,637 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-16 05:27:15,638 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, 1.9s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:15,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2147 Valid, 3783 Invalid, 3963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1327 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-16 05:27:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2021-12-16 05:27:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1669. [2021-12-16 05:27:15,719 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-16 05:27:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2155 transitions. [2021-12-16 05:27:15,723 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2155 transitions. Word has length 116 [2021-12-16 05:27:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:15,724 INFO L470 AbstractCegarLoop]: Abstraction has 1669 states and 2155 transitions. [2021-12-16 05:27:15,724 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-16 05:27:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2155 transitions. [2021-12-16 05:27:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-16 05:27:15,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:15,725 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-16 05:27:15,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:27:15,725 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-16 05:27:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1268773195, now seen corresponding path program 1 times [2021-12-16 05:27:15,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:15,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751081694] [2021-12-16 05:27:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:15,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 05:27:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 05:27:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 05:27:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-16 05:27:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:15,864 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-16 05:27:15,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:15,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751081694] [2021-12-16 05:27:15,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751081694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:15,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:15,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:27:15,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204372786] [2021-12-16 05:27:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:15,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:27:15,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:27:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:27:15,866 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-16 05:27:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:17,556 INFO L93 Difference]: Finished difference Result 1765 states and 2308 transitions. [2021-12-16 05:27:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:27:17,556 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-16 05:27:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:17,562 INFO L225 Difference]: With dead ends: 1765 [2021-12-16 05:27:17,563 INFO L226 Difference]: Without dead ends: 1763 [2021-12-16 05:27:17,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-16 05:27:17,565 INFO L933 BasicCegarLoop]: 1087 mSDtfsCounter, 1210 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 1088 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:17,565 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.6s Time] [2021-12-16 05:27:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2021-12-16 05:27:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1667. [2021-12-16 05:27:17,651 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-16 05:27:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2152 transitions. [2021-12-16 05:27:17,656 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2152 transitions. Word has length 116 [2021-12-16 05:27:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:17,656 INFO L470 AbstractCegarLoop]: Abstraction has 1667 states and 2152 transitions. [2021-12-16 05:27:17,656 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-16 05:27:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2152 transitions. [2021-12-16 05:27:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-16 05:27:17,658 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:17,659 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-16 05:27:17,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:27:17,660 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-16 05:27:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash -93320400, now seen corresponding path program 1 times [2021-12-16 05:27:17,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:17,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093174793] [2021-12-16 05:27:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:17,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:17,801 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-16 05:27:17,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:17,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093174793] [2021-12-16 05:27:17,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093174793] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:17,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:17,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:17,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164096859] [2021-12-16 05:27:17,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:17,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:17,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:17,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:17,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:17,803 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-16 05:27:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:19,004 INFO L93 Difference]: Finished difference Result 1667 states and 2152 transitions. [2021-12-16 05:27:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:19,005 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-16 05:27:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:19,011 INFO L225 Difference]: With dead ends: 1667 [2021-12-16 05:27:19,011 INFO L226 Difference]: Without dead ends: 1665 [2021-12-16 05:27:19,012 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-16 05:27:19,012 INFO L933 BasicCegarLoop]: 1091 mSDtfsCounter, 1619 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:19,012 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.1s Time] [2021-12-16 05:27:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2021-12-16 05:27:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2021-12-16 05:27:19,061 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-16 05:27:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2150 transitions. [2021-12-16 05:27:19,065 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2150 transitions. Word has length 94 [2021-12-16 05:27:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:19,065 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 2150 transitions. [2021-12-16 05:27:19,065 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-16 05:27:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2150 transitions. [2021-12-16 05:27:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-16 05:27:19,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:19,067 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-16 05:27:19,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 05:27:19,067 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-16 05:27:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1533254331, now seen corresponding path program 1 times [2021-12-16 05:27:19,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974184393] [2021-12-16 05:27:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:19,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 05:27:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 05:27:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 05:27:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-16 05:27:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:19,247 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-16 05:27:19,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974184393] [2021-12-16 05:27:19,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974184393] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:19,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:19,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:19,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710500803] [2021-12-16 05:27:19,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:19,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:19,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:19,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:19,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:19,249 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-16 05:27:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:20,537 INFO L93 Difference]: Finished difference Result 3399 states and 4433 transitions. [2021-12-16 05:27:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:20,537 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-16 05:27:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:20,544 INFO L225 Difference]: With dead ends: 3399 [2021-12-16 05:27:20,545 INFO L226 Difference]: Without dead ends: 1755 [2021-12-16 05:27:20,549 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-16 05:27:20,549 INFO L933 BasicCegarLoop]: 1081 mSDtfsCounter, 2011 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 1321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:20,550 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.2s Time] [2021-12-16 05:27:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-12-16 05:27:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1659. [2021-12-16 05:27:20,610 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-16 05:27:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2141 transitions. [2021-12-16 05:27:20,615 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2141 transitions. Word has length 120 [2021-12-16 05:27:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:20,615 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2141 transitions. [2021-12-16 05:27:20,615 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-16 05:27:20,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2141 transitions. [2021-12-16 05:27:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-16 05:27:20,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:20,616 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-16 05:27:20,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 05:27:20,617 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-16 05:27:20,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1709105799, now seen corresponding path program 1 times [2021-12-16 05:27:20,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:20,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877240715] [2021-12-16 05:27:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:20,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:20,730 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-16 05:27:20,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:20,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877240715] [2021-12-16 05:27:20,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877240715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:20,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:20,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:20,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3818853] [2021-12-16 05:27:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:20,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:20,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:20,733 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-16 05:27:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:21,939 INFO L93 Difference]: Finished difference Result 1659 states and 2141 transitions. [2021-12-16 05:27:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:21,940 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-16 05:27:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:21,945 INFO L225 Difference]: With dead ends: 1659 [2021-12-16 05:27:21,945 INFO L226 Difference]: Without dead ends: 1657 [2021-12-16 05:27:21,946 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-16 05:27:21,946 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-16 05:27:21,946 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-16 05:27:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-12-16 05:27:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-12-16 05:27:21,993 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-16 05:27:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2139 transitions. [2021-12-16 05:27:21,997 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2139 transitions. Word has length 100 [2021-12-16 05:27:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:21,998 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2139 transitions. [2021-12-16 05:27:21,998 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-16 05:27:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2139 transitions. [2021-12-16 05:27:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-16 05:27:21,999 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:21,999 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-16 05:27:21,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:27:21,999 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-16 05:27:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2127900869, now seen corresponding path program 1 times [2021-12-16 05:27:22,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:22,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195928999] [2021-12-16 05:27:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:22,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:22,127 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-16 05:27:22,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195928999] [2021-12-16 05:27:22,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195928999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:22,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:22,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:22,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816559603] [2021-12-16 05:27:22,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:22,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:22,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:22,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:22,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:22,130 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-16 05:27:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:23,368 INFO L93 Difference]: Finished difference Result 1657 states and 2139 transitions. [2021-12-16 05:27:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:23,369 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-16 05:27:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:23,375 INFO L225 Difference]: With dead ends: 1657 [2021-12-16 05:27:23,375 INFO L226 Difference]: Without dead ends: 1655 [2021-12-16 05:27:23,376 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-16 05:27:23,376 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-16 05:27:23,377 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-16 05:27:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2021-12-16 05:27:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2021-12-16 05:27:23,436 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-16 05:27:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2137 transitions. [2021-12-16 05:27:23,440 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2137 transitions. Word has length 106 [2021-12-16 05:27:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:23,441 INFO L470 AbstractCegarLoop]: Abstraction has 1655 states and 2137 transitions. [2021-12-16 05:27:23,441 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-16 05:27:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2137 transitions. [2021-12-16 05:27:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-16 05:27:23,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:23,442 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-16 05:27:23,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 05:27:23,442 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-16 05:27:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash 508438824, now seen corresponding path program 1 times [2021-12-16 05:27:23,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:23,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731366398] [2021-12-16 05:27:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:23,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:23,626 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-16 05:27:23,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:23,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731366398] [2021-12-16 05:27:23,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731366398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:23,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:23,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:23,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799824537] [2021-12-16 05:27:23,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:23,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:23,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:23,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:23,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:23,628 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-16 05:27:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:24,807 INFO L93 Difference]: Finished difference Result 1655 states and 2137 transitions. [2021-12-16 05:27:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:24,808 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-16 05:27:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:24,813 INFO L225 Difference]: With dead ends: 1655 [2021-12-16 05:27:24,813 INFO L226 Difference]: Without dead ends: 1653 [2021-12-16 05:27:24,814 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-16 05:27:24,815 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-16 05:27:24,815 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-16 05:27:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-12-16 05:27:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2021-12-16 05:27:24,872 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-16 05:27:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2135 transitions. [2021-12-16 05:27:24,875 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2135 transitions. Word has length 108 [2021-12-16 05:27:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:24,876 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2135 transitions. [2021-12-16 05:27:24,876 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-16 05:27:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2135 transitions. [2021-12-16 05:27:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-16 05:27:24,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:24,877 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-16 05:27:24,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:27:24,877 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-16 05:27:24,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1683136456, now seen corresponding path program 1 times [2021-12-16 05:27:24,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:24,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245595418] [2021-12-16 05:27:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:24,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:24,996 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-16 05:27:24,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:24,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245595418] [2021-12-16 05:27:24,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245595418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:24,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:24,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:24,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568894923] [2021-12-16 05:27:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:24,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:24,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:24,998 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-16 05:27:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:26,287 INFO L93 Difference]: Finished difference Result 1653 states and 2135 transitions. [2021-12-16 05:27:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:26,287 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-16 05:27:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:26,293 INFO L225 Difference]: With dead ends: 1653 [2021-12-16 05:27:26,293 INFO L226 Difference]: Without dead ends: 1651 [2021-12-16 05:27:26,293 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-16 05:27:26,294 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.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:26,294 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.2s Time] [2021-12-16 05:27:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-12-16 05:27:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1651. [2021-12-16 05:27:26,347 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-16 05:27:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2133 transitions. [2021-12-16 05:27:26,351 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2133 transitions. Word has length 114 [2021-12-16 05:27:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:26,351 INFO L470 AbstractCegarLoop]: Abstraction has 1651 states and 2133 transitions. [2021-12-16 05:27:26,351 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-16 05:27:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2133 transitions. [2021-12-16 05:27:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-16 05:27:26,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:26,353 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-16 05:27:26,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 05:27:26,353 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-16 05:27:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1638841309, now seen corresponding path program 1 times [2021-12-16 05:27:26,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:26,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401563993] [2021-12-16 05:27:26,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:26,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:26,506 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-16 05:27:26,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:26,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401563993] [2021-12-16 05:27:26,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401563993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:26,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:26,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:26,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664048399] [2021-12-16 05:27:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:26,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:26,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:26,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:26,509 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-16 05:27:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:27,771 INFO L93 Difference]: Finished difference Result 1651 states and 2133 transitions. [2021-12-16 05:27:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:27,772 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-16 05:27:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:27,776 INFO L225 Difference]: With dead ends: 1651 [2021-12-16 05:27:27,777 INFO L226 Difference]: Without dead ends: 1649 [2021-12-16 05:27:27,777 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-16 05:27:27,778 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-16 05:27:27,780 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-16 05:27:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2021-12-16 05:27:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2021-12-16 05:27:27,838 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-16 05:27:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2131 transitions. [2021-12-16 05:27:27,841 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2131 transitions. Word has length 120 [2021-12-16 05:27:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:27,842 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2131 transitions. [2021-12-16 05:27:27,842 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-16 05:27:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2131 transitions. [2021-12-16 05:27:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-16 05:27:27,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:27,843 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-16 05:27:27,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 05:27:27,843 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-16 05:27:27,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash 941688793, now seen corresponding path program 1 times [2021-12-16 05:27:27,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:27,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657519550] [2021-12-16 05:27:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:27,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:27,985 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-16 05:27:27,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:27,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657519550] [2021-12-16 05:27:27,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657519550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:27,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:27,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:27,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320013334] [2021-12-16 05:27:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:27,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:27,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:27,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:27,987 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-16 05:27:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:29,200 INFO L93 Difference]: Finished difference Result 1649 states and 2131 transitions. [2021-12-16 05:27:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:29,200 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-16 05:27:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:29,206 INFO L225 Difference]: With dead ends: 1649 [2021-12-16 05:27:29,206 INFO L226 Difference]: Without dead ends: 1647 [2021-12-16 05:27:29,209 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-16 05:27:29,210 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-16 05:27:29,210 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-16 05:27:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2021-12-16 05:27:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2021-12-16 05:27:29,271 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-16 05:27:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2129 transitions. [2021-12-16 05:27:29,323 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2129 transitions. Word has length 126 [2021-12-16 05:27:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:29,324 INFO L470 AbstractCegarLoop]: Abstraction has 1647 states and 2129 transitions. [2021-12-16 05:27:29,324 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-16 05:27:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2129 transitions. [2021-12-16 05:27:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-16 05:27:29,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:29,325 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-16 05:27:29,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:27:29,326 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-16 05:27:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1629151933, now seen corresponding path program 1 times [2021-12-16 05:27:29,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:29,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490570069] [2021-12-16 05:27:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:29,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 05:27:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 05:27:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 05:27:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:29,554 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-16 05:27:29,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:29,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490570069] [2021-12-16 05:27:29,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490570069] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:29,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:29,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:27:29,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722173421] [2021-12-16 05:27:29,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:29,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:27:29,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:29,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:27:29,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:27:29,556 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-16 05:27:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:30,936 INFO L93 Difference]: Finished difference Result 3369 states and 4381 transitions. [2021-12-16 05:27:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:30,936 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-16 05:27:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:30,944 INFO L225 Difference]: With dead ends: 3369 [2021-12-16 05:27:30,944 INFO L226 Difference]: Without dead ends: 1743 [2021-12-16 05:27:30,948 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-16 05:27:30,949 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-16 05:27:30,949 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-16 05:27:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2021-12-16 05:27:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1641. [2021-12-16 05:27:31,006 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-16 05:27:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2120 transitions. [2021-12-16 05:27:31,010 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2120 transitions. Word has length 149 [2021-12-16 05:27:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:31,011 INFO L470 AbstractCegarLoop]: Abstraction has 1641 states and 2120 transitions. [2021-12-16 05:27:31,011 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-16 05:27:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2120 transitions. [2021-12-16 05:27:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-16 05:27:31,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:31,012 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-16 05:27:31,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:27:31,012 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-16 05:27:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash -547875515, now seen corresponding path program 1 times [2021-12-16 05:27:31,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:31,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472317833] [2021-12-16 05:27:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:31,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:27:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:31,153 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-16 05:27:31,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:31,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472317833] [2021-12-16 05:27:31,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472317833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:31,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:31,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:31,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454843048] [2021-12-16 05:27:31,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:31,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:31,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:31,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:31,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:31,156 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-16 05:27:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:32,358 INFO L93 Difference]: Finished difference Result 1641 states and 2120 transitions. [2021-12-16 05:27:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:32,359 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-16 05:27:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:32,364 INFO L225 Difference]: With dead ends: 1641 [2021-12-16 05:27:32,364 INFO L226 Difference]: Without dead ends: 1639 [2021-12-16 05:27:32,364 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-16 05:27:32,364 INFO L933 BasicCegarLoop]: 1067 mSDtfsCounter, 1557 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:32,365 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.1s Time] [2021-12-16 05:27:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2021-12-16 05:27:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2021-12-16 05:27:32,419 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-16 05:27:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2118 transitions. [2021-12-16 05:27:32,422 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2118 transitions. Word has length 132 [2021-12-16 05:27:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:32,423 INFO L470 AbstractCegarLoop]: Abstraction has 1639 states and 2118 transitions. [2021-12-16 05:27:32,423 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-16 05:27:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2118 transitions. [2021-12-16 05:27:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-16 05:27:32,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:32,424 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-16 05:27:32,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 05:27:32,425 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-16 05:27:32,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2144276236, now seen corresponding path program 1 times [2021-12-16 05:27:32,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:32,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824295249] [2021-12-16 05:27:32,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:32,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 05:27:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 05:27:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 05:27:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-16 05:27:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:32,593 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-16 05:27:32,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824295249] [2021-12-16 05:27:32,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824295249] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:27:32,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849640888] [2021-12-16 05:27:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:32,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:27:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:27:32,628 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-16 05:27:32,653 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-16 05:27:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 1801 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 05:27:33,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:27:33,368 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-16 05:27:33,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:27:33,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849640888] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:33,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:27:33,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2021-12-16 05:27:33,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143092601] [2021-12-16 05:27:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:33,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:27:33,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:27:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:27:33,370 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-16 05:27:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:33,449 INFO L93 Difference]: Finished difference Result 3251 states and 4198 transitions. [2021-12-16 05:27:33,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:27:33,449 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-16 05:27:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:33,454 INFO L225 Difference]: With dead ends: 3251 [2021-12-16 05:27:33,454 INFO L226 Difference]: Without dead ends: 1633 [2021-12-16 05:27:33,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:27:33,458 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-16 05:27:33,458 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-16 05:27:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-12-16 05:27:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2021-12-16 05:27:33,589 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-16 05:27:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2109 transitions. [2021-12-16 05:27:33,593 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2109 transitions. Word has length 155 [2021-12-16 05:27:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:33,594 INFO L470 AbstractCegarLoop]: Abstraction has 1633 states and 2109 transitions. [2021-12-16 05:27:33,594 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-16 05:27:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2109 transitions. [2021-12-16 05:27:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-16 05:27:33,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:33,596 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-16 05:27:33,632 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-16 05:27:33,832 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-16 05:27:33,832 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-16 05:27:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash 90130754, now seen corresponding path program 1 times [2021-12-16 05:27:33,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:33,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034448013] [2021-12-16 05:27:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:33,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:27:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:27:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:33,996 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-16 05:27:33,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:33,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034448013] [2021-12-16 05:27:33,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034448013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:33,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:33,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:33,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272640101] [2021-12-16 05:27:33,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:33,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:33,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:33,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:33,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:33,999 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-16 05:27:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:35,223 INFO L93 Difference]: Finished difference Result 1633 states and 2109 transitions. [2021-12-16 05:27:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:35,224 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-16 05:27:35,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:35,229 INFO L225 Difference]: With dead ends: 1633 [2021-12-16 05:27:35,229 INFO L226 Difference]: Without dead ends: 1631 [2021-12-16 05:27:35,229 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-16 05:27:35,230 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-16 05:27:35,230 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-16 05:27:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-12-16 05:27:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-12-16 05:27:35,299 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-16 05:27:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2107 transitions. [2021-12-16 05:27:35,303 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2107 transitions. Word has length 138 [2021-12-16 05:27:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:35,303 INFO L470 AbstractCegarLoop]: Abstraction has 1631 states and 2107 transitions. [2021-12-16 05:27:35,303 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-16 05:27:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2107 transitions. [2021-12-16 05:27:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-16 05:27:35,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:35,305 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-16 05:27:35,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 05:27:35,305 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-16 05:27:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1354484047, now seen corresponding path program 1 times [2021-12-16 05:27:35,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:35,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433548452] [2021-12-16 05:27:35,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:35,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:27:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:27:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-16 05:27:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:35,587 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-16 05:27:35,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:35,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433548452] [2021-12-16 05:27:35,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433548452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:35,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:35,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:35,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966201124] [2021-12-16 05:27:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:35,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:35,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:35,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:35,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:35,589 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-16 05:27:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:36,996 INFO L93 Difference]: Finished difference Result 1631 states and 2107 transitions. [2021-12-16 05:27:36,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:36,996 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-16 05:27:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:37,001 INFO L225 Difference]: With dead ends: 1631 [2021-12-16 05:27:37,001 INFO L226 Difference]: Without dead ends: 1629 [2021-12-16 05:27:37,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:37,003 INFO L933 BasicCegarLoop]: 1058 mSDtfsCounter, 1540 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:37,003 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.3s Time] [2021-12-16 05:27:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2021-12-16 05:27:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1629. [2021-12-16 05:27:37,079 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-16 05:27:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2105 transitions. [2021-12-16 05:27:37,083 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2105 transitions. Word has length 144 [2021-12-16 05:27:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:37,083 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2105 transitions. [2021-12-16 05:27:37,084 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-16 05:27:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2105 transitions. [2021-12-16 05:27:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-16 05:27:37,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:37,085 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-16 05:27:37,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-16 05:27:37,085 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-16 05:27:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1382898488, now seen corresponding path program 1 times [2021-12-16 05:27:37,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:37,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187573758] [2021-12-16 05:27:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:37,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:27:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:27:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-16 05:27:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 05:27:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:37,244 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-16 05:27:37,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:37,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187573758] [2021-12-16 05:27:37,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187573758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:37,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:37,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:37,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919977286] [2021-12-16 05:27:37,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:37,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:37,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:37,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:37,247 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-16 05:27:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:38,482 INFO L93 Difference]: Finished difference Result 1629 states and 2105 transitions. [2021-12-16 05:27:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:38,482 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-16 05:27:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:38,486 INFO L225 Difference]: With dead ends: 1629 [2021-12-16 05:27:38,486 INFO L226 Difference]: Without dead ends: 1627 [2021-12-16 05:27:38,487 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-16 05:27:38,487 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.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:38,488 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.1s Time] [2021-12-16 05:27:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-12-16 05:27:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2021-12-16 05:27:38,553 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-16 05:27:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2103 transitions. [2021-12-16 05:27:38,556 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2103 transitions. Word has length 150 [2021-12-16 05:27:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:38,556 INFO L470 AbstractCegarLoop]: Abstraction has 1627 states and 2103 transitions. [2021-12-16 05:27:38,557 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-16 05:27:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2103 transitions. [2021-12-16 05:27:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-16 05:27:38,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:38,558 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-16 05:27:38,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 05:27:38,559 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-16 05:27:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1820291379, now seen corresponding path program 1 times [2021-12-16 05:27:38,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:38,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829487265] [2021-12-16 05:27:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:38,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:27:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:27:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-16 05:27:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 05:27:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 05:27:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:38,702 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-16 05:27:38,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:38,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829487265] [2021-12-16 05:27:38,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829487265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:38,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:38,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:38,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600950729] [2021-12-16 05:27:38,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:38,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:38,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:38,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:38,705 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-16 05:27:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:39,962 INFO L93 Difference]: Finished difference Result 1627 states and 2103 transitions. [2021-12-16 05:27:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:39,963 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-16 05:27:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:39,967 INFO L225 Difference]: With dead ends: 1627 [2021-12-16 05:27:39,967 INFO L226 Difference]: Without dead ends: 1625 [2021-12-16 05:27:39,968 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-16 05:27:39,969 INFO L933 BasicCegarLoop]: 1054 mSDtfsCounter, 1528 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:39,969 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.1s Time] [2021-12-16 05:27:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2021-12-16 05:27:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1625. [2021-12-16 05:27:40,130 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-16 05:27:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2101 transitions. [2021-12-16 05:27:40,134 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2101 transitions. Word has length 156 [2021-12-16 05:27:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:40,134 INFO L470 AbstractCegarLoop]: Abstraction has 1625 states and 2101 transitions. [2021-12-16 05:27:40,134 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-16 05:27:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2101 transitions. [2021-12-16 05:27:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-16 05:27:40,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:40,136 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-16 05:27:40,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-16 05:27:40,137 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-16 05:27:40,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1658758885, now seen corresponding path program 1 times [2021-12-16 05:27:40,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:40,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122126406] [2021-12-16 05:27:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:40,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:27:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:27:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-16 05:27:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 05:27:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 05:27:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-16 05:27:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:40,319 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-16 05:27:40,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:40,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122126406] [2021-12-16 05:27:40,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122126406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:40,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:40,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:40,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054207430] [2021-12-16 05:27:40,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:40,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:40,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:40,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:40,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:40,322 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-16 05:27:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:41,720 INFO L93 Difference]: Finished difference Result 1625 states and 2101 transitions. [2021-12-16 05:27:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:41,720 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-16 05:27:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:41,724 INFO L225 Difference]: With dead ends: 1625 [2021-12-16 05:27:41,725 INFO L226 Difference]: Without dead ends: 1623 [2021-12-16 05:27:41,725 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-16 05:27:41,725 INFO L933 BasicCegarLoop]: 1052 mSDtfsCounter, 1522 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:41,726 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.3s Time] [2021-12-16 05:27:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-12-16 05:27:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1623. [2021-12-16 05:27:41,798 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-16 05:27:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2099 transitions. [2021-12-16 05:27:41,801 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2099 transitions. Word has length 162 [2021-12-16 05:27:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:41,802 INFO L470 AbstractCegarLoop]: Abstraction has 1623 states and 2099 transitions. [2021-12-16 05:27:41,802 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-16 05:27:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2099 transitions. [2021-12-16 05:27:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-12-16 05:27:41,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:41,804 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-16 05:27:41,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 05:27:41,804 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-16 05:27:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash 243227707, now seen corresponding path program 1 times [2021-12-16 05:27:41,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:41,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658148947] [2021-12-16 05:27:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:41,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:27:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:27:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-16 05:27:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 05:27:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 05:27:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-16 05:27:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-16 05:27:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:41,939 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-16 05:27:41,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658148947] [2021-12-16 05:27:41,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658148947] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:41,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:41,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:41,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483996645] [2021-12-16 05:27:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:41,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:41,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:41,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:41,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:41,941 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-16 05:27:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:43,165 INFO L93 Difference]: Finished difference Result 1623 states and 2099 transitions. [2021-12-16 05:27:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:43,165 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-16 05:27:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:43,170 INFO L225 Difference]: With dead ends: 1623 [2021-12-16 05:27:43,170 INFO L226 Difference]: Without dead ends: 1621 [2021-12-16 05:27:43,171 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-16 05:27:43,171 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.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:43,171 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.1s Time] [2021-12-16 05:27:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2021-12-16 05:27:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2021-12-16 05:27:43,264 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-16 05:27:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2097 transitions. [2021-12-16 05:27:43,268 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2097 transitions. Word has length 168 [2021-12-16 05:27:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:43,268 INFO L470 AbstractCegarLoop]: Abstraction has 1621 states and 2097 transitions. [2021-12-16 05:27:43,269 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-16 05:27:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2097 transitions. [2021-12-16 05:27:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-16 05:27:43,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:43,271 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-16 05:27:43,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-16 05:27:43,271 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-16 05:27:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1956759216, now seen corresponding path program 1 times [2021-12-16 05:27:43,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:43,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997759581] [2021-12-16 05:27:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:43,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 05:27:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 05:27:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 05:27:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-16 05:27:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-16 05:27:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-16 05:27:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:43,593 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-16 05:27:43,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:43,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997759581] [2021-12-16 05:27:43,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997759581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:43,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:43,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-16 05:27:43,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318820887] [2021-12-16 05:27:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:43,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 05:27:43,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 05:27:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-16 05:27:43,596 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-16 05:27:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:52,329 INFO L93 Difference]: Finished difference Result 2815 states and 3640 transitions. [2021-12-16 05:27:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-16 05:27:52,330 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-16 05:27:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:52,337 INFO L225 Difference]: With dead ends: 2815 [2021-12-16 05:27:52,337 INFO L226 Difference]: Without dead ends: 2813 [2021-12-16 05:27:52,338 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-16 05:27:52,339 INFO L933 BasicCegarLoop]: 1997 mSDtfsCounter, 6131 mSDsluCounter, 5140 mSDsCounter, 0 mSdLazyCounter, 8801 mSolverCounterSat, 5320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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, 8.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:52,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6419 Valid, 7137 Invalid, 14121 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5320 Valid, 8801 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2021-12-16 05:27:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2021-12-16 05:27:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2343. [2021-12-16 05:27:52,458 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-16 05:27:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3044 transitions. [2021-12-16 05:27:52,465 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3044 transitions. Word has length 217 [2021-12-16 05:27:52,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:52,466 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3044 transitions. [2021-12-16 05:27:52,466 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-16 05:27:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3044 transitions. [2021-12-16 05:27:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-12-16 05:27:52,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:52,470 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-16 05:27:52,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 05:27:52,471 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-16 05:27:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash -603449519, now seen corresponding path program 1 times [2021-12-16 05:27:52,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:52,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611650527] [2021-12-16 05:27:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:52,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 05:27:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 05:27:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 05:27:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:27:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-16 05:27:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 05:27:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-16 05:27:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-16 05:27:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-16 05:27:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:52,890 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-16 05:27:52,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:52,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611650527] [2021-12-16 05:27:52,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611650527] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:27:52,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998605220] [2021-12-16 05:27:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:52,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:27:52,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:27:52,893 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-16 05:27:52,894 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-16 05:27:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:53,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 2094 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-16 05:27:53,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:27:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2021-12-16 05:27:53,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:27:53,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998605220] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:53,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:27:53,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 24 [2021-12-16 05:27:53,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18646868] [2021-12-16 05:27:53,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:53,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-16 05:27:53,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:53,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 05:27:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2021-12-16 05:27:53,954 INFO L87 Difference]: Start difference. First operand 2343 states and 3044 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2021-12-16 05:27:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:54,994 INFO L93 Difference]: Finished difference Result 5001 states and 6556 transitions. [2021-12-16 05:27:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:27:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 217 [2021-12-16 05:27:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:55,044 INFO L225 Difference]: With dead ends: 5001 [2021-12-16 05:27:55,045 INFO L226 Difference]: Without dead ends: 2679 [2021-12-16 05:27:55,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-12-16 05:27:55,051 INFO L933 BasicCegarLoop]: 1344 mSDtfsCounter, 85 mSDsluCounter, 15973 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 17317 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:55,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 17317 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 05:27:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2021-12-16 05:27:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2376. [2021-12-16 05:27:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 1536 states have (on average 1.1614583333333333) internal successors, (1784), 1585 states have internal predecessors, (1784), 645 states have call successors, (645), 185 states have call predecessors, (645), 189 states have return successors, (657), 637 states have call predecessors, (657), 643 states have call successors, (657) [2021-12-16 05:27:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 3086 transitions. [2021-12-16 05:27:55,242 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 3086 transitions. Word has length 217 [2021-12-16 05:27:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:55,243 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 3086 transitions. [2021-12-16 05:27:55,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2021-12-16 05:27:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 3086 transitions. [2021-12-16 05:27:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-16 05:27:55,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:55,245 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, 1, 1, 1, 1, 1, 1] [2021-12-16 05:27:55,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 05:27:55,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-16 05:27:55,466 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_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-16 05:27:55,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1556419733, now seen corresponding path program 1 times [2021-12-16 05:27:55,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:55,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412775220] [2021-12-16 05:27:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:55,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 05:27:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-16 05:27:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-16 05:27:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 05:27:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:27:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-16 05:27:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:27:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:27:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:27:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-16 05:27:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 05:27:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-16 05:27:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-16 05:27:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-16 05:27:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-16 05:27:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,633 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-16 05:27:55,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:55,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412775220] [2021-12-16 05:27:55,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412775220] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:55,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:55,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:55,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044980693] [2021-12-16 05:27:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:55,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:55,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:55,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:55,635 INFO L87 Difference]: Start difference. First operand 2376 states and 3086 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-12-16 05:27:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:56,748 INFO L93 Difference]: Finished difference Result 2376 states and 3086 transitions. [2021-12-16 05:27:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:56,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2021-12-16 05:27:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:56,754 INFO L225 Difference]: With dead ends: 2376 [2021-12-16 05:27:56,755 INFO L226 Difference]: Without dead ends: 2374 [2021-12-16 05:27:56,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 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-16 05:27:56,756 INFO L933 BasicCegarLoop]: 1048 mSDtfsCounter, 1510 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 876 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 2319 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 876 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:56,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1633 Valid, 2319 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [876 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 05:27:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2021-12-16 05:27:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2374. [2021-12-16 05:27:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 1535 states have (on average 1.1609120521172638) internal successors, (1782), 1583 states have internal predecessors, (1782), 645 states have call successors, (645), 185 states have call predecessors, (645), 189 states have return successors, (657), 637 states have call predecessors, (657), 643 states have call successors, (657) [2021-12-16 05:27:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3084 transitions. [2021-12-16 05:27:56,931 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3084 transitions. Word has length 174 [2021-12-16 05:27:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:56,931 INFO L470 AbstractCegarLoop]: Abstraction has 2374 states and 3084 transitions. [2021-12-16 05:27:56,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-12-16 05:27:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3084 transitions. [2021-12-16 05:27:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-12-16 05:27:56,933 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:56,933 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:27:56,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-16 05:27:56,934 INFO L402 AbstractCegarLoop]: === Iteration 28 === 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-16 05:27:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:56,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2057417399, now seen corresponding path program 1 times [2021-12-16 05:27:56,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:56,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907943636] [2021-12-16 05:27:56,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:56,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:56,975 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 05:27:56,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388422431] [2021-12-16 05:27:56,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:56,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:27:56,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:27:57,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 05:27:57,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 05:27:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:57,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 2166 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-16 05:27:57,596 INFO L286 TraceCheckSpWp]: Computing forward predicates...