./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.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 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:27:39,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:27:39,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:27:39,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:27:39,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:27:39,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:27:39,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:27:39,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:27:39,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:27:39,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:27:39,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:27:39,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:27:39,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:27:39,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:27:39,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:27:39,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:27:39,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:27:39,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:27:39,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:27:39,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:27:39,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:27:39,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:27:39,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:27:39,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:27:39,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:27:39,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:27:39,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:27:39,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:27:39,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:27:39,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:27:39,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:27:39,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:27:39,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:27:39,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:27:39,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:27:39,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:27:39,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:27:39,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:27:39,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:27:39,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:27:39,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:27:39,667 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:27:39,699 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:27:39,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:27:39,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:27:39,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:27:39,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:27:39,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:27:39,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:27:39,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:27:39,702 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:27:39,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:27:39,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:27:39,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:27:39,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 05:27:39,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:27:39,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 05:27:39,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 05:27:39,704 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:27:39,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 05:27:39,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:27:39,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:27:39,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:27:39,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:27:39,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:27:39,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:27:39,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 05:27:39,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:27:39,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:27:39,705 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 05:27:39,706 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 05:27:39,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 05:27:39,706 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:27:39,706 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 -> 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c [2021-12-16 05:27:39,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:27:39,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:27:39,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:27:39,943 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:27:39,943 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:27:39,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-12-16 05:27:39,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea87cebf/b85046a2970442b89a60cb578f6d733b/FLAG737a1a134 [2021-12-16 05:27:40,654 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:27:40,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-12-16 05:27:40,699 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea87cebf/b85046a2970442b89a60cb578f6d733b/FLAG737a1a134 [2021-12-16 05:27:40,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea87cebf/b85046a2970442b89a60cb578f6d733b [2021-12-16 05:27:40,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:27:40,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:27:40,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:27:40,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:27:40,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:27:40,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:27:40" (1/1) ... [2021-12-16 05:27:40,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a43cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:40, skipping insertion in model container [2021-12-16 05:27:40,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:27:40" (1/1) ... [2021-12-16 05:27:40,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:27:40,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:27:43,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-12-16 05:27:43,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-12-16 05:27:43,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-12-16 05:27:43,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-12-16 05:27:43,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-12-16 05:27:43,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-12-16 05:27:43,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-12-16 05:27:43,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-12-16 05:27:43,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-12-16 05:27:43,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-12-16 05:27:43,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-12-16 05:27:43,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-12-16 05:27:43,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-12-16 05:27:43,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-12-16 05:27:43,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-12-16 05:27:43,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-12-16 05:27:43,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-12-16 05:27:43,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-12-16 05:27:43,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-12-16 05:27:43,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-12-16 05:27:43,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-12-16 05:27:43,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-12-16 05:27:43,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-12-16 05:27:43,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-12-16 05:27:43,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-12-16 05:27:43,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-12-16 05:27:43,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-12-16 05:27:43,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-12-16 05:27:43,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-12-16 05:27:43,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-12-16 05:27:43,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-12-16 05:27:43,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-12-16 05:27:43,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-12-16 05:27:43,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-12-16 05:27:43,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-12-16 05:27:43,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-12-16 05:27:43,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-12-16 05:27:43,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-12-16 05:27:43,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-12-16 05:27:43,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-12-16 05:27:43,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-12-16 05:27:43,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-12-16 05:27:43,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-12-16 05:27:43,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-12-16 05:27:43,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-12-16 05:27:43,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-12-16 05:27:43,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-12-16 05:27:43,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-12-16 05:27:43,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-12-16 05:27:43,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-12-16 05:27:43,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-12-16 05:27:43,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-12-16 05:27:43,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-12-16 05:27:43,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-12-16 05:27:43,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-12-16 05:27:43,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-12-16 05:27:43,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-12-16 05:27:43,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-12-16 05:27:43,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-12-16 05:27:43,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-12-16 05:27:43,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-12-16 05:27:43,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-12-16 05:27:43,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-12-16 05:27:43,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-12-16 05:27:43,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-12-16 05:27:43,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-12-16 05:27:43,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-12-16 05:27:43,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-12-16 05:27:43,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-12-16 05:27:43,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-12-16 05:27:43,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-12-16 05:27:43,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-12-16 05:27:43,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-12-16 05:27:43,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-12-16 05:27:43,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-12-16 05:27:43,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-12-16 05:27:43,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-12-16 05:27:43,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-12-16 05:27:43,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-12-16 05:27:43,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-12-16 05:27:43,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-12-16 05:27:43,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-12-16 05:27:43,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-12-16 05:27:43,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-12-16 05:27:43,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-12-16 05:27:43,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-12-16 05:27:43,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-12-16 05:27:43,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-12-16 05:27:43,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:27:43,709 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:27:43,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2021-12-16 05:27:43,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2021-12-16 05:27:43,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2021-12-16 05:27:43,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2021-12-16 05:27:43,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2021-12-16 05:27:43,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2021-12-16 05:27:43,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2021-12-16 05:27:43,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2021-12-16 05:27:43,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2021-12-16 05:27:43,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2021-12-16 05:27:43,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2021-12-16 05:27:43,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2021-12-16 05:27:43,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2021-12-16 05:27:43,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2021-12-16 05:27:43,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2021-12-16 05:27:43,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2021-12-16 05:27:43,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2021-12-16 05:27:43,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2021-12-16 05:27:43,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2021-12-16 05:27:43,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2021-12-16 05:27:43,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2021-12-16 05:27:43,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2021-12-16 05:27:43,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2021-12-16 05:27:43,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2021-12-16 05:27:43,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2021-12-16 05:27:43,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2021-12-16 05:27:43,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2021-12-16 05:27:43,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2021-12-16 05:27:43,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2021-12-16 05:27:43,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2021-12-16 05:27:43,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2021-12-16 05:27:43,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2021-12-16 05:27:43,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2021-12-16 05:27:43,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2021-12-16 05:27:43,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2021-12-16 05:27:43,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2021-12-16 05:27:43,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2021-12-16 05:27:43,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2021-12-16 05:27:43,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2021-12-16 05:27:43,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2021-12-16 05:27:43,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2021-12-16 05:27:43,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2021-12-16 05:27:43,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2021-12-16 05:27:43,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2021-12-16 05:27:43,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2021-12-16 05:27:43,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2021-12-16 05:27:43,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2021-12-16 05:27:43,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2021-12-16 05:27:43,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2021-12-16 05:27:43,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2021-12-16 05:27:43,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2021-12-16 05:27:43,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2021-12-16 05:27:43,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2021-12-16 05:27:43,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2021-12-16 05:27:43,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2021-12-16 05:27:43,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2021-12-16 05:27:43,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2021-12-16 05:27:43,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2021-12-16 05:27:43,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2021-12-16 05:27:43,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2021-12-16 05:27:43,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2021-12-16 05:27:43,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2021-12-16 05:27:43,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2021-12-16 05:27:43,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2021-12-16 05:27:43,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2021-12-16 05:27:43,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2021-12-16 05:27:43,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2021-12-16 05:27:43,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2021-12-16 05:27:43,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2021-12-16 05:27:43,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2021-12-16 05:27:43,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2021-12-16 05:27:43,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2021-12-16 05:27:43,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2021-12-16 05:27:43,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2021-12-16 05:27:43,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2021-12-16 05:27:43,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2021-12-16 05:27:43,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2021-12-16 05:27:44,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2021-12-16 05:27:44,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2021-12-16 05:27:44,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2021-12-16 05:27:44,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2021-12-16 05:27:44,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2021-12-16 05:27:44,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2021-12-16 05:27:44,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2021-12-16 05:27:44,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2021-12-16 05:27:44,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2021-12-16 05:27:44,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2021-12-16 05:27:44,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2021-12-16 05:27:44,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:27:44,119 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:27:44,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:44 WrapperNode [2021-12-16 05:27:44,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:27:44,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:27:44,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:27:44,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:27:44,125 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:44" (1/1) ... [2021-12-16 05:27:44,214 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:44" (1/1) ... [2021-12-16 05:27:44,321 INFO L137 Inliner]: procedures = 616, calls = 1459, calls flagged for inlining = 273, calls inlined = 178, statements flattened = 2640 [2021-12-16 05:27:44,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:27:44,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:27:44,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:27:44,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:27:44,330 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:44" (1/1) ... [2021-12-16 05:27:44,330 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:44" (1/1) ... [2021-12-16 05:27:44,340 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:44" (1/1) ... [2021-12-16 05:27:44,340 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:44" (1/1) ... [2021-12-16 05:27:44,405 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:44" (1/1) ... [2021-12-16 05:27:44,420 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:44" (1/1) ... [2021-12-16 05:27:44,436 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:44" (1/1) ... [2021-12-16 05:27:44,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:27:44,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:27:44,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:27:44,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:27:44,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:44" (1/1) ... [2021-12-16 05:27:44,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:27:44,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:27:44,484 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:44,490 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:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2021-12-16 05:27:44,549 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2021-12-16 05:27:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-16 05:27:44,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-16 05:27:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2021-12-16 05:27:44,549 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2021-12-16 05:27:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-16 05:27:44,550 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-16 05:27:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2021-12-16 05:27:44,550 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2021-12-16 05:27:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-16 05:27:44,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-16 05:27:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-16 05:27:44,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-16 05:27:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-16 05:27:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-16 05:27:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2021-12-16 05:27:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2021-12-16 05:27:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2021-12-16 05:27:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2021-12-16 05:27:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2021-12-16 05:27:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2021-12-16 05:27:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-16 05:27:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-16 05:27:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2021-12-16 05:27:44,552 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2021-12-16 05:27:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-16 05:27:44,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-16 05:27:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-12-16 05:27:44,552 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-12-16 05:27:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-16 05:27:44,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-16 05:27:44,552 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2021-12-16 05:27:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2021-12-16 05:27:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-16 05:27:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-16 05:27:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-16 05:27:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-16 05:27:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:27:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2021-12-16 05:27:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2021-12-16 05:27:44,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-16 05:27:44,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-16 05:27:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-12-16 05:27:44,554 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-12-16 05:27:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-12-16 05:27:44,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-12-16 05:27:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-16 05:27:44,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-16 05:27:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-16 05:27:44,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-16 05:27:44,554 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2021-12-16 05:27:44,555 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2021-12-16 05:27:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-16 05:27:44,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-16 05:27:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 05:27:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-16 05:27:44,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-16 05:27:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-16 05:27:44,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-16 05:27:44,555 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2021-12-16 05:27:44,556 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2021-12-16 05:27:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2021-12-16 05:27:44,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2021-12-16 05:27:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-16 05:27:44,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-16 05:27:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2021-12-16 05:27:44,556 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2021-12-16 05:27:44,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2021-12-16 05:27:44,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2021-12-16 05:27:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-16 05:27:44,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-16 05:27:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2021-12-16 05:27:44,557 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2021-12-16 05:27:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:27:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:27:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-16 05:27:44,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-16 05:27:44,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:27:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2021-12-16 05:27:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2021-12-16 05:27:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-16 05:27:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-16 05:27:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:27:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:27:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2021-12-16 05:27:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2021-12-16 05:27:44,558 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-12-16 05:27:44,558 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-12-16 05:27:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2021-12-16 05:27:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2021-12-16 05:27:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-12-16 05:27:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-16 05:27:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-16 05:27:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-16 05:27:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-16 05:27:44,559 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2021-12-16 05:27:44,559 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2021-12-16 05:27:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2021-12-16 05:27:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2021-12-16 05:27:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2021-12-16 05:27:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2021-12-16 05:27:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2021-12-16 05:27:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2021-12-16 05:27:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2021-12-16 05:27:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2021-12-16 05:27:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2021-12-16 05:27:44,561 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2021-12-16 05:27:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-16 05:27:44,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-16 05:27:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2021-12-16 05:27:44,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2021-12-16 05:27:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2021-12-16 05:27:44,561 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2021-12-16 05:27:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-16 05:27:44,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-16 05:27:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 05:27:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-16 05:27:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-16 05:27:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:27:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2021-12-16 05:27:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2021-12-16 05:27:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 05:27:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2021-12-16 05:27:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2021-12-16 05:27:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2021-12-16 05:27:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2021-12-16 05:27:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-12-16 05:27:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-12-16 05:27:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-16 05:27:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-16 05:27:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2021-12-16 05:27:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2021-12-16 05:27:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-16 05:27:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-16 05:27:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-12-16 05:27:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-12-16 05:27:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-16 05:27:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-16 05:27:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-16 05:27:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-16 05:27:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2021-12-16 05:27:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2021-12-16 05:27:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2021-12-16 05:27:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2021-12-16 05:27:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2021-12-16 05:27:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2021-12-16 05:27:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2021-12-16 05:27:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2021-12-16 05:27:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-16 05:27:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-16 05:27:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-16 05:27:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-16 05:27:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:27:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-16 05:27:44,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-16 05:27:44,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-16 05:27:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-16 05:27:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-16 05:27:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-16 05:27:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2021-12-16 05:27:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2021-12-16 05:27:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2021-12-16 05:27:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2021-12-16 05:27:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2021-12-16 05:27:44,566 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2021-12-16 05:27:44,566 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2021-12-16 05:27:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2021-12-16 05:27:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-16 05:27:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-16 05:27:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2021-12-16 05:27:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2021-12-16 05:27:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-16 05:27:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-16 05:27:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2021-12-16 05:27:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2021-12-16 05:27:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:27:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2021-12-16 05:27:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2021-12-16 05:27:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2021-12-16 05:27:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2021-12-16 05:27:45,007 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:27:45,010 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:27:45,102 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-16 05:27:46,017 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:27:46,032 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:27:46,032 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 05:27:46,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:27:46 BoogieIcfgContainer [2021-12-16 05:27:46,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:27:46,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:27:46,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:27:46,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:27:46,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:27:40" (1/3) ... [2021-12-16 05:27:46,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3628b35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:27:46, skipping insertion in model container [2021-12-16 05:27:46,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:27:44" (2/3) ... [2021-12-16 05:27:46,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3628b35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:27:46, skipping insertion in model container [2021-12-16 05:27:46,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:27:46" (3/3) ... [2021-12-16 05:27:46,042 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2021-12-16 05:27:46,045 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:27:46,045 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-12-16 05:27:46,091 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:27:46,096 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:46,096 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-12-16 05:27:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 1116 states, 741 states have (on average 1.2496626180836707) internal successors, (926), 797 states have internal predecessors, (926), 260 states have call successors, (260), 84 states have call predecessors, (260), 83 states have return successors, (255), 251 states have call predecessors, (255), 255 states have call successors, (255) [2021-12-16 05:27:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-16 05:27:46,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:46,133 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:46,133 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 29 more)] === [2021-12-16 05:27:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash -138799992, now seen corresponding path program 1 times [2021-12-16 05:27:46,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:46,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702227824] [2021-12-16 05:27:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:46,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:27:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:27:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:27:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:46,683 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:46,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:46,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702227824] [2021-12-16 05:27:46,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702227824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:46,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:46,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:46,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331419528] [2021-12-16 05:27:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:46,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:46,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:46,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:46,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:46,720 INFO L87 Difference]: Start difference. First operand has 1116 states, 741 states have (on average 1.2496626180836707) internal successors, (926), 797 states have internal predecessors, (926), 260 states have call successors, (260), 84 states have call predecessors, (260), 83 states have return successors, (255), 251 states have call predecessors, (255), 255 states have call successors, (255) Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:48,265 INFO L93 Difference]: Finished difference Result 2200 states and 2931 transitions. [2021-12-16 05:27:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:48,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 70 [2021-12-16 05:27:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:48,282 INFO L225 Difference]: With dead ends: 2200 [2021-12-16 05:27:48,283 INFO L226 Difference]: Without dead ends: 1093 [2021-12-16 05:27:48,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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:48,297 INFO L933 BasicCegarLoop]: 1319 mSDtfsCounter, 1961 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:48,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2136 Valid, 3013 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-16 05:27:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-12-16 05:27:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1093. [2021-12-16 05:27:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 726 states have (on average 1.1942148760330578) internal successors, (867), 777 states have internal predecessors, (867), 255 states have call successors, (255), 83 states have call predecessors, (255), 82 states have return successors, (253), 249 states have call predecessors, (253), 253 states have call successors, (253) [2021-12-16 05:27:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1375 transitions. [2021-12-16 05:27:48,392 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1375 transitions. Word has length 70 [2021-12-16 05:27:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:48,394 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 1375 transitions. [2021-12-16 05:27:48,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1375 transitions. [2021-12-16 05:27:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-16 05:27:48,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:48,397 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:48,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:27:48,398 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 29 more)] === [2021-12-16 05:27:48,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash 333096518, now seen corresponding path program 1 times [2021-12-16 05:27:48,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:48,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686640475] [2021-12-16 05:27:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:48,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:27:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:27:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:27:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:48,618 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:48,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:48,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686640475] [2021-12-16 05:27:48,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686640475] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:48,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:48,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:48,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755733125] [2021-12-16 05:27:48,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:48,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:48,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:48,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:48,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:48,620 INFO L87 Difference]: Start difference. First operand 1093 states and 1375 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:49,961 INFO L93 Difference]: Finished difference Result 1093 states and 1375 transitions. [2021-12-16 05:27:49,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:49,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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 76 [2021-12-16 05:27:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:49,967 INFO L225 Difference]: With dead ends: 1093 [2021-12-16 05:27:49,967 INFO L226 Difference]: Without dead ends: 1091 [2021-12-16 05:27:49,968 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:49,969 INFO L933 BasicCegarLoop]: 1299 mSDtfsCounter, 1927 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:49,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2099 Valid, 2971 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-16 05:27:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-12-16 05:27:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2021-12-16 05:27:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 725 states have (on average 1.193103448275862) internal successors, (865), 775 states have internal predecessors, (865), 255 states have call successors, (255), 83 states have call predecessors, (255), 82 states have return successors, (253), 249 states have call predecessors, (253), 253 states have call successors, (253) [2021-12-16 05:27:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1373 transitions. [2021-12-16 05:27:50,019 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1373 transitions. Word has length 76 [2021-12-16 05:27:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:50,019 INFO L470 AbstractCegarLoop]: Abstraction has 1091 states and 1373 transitions. [2021-12-16 05:27:50,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 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:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1373 transitions. [2021-12-16 05:27:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-16 05:27:50,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:50,022 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:50,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:27:50,022 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 29 more)] === [2021-12-16 05:27:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:50,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1375714423, now seen corresponding path program 1 times [2021-12-16 05:27:50,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:50,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242296020] [2021-12-16 05:27:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:50,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:27:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:27:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:27:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:50,191 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:50,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242296020] [2021-12-16 05:27:50,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242296020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:50,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:50,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:50,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270035306] [2021-12-16 05:27:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:50,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:50,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:50,194 INFO L87 Difference]: Start difference. First operand 1091 states and 1373 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:51,484 INFO L93 Difference]: Finished difference Result 1091 states and 1373 transitions. [2021-12-16 05:27:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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 82 [2021-12-16 05:27:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:51,491 INFO L225 Difference]: With dead ends: 1091 [2021-12-16 05:27:51,495 INFO L226 Difference]: Without dead ends: 1089 [2021-12-16 05:27:51,496 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:51,497 INFO L933 BasicCegarLoop]: 1297 mSDtfsCounter, 1921 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 2969 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:51,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2092 Valid, 2969 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-16 05:27:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-12-16 05:27:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2021-12-16 05:27:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 724 states have (on average 1.191988950276243) internal successors, (863), 773 states have internal predecessors, (863), 255 states have call successors, (255), 83 states have call predecessors, (255), 82 states have return successors, (253), 249 states have call predecessors, (253), 253 states have call successors, (253) [2021-12-16 05:27:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1371 transitions. [2021-12-16 05:27:51,538 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1371 transitions. Word has length 82 [2021-12-16 05:27:51,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:51,538 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 1371 transitions. [2021-12-16 05:27:51,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 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:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1371 transitions. [2021-12-16 05:27:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-16 05:27:51,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:51,542 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 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] [2021-12-16 05:27:51,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:27:51,543 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting nfnl_log_pernetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:27:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash -62631502, now seen corresponding path program 1 times [2021-12-16 05:27:51,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:51,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921807435] [2021-12-16 05:27:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:51,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:27:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-16 05:27:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-16 05:27:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-16 05:27:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-16 05:27:51,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:51,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921807435] [2021-12-16 05:27:51,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921807435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:51,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:51,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:51,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247275692] [2021-12-16 05:27:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:51,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:51,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:51,815 INFO L87 Difference]: Start difference. First operand 1089 states and 1371 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 05:27:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:53,801 INFO L93 Difference]: Finished difference Result 1862 states and 2308 transitions. [2021-12-16 05:27:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:27:53,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2021-12-16 05:27:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:53,811 INFO L225 Difference]: With dead ends: 1862 [2021-12-16 05:27:53,811 INFO L226 Difference]: Without dead ends: 1860 [2021-12-16 05:27:53,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:27:53,814 INFO L933 BasicCegarLoop]: 1567 mSDtfsCounter, 1359 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 4980 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:53,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1514 Valid, 4980 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-16 05:27:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2021-12-16 05:27:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1597. [2021-12-16 05:27:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1060 states have (on average 1.180188679245283) internal successors, (1251), 1125 states have internal predecessors, (1251), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-16 05:27:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2009 transitions. [2021-12-16 05:27:53,881 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2009 transitions. Word has length 97 [2021-12-16 05:27:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:53,882 INFO L470 AbstractCegarLoop]: Abstraction has 1597 states and 2009 transitions. [2021-12-16 05:27:53,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-16 05:27:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2009 transitions. [2021-12-16 05:27:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-16 05:27:53,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:53,883 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:53,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:27:53,883 INFO L402 AbstractCegarLoop]: === Iteration 5 === 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 29 more)] === [2021-12-16 05:27:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 591565888, now seen corresponding path program 1 times [2021-12-16 05:27:53,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:53,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84437834] [2021-12-16 05:27:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:53,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:53,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:53,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:27:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:27:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:27:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:54,069 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:54,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:54,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84437834] [2021-12-16 05:27:54,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84437834] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:54,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:54,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:54,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887113000] [2021-12-16 05:27:54,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:54,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:54,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:54,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:54,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:54,071 INFO L87 Difference]: Start difference. First operand 1597 states and 2009 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:55,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:55,282 INFO L93 Difference]: Finished difference Result 1597 states and 2009 transitions. [2021-12-16 05:27:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:55,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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 88 [2021-12-16 05:27:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:55,290 INFO L225 Difference]: With dead ends: 1597 [2021-12-16 05:27:55,290 INFO L226 Difference]: Without dead ends: 1595 [2021-12-16 05:27:55,291 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:55,291 INFO L933 BasicCegarLoop]: 1295 mSDtfsCounter, 1915 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2085 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:55,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2085 Valid, 2967 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-16 05:27:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2021-12-16 05:27:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595. [2021-12-16 05:27:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1059 states have (on average 1.1794145420207742) internal successors, (1249), 1123 states have internal predecessors, (1249), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-16 05:27:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2007 transitions. [2021-12-16 05:27:55,359 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2007 transitions. Word has length 88 [2021-12-16 05:27:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:55,360 INFO L470 AbstractCegarLoop]: Abstraction has 1595 states and 2007 transitions. [2021-12-16 05:27:55,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 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:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2007 transitions. [2021-12-16 05:27:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-16 05:27:55,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:55,365 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:55,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:27:55,366 INFO L402 AbstractCegarLoop]: === Iteration 6 === 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 29 more)] === [2021-12-16 05:27:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash -56363973, now seen corresponding path program 1 times [2021-12-16 05:27:55,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:55,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789250212] [2021-12-16 05:27:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:55,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:27:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:27:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:27:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:55,533 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,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:55,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789250212] [2021-12-16 05:27:55,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789250212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:55,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:55,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:55,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577774308] [2021-12-16 05:27:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:55,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:55,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:55,535 INFO L87 Difference]: Start difference. First operand 1595 states and 2007 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:56,692 INFO L93 Difference]: Finished difference Result 1595 states and 2007 transitions. [2021-12-16 05:27:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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 94 [2021-12-16 05:27:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:56,699 INFO L225 Difference]: With dead ends: 1595 [2021-12-16 05:27:56,699 INFO L226 Difference]: Without dead ends: 1593 [2021-12-16 05:27:56,700 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:56,701 INFO L933 BasicCegarLoop]: 1293 mSDtfsCounter, 1909 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:56,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2078 Valid, 2965 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 05:27:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2021-12-16 05:27:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1593. [2021-12-16 05:27:56,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1058 states have (on average 1.1786389413988658) internal successors, (1247), 1121 states have internal predecessors, (1247), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-16 05:27:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2005 transitions. [2021-12-16 05:27:56,761 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2005 transitions. Word has length 94 [2021-12-16 05:27:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:56,761 INFO L470 AbstractCegarLoop]: Abstraction has 1593 states and 2005 transitions. [2021-12-16 05:27:56,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 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:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2005 transitions. [2021-12-16 05:27:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-16 05:27:56,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:56,763 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:56,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:27:56,763 INFO L402 AbstractCegarLoop]: === Iteration 7 === 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 29 more)] === [2021-12-16 05:27:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash 915527194, now seen corresponding path program 1 times [2021-12-16 05:27:56,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:56,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285832693] [2021-12-16 05:27:56,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:56,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:27:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:27:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:27:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:56,932 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:56,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:56,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285832693] [2021-12-16 05:27:56,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285832693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:56,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:56,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:56,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850460303] [2021-12-16 05:27:56,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:56,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:56,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:56,934 INFO L87 Difference]: Start difference. First operand 1593 states and 2005 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-16 05:27:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:58,127 INFO L93 Difference]: Finished difference Result 1593 states and 2005 transitions. [2021-12-16 05:27:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:58,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2021-12-16 05:27:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:58,134 INFO L225 Difference]: With dead ends: 1593 [2021-12-16 05:27:58,134 INFO L226 Difference]: Without dead ends: 1591 [2021-12-16 05:27:58,135 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:58,136 INFO L933 BasicCegarLoop]: 1291 mSDtfsCounter, 1903 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 2963 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:58,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2071 Valid, 2963 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-16 05:27:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2021-12-16 05:27:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2021-12-16 05:27:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1057 states have (on average 1.1778618732261117) internal successors, (1245), 1119 states have internal predecessors, (1245), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-16 05:27:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2003 transitions. [2021-12-16 05:27:58,200 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2003 transitions. Word has length 100 [2021-12-16 05:27:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:58,201 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2003 transitions. [2021-12-16 05:27:58,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-16 05:27:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2003 transitions. [2021-12-16 05:27:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-16 05:27:58,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:58,202 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:58,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:27:58,203 INFO L402 AbstractCegarLoop]: === Iteration 8 === 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 29 more)] === [2021-12-16 05:27:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash 178536448, now seen corresponding path program 1 times [2021-12-16 05:27:58,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:58,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693748145] [2021-12-16 05:27:58,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:58,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:27:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:27:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:27:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:27:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:27:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:27:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:27:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:27:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:27:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:27:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:27:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:58,374 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:58,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:58,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693748145] [2021-12-16 05:27:58,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693748145] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:58,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:58,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:27:58,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609589069] [2021-12-16 05:27:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:58,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:27:58,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:58,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:27:58,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:27:58,376 INFO L87 Difference]: Start difference. First operand 1591 states and 2003 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-16 05:27:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:27:59,615 INFO L93 Difference]: Finished difference Result 1591 states and 2003 transitions. [2021-12-16 05:27:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:27:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 106 [2021-12-16 05:27:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:27:59,621 INFO L225 Difference]: With dead ends: 1591 [2021-12-16 05:27:59,622 INFO L226 Difference]: Without dead ends: 1589 [2021-12-16 05:27:59,622 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:59,623 INFO L933 BasicCegarLoop]: 1289 mSDtfsCounter, 1897 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:27:59,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2064 Valid, 2961 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-16 05:27:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-12-16 05:27:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2021-12-16 05:27:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1056 states have (on average 1.1770833333333333) internal successors, (1243), 1117 states have internal predecessors, (1243), 379 states have call successors, (379), 132 states have call predecessors, (379), 130 states have return successors, (379), 364 states have call predecessors, (379), 377 states have call successors, (379) [2021-12-16 05:27:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2001 transitions. [2021-12-16 05:27:59,680 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2001 transitions. Word has length 106 [2021-12-16 05:27:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:27:59,680 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 2001 transitions. [2021-12-16 05:27:59,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-16 05:27:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2001 transitions. [2021-12-16 05:27:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-16 05:27:59,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:27:59,682 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2021-12-16 05:27:59,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 05:27:59,682 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:27:59,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:27:59,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1037707720, now seen corresponding path program 1 times [2021-12-16 05:27:59,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:27:59,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459109114] [2021-12-16 05:27:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:27:59,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:27:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:27:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:27:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:27:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:27:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:27:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:27:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:27:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:27:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 05:27:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:27:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:27:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 05:27:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:27:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-12-16 05:27:59,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:27:59,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459109114] [2021-12-16 05:27:59,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459109114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:27:59,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:27:59,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:27:59,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166989214] [2021-12-16 05:27:59,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:27:59,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:27:59,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:27:59,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:27:59,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:27:59,895 INFO L87 Difference]: Start difference. First operand 1589 states and 2001 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-16 05:28:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:01,747 INFO L93 Difference]: Finished difference Result 1869 states and 2334 transitions. [2021-12-16 05:28:01,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 05:28:01,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2021-12-16 05:28:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:01,755 INFO L225 Difference]: With dead ends: 1869 [2021-12-16 05:28:01,755 INFO L226 Difference]: Without dead ends: 1867 [2021-12-16 05:28:01,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:28:01,757 INFO L933 BasicCegarLoop]: 1395 mSDtfsCounter, 1888 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 4118 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 853 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:01,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2061 Valid, 4118 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [853 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-16 05:28:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2021-12-16 05:28:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1759. [2021-12-16 05:28:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1176 states have (on average 1.1802721088435375) internal successors, (1388), 1238 states have internal predecessors, (1388), 404 states have call successors, (404), 156 states have call predecessors, (404), 155 states have return successors, (406), 389 states have call predecessors, (406), 402 states have call successors, (406) [2021-12-16 05:28:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2198 transitions. [2021-12-16 05:28:01,820 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2198 transitions. Word has length 118 [2021-12-16 05:28:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:01,820 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2198 transitions. [2021-12-16 05:28:01,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-16 05:28:01,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2198 transitions. [2021-12-16 05:28:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-16 05:28:01,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:01,822 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] [2021-12-16 05:28:01,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 05:28:01,823 INFO L402 AbstractCegarLoop]: === Iteration 10 === 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 29 more)] === [2021-12-16 05:28:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1083405284, now seen corresponding path program 1 times [2021-12-16 05:28:01,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:01,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370333179] [2021-12-16 05:28:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:01,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:28:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:28:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:28:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:28:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:28:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:28:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:28:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:01,978 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:28:01,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:01,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370333179] [2021-12-16 05:28:01,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370333179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:01,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:01,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:01,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846709085] [2021-12-16 05:28:01,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:01,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:01,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:01,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:01,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:01,980 INFO L87 Difference]: Start difference. First operand 1759 states and 2198 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-16 05:28:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:03,139 INFO L93 Difference]: Finished difference Result 1759 states and 2198 transitions. [2021-12-16 05:28:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:28:03,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2021-12-16 05:28:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:03,149 INFO L225 Difference]: With dead ends: 1759 [2021-12-16 05:28:03,149 INFO L226 Difference]: Without dead ends: 1757 [2021-12-16 05:28:03,150 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:28:03,151 INFO L933 BasicCegarLoop]: 1287 mSDtfsCounter, 1895 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:03,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2061 Valid, 2959 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 05:28:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2021-12-16 05:28:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2021-12-16 05:28:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1175 states have (on average 1.1795744680851064) internal successors, (1386), 1236 states have internal predecessors, (1386), 404 states have call successors, (404), 156 states have call predecessors, (404), 155 states have return successors, (406), 389 states have call predecessors, (406), 402 states have call successors, (406) [2021-12-16 05:28:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2196 transitions. [2021-12-16 05:28:03,217 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2196 transitions. Word has length 112 [2021-12-16 05:28:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:03,217 INFO L470 AbstractCegarLoop]: Abstraction has 1757 states and 2196 transitions. [2021-12-16 05:28:03,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-16 05:28:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2196 transitions. [2021-12-16 05:28:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-16 05:28:03,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:03,219 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 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] [2021-12-16 05:28:03,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:28:03,219 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting rcu_read_unlock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:28:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash 392296454, now seen corresponding path program 1 times [2021-12-16 05:28:03,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:03,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316284054] [2021-12-16 05:28:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:03,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-16 05:28:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:28:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-16 05:28:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-16 05:28:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-16 05:28:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-16 05:28:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-12-16 05:28:03,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:03,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316284054] [2021-12-16 05:28:03,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316284054] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:28:03,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369610378] [2021-12-16 05:28:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:03,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:28:03,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:28:03,493 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:28:03,496 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:28:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:03,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 05:28:03,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:28:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-16 05:28:04,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:28:04,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369610378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:04,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:28:04,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2021-12-16 05:28:04,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093049787] [2021-12-16 05:28:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:04,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:28:04,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:04,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:28:04,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:28:04,110 INFO L87 Difference]: Start difference. First operand 1757 states and 2196 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-16 05:28:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:04,234 INFO L93 Difference]: Finished difference Result 3405 states and 4242 transitions. [2021-12-16 05:28:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:28:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 134 [2021-12-16 05:28:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:04,242 INFO L225 Difference]: With dead ends: 3405 [2021-12-16 05:28:04,243 INFO L226 Difference]: Without dead ends: 1805 [2021-12-16 05:28:04,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:28:04,248 INFO L933 BasicCegarLoop]: 1395 mSDtfsCounter, 319 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 5096 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:04,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 5096 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:28:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2021-12-16 05:28:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1763. [2021-12-16 05:28:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1179 states have (on average 1.1789652247667515) internal successors, (1390), 1240 states have internal predecessors, (1390), 406 states have call successors, (406), 156 states have call predecessors, (406), 155 states have return successors, (408), 391 states have call predecessors, (408), 404 states have call successors, (408) [2021-12-16 05:28:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2204 transitions. [2021-12-16 05:28:04,319 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2204 transitions. Word has length 134 [2021-12-16 05:28:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:04,319 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 2204 transitions. [2021-12-16 05:28:04,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-16 05:28:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2204 transitions. [2021-12-16 05:28:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-16 05:28:04,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:04,321 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:28:04,343 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:28:04,535 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,SelfDestructingSolverStorable10 [2021-12-16 05:28:04,535 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 29 more)] === [2021-12-16 05:28:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1770258305, now seen corresponding path program 1 times [2021-12-16 05:28:04,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:04,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255889845] [2021-12-16 05:28:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:04,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:28:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:28:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:28:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:28:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:28:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:28:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:28:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:04,752 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:28:04,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:04,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255889845] [2021-12-16 05:28:04,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255889845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:04,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:04,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:04,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249177433] [2021-12-16 05:28:04,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:04,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:04,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:04,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:04,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:04,754 INFO L87 Difference]: Start difference. First operand 1763 states and 2204 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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:28:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:05,973 INFO L93 Difference]: Finished difference Result 1763 states and 2204 transitions. [2021-12-16 05:28:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:28:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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 114 [2021-12-16 05:28:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:05,981 INFO L225 Difference]: With dead ends: 1763 [2021-12-16 05:28:05,981 INFO L226 Difference]: Without dead ends: 1761 [2021-12-16 05:28:05,982 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:28:05,983 INFO L933 BasicCegarLoop]: 1285 mSDtfsCounter, 1883 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2049 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:05,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2049 Valid, 2957 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-16 05:28:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2021-12-16 05:28:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2021-12-16 05:28:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1178 states have (on average 1.1782682512733447) internal successors, (1388), 1238 states have internal predecessors, (1388), 406 states have call successors, (406), 156 states have call predecessors, (406), 155 states have return successors, (408), 391 states have call predecessors, (408), 404 states have call successors, (408) [2021-12-16 05:28:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2202 transitions. [2021-12-16 05:28:06,053 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2202 transitions. Word has length 114 [2021-12-16 05:28:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:06,054 INFO L470 AbstractCegarLoop]: Abstraction has 1761 states and 2202 transitions. [2021-12-16 05:28:06,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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:28:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2202 transitions. [2021-12-16 05:28:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-16 05:28:06,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:06,056 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:28:06,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:28:06,056 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 29 more)] === [2021-12-16 05:28:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1352940516, now seen corresponding path program 1 times [2021-12-16 05:28:06,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:06,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741715982] [2021-12-16 05:28:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:06,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:28:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:28:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:28:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:28:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:28:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:28:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:28:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-16 05:28:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:06,234 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:28:06,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:06,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741715982] [2021-12-16 05:28:06,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741715982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:06,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:06,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:06,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566823419] [2021-12-16 05:28:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:06,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:06,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:06,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:06,236 INFO L87 Difference]: Start difference. First operand 1761 states and 2202 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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:28:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:08,198 INFO L93 Difference]: Finished difference Result 2666 states and 3269 transitions. [2021-12-16 05:28:08,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:28:08,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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 120 [2021-12-16 05:28:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:08,209 INFO L225 Difference]: With dead ends: 2666 [2021-12-16 05:28:08,209 INFO L226 Difference]: Without dead ends: 2664 [2021-12-16 05:28:08,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 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:28:08,211 INFO L933 BasicCegarLoop]: 1377 mSDtfsCounter, 2664 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 1199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2829 SdHoareTripleChecker+Valid, 3591 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1199 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:08,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2829 Valid, 3591 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1199 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-16 05:28:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-12-16 05:28:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2619. [2021-12-16 05:28:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2619 states, 1778 states have (on average 1.1805399325084365) internal successors, (2099), 1846 states have internal predecessors, (2099), 571 states have call successors, (571), 249 states have call predecessors, (571), 248 states have return successors, (573), 555 states have call predecessors, (573), 569 states have call successors, (573) [2021-12-16 05:28:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3243 transitions. [2021-12-16 05:28:08,366 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3243 transitions. Word has length 120 [2021-12-16 05:28:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:08,367 INFO L470 AbstractCegarLoop]: Abstraction has 2619 states and 3243 transitions. [2021-12-16 05:28:08,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 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:28:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3243 transitions. [2021-12-16 05:28:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-12-16 05:28:08,369 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:08,369 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:28:08,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 05:28:08,369 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 29 more)] === [2021-12-16 05:28:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -179191031, now seen corresponding path program 1 times [2021-12-16 05:28:08,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:08,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308660123] [2021-12-16 05:28:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:08,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:28:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:28:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:28:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:28:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:28:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:28:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:28:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-16 05:28:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:28:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:08,557 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:28:08,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:08,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308660123] [2021-12-16 05:28:08,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308660123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:08,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:08,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:08,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113279533] [2021-12-16 05:28:08,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:08,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:08,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:08,560 INFO L87 Difference]: Start difference. First operand 2619 states and 3243 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:28:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:10,418 INFO L93 Difference]: Finished difference Result 3726 states and 4547 transitions. [2021-12-16 05:28:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 05:28:10,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2021-12-16 05:28:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:10,431 INFO L225 Difference]: With dead ends: 3726 [2021-12-16 05:28:10,431 INFO L226 Difference]: Without dead ends: 3724 [2021-12-16 05:28:10,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 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:28:10,433 INFO L933 BasicCegarLoop]: 1360 mSDtfsCounter, 2149 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 1098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2251 SdHoareTripleChecker+Valid, 3797 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:10,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2251 Valid, 3797 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 05:28:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2021-12-16 05:28:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3583. [2021-12-16 05:28:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 2425 states have (on average 1.1698969072164949) internal successors, (2837), 2515 states have internal predecessors, (2837), 784 states have call successors, (784), 354 states have call predecessors, (784), 352 states have return successors, (786), 758 states have call predecessors, (786), 782 states have call successors, (786) [2021-12-16 05:28:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4407 transitions. [2021-12-16 05:28:10,580 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4407 transitions. Word has length 126 [2021-12-16 05:28:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:10,581 INFO L470 AbstractCegarLoop]: Abstraction has 3583 states and 4407 transitions. [2021-12-16 05:28:10,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:28:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4407 transitions. [2021-12-16 05:28:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-16 05:28:10,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:10,582 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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] [2021-12-16 05:28:10,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 05:28:10,583 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:28:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash -31471526, now seen corresponding path program 1 times [2021-12-16 05:28:10,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:10,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636326035] [2021-12-16 05:28:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:10,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:28:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:28:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:28:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:28:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 05:28:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 05:28:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-16 05:28:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 05:28:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-16 05:28:10,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:10,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636326035] [2021-12-16 05:28:10,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636326035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:10,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:10,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:10,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27744673] [2021-12-16 05:28:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:10,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:10,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:10,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:10,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:10,790 INFO L87 Difference]: Start difference. First operand 3583 states and 4407 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-16 05:28:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:12,364 INFO L93 Difference]: Finished difference Result 6578 states and 8094 transitions. [2021-12-16 05:28:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:28:12,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2021-12-16 05:28:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:12,388 INFO L225 Difference]: With dead ends: 6578 [2021-12-16 05:28:12,389 INFO L226 Difference]: Without dead ends: 3850 [2021-12-16 05:28:12,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:28:12,398 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1339 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:12,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1341 Valid, 3384 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-16 05:28:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2021-12-16 05:28:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3584. [2021-12-16 05:28:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 2426 states have (on average 1.1698268755152514) internal successors, (2838), 2516 states have internal predecessors, (2838), 784 states have call successors, (784), 354 states have call predecessors, (784), 352 states have return successors, (786), 758 states have call predecessors, (786), 782 states have call successors, (786) [2021-12-16 05:28:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4408 transitions. [2021-12-16 05:28:12,602 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4408 transitions. Word has length 141 [2021-12-16 05:28:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:12,602 INFO L470 AbstractCegarLoop]: Abstraction has 3584 states and 4408 transitions. [2021-12-16 05:28:12,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-16 05:28:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4408 transitions. [2021-12-16 05:28:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-16 05:28:12,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:12,604 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:28:12,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:28:12,605 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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 29 more)] === [2021-12-16 05:28:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1628899092, now seen corresponding path program 1 times [2021-12-16 05:28:12,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:12,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324479250] [2021-12-16 05:28:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:12,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:28:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:28:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:28:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:28:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:28:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:28:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:28:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-16 05:28:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:28:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:28:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:12,785 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:28:12,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324479250] [2021-12-16 05:28:12,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324479250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:12,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:12,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:12,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440756544] [2021-12-16 05:28:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:12,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:12,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:12,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:12,788 INFO L87 Difference]: Start difference. First operand 3584 states and 4408 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-16 05:28:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:13,946 INFO L93 Difference]: Finished difference Result 3584 states and 4408 transitions. [2021-12-16 05:28:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:28:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 132 [2021-12-16 05:28:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:13,961 INFO L225 Difference]: With dead ends: 3584 [2021-12-16 05:28:13,961 INFO L226 Difference]: Without dead ends: 3582 [2021-12-16 05:28:13,963 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:28:13,963 INFO L933 BasicCegarLoop]: 1282 mSDtfsCounter, 1879 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:13,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2042 Valid, 2954 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 05:28:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2021-12-16 05:28:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3582. [2021-12-16 05:28:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 2425 states have (on average 1.1690721649484537) internal successors, (2835), 2514 states have internal predecessors, (2835), 784 states have call successors, (784), 354 states have call predecessors, (784), 352 states have return successors, (786), 758 states have call predecessors, (786), 782 states have call successors, (786) [2021-12-16 05:28:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4405 transitions. [2021-12-16 05:28:14,106 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4405 transitions. Word has length 132 [2021-12-16 05:28:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:14,106 INFO L470 AbstractCegarLoop]: Abstraction has 3582 states and 4405 transitions. [2021-12-16 05:28:14,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-16 05:28:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4405 transitions. [2021-12-16 05:28:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-16 05:28:14,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:14,109 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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] [2021-12-16 05:28:14,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:28:14,109 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:28:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1350192956, now seen corresponding path program 1 times [2021-12-16 05:28:14,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:14,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149540449] [2021-12-16 05:28:14,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:14,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:28:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:28:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:28:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:28:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 05:28:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 05:28:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-16 05:28:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 05:28:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-16 05:28:14,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:14,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149540449] [2021-12-16 05:28:14,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149540449] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:28:14,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187743003] [2021-12-16 05:28:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:14,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:28:14,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:28:14,268 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:28:14,269 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:28:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:14,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 05:28:14,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:28:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-16 05:28:14,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:28:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-16 05:28:15,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187743003] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:28:15,096 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:28:15,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2021-12-16 05:28:15,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555217940] [2021-12-16 05:28:15,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:28:15,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:28:15,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:15,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:28:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:28:15,099 INFO L87 Difference]: Start difference. First operand 3582 states and 4405 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-16 05:28:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:16,751 INFO L93 Difference]: Finished difference Result 6598 states and 8126 transitions. [2021-12-16 05:28:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:28:16,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2021-12-16 05:28:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:16,769 INFO L225 Difference]: With dead ends: 6598 [2021-12-16 05:28:16,769 INFO L226 Difference]: Without dead ends: 3871 [2021-12-16 05:28:16,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:28:16,777 INFO L933 BasicCegarLoop]: 1277 mSDtfsCounter, 1390 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 1032 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1032 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:16,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 4246 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1032 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-16 05:28:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2021-12-16 05:28:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3615. [2021-12-16 05:28:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3615 states, 2455 states have (on average 1.1718940936863544) internal successors, (2877), 2547 states have internal predecessors, (2877), 787 states have call successors, (787), 354 states have call predecessors, (787), 352 states have return successors, (789), 761 states have call predecessors, (789), 785 states have call successors, (789) [2021-12-16 05:28:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4453 transitions. [2021-12-16 05:28:16,969 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4453 transitions. Word has length 146 [2021-12-16 05:28:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:16,970 INFO L470 AbstractCegarLoop]: Abstraction has 3615 states and 4453 transitions. [2021-12-16 05:28:16,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2021-12-16 05:28:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4453 transitions. [2021-12-16 05:28:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-16 05:28:16,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:16,972 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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] [2021-12-16 05:28:16,994 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:28:17,188 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,SelfDestructingSolverStorable16 [2021-12-16 05:28:17,188 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_for_read_sectionErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:28:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash 216200491, now seen corresponding path program 1 times [2021-12-16 05:28:17,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:17,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70616053] [2021-12-16 05:28:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:17,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:28:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:28:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:28:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:28:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 05:28:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 05:28:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-16 05:28:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 05:28:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-16 05:28:17,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:17,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70616053] [2021-12-16 05:28:17,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70616053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:17,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:17,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:28:17,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809879984] [2021-12-16 05:28:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:17,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:28:17,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:28:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:28:17,398 INFO L87 Difference]: Start difference. First operand 3615 states and 4453 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:28:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:19,644 INFO L93 Difference]: Finished difference Result 3915 states and 4825 transitions. [2021-12-16 05:28:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:28:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2021-12-16 05:28:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:19,654 INFO L225 Difference]: With dead ends: 3915 [2021-12-16 05:28:19,654 INFO L226 Difference]: Without dead ends: 3913 [2021-12-16 05:28:19,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-12-16 05:28:19,656 INFO L933 BasicCegarLoop]: 1350 mSDtfsCounter, 2967 mSDsluCounter, 2909 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 1694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3081 SdHoareTripleChecker+Valid, 4259 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1694 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:19,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3081 Valid, 4259 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1694 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-16 05:28:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2021-12-16 05:28:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3615. [2021-12-16 05:28:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3615 states, 2455 states have (on average 1.170672097759674) internal successors, (2874), 2547 states have internal predecessors, (2874), 787 states have call successors, (787), 354 states have call predecessors, (787), 352 states have return successors, (789), 761 states have call predecessors, (789), 785 states have call successors, (789) [2021-12-16 05:28:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3615 states to 3615 states and 4450 transitions. [2021-12-16 05:28:19,799 INFO L78 Accepts]: Start accepts. Automaton has 3615 states and 4450 transitions. Word has length 147 [2021-12-16 05:28:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:19,799 INFO L470 AbstractCegarLoop]: Abstraction has 3615 states and 4450 transitions. [2021-12-16 05:28:19,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:28:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3615 states and 4450 transitions. [2021-12-16 05:28:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-16 05:28:19,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:19,801 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:28:19,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 05:28:19,802 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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 29 more)] === [2021-12-16 05:28:19,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash -973056597, now seen corresponding path program 1 times [2021-12-16 05:28:19,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:19,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184896899] [2021-12-16 05:28:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:19,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:28:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:28:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:28:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:28:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:28:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:28:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:28:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-16 05:28:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:28:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:28:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:28:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:19,991 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:28:19,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:19,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184896899] [2021-12-16 05:28:19,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184896899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:19,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:19,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:19,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342049606] [2021-12-16 05:28:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:19,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:19,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:19,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:19,994 INFO L87 Difference]: Start difference. First operand 3615 states and 4450 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-16 05:28:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:21,806 INFO L93 Difference]: Finished difference Result 3948 states and 4802 transitions. [2021-12-16 05:28:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 05:28:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2021-12-16 05:28:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:21,817 INFO L225 Difference]: With dead ends: 3948 [2021-12-16 05:28:21,817 INFO L226 Difference]: Without dead ends: 3946 [2021-12-16 05:28:21,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 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:28:21,820 INFO L933 BasicCegarLoop]: 1533 mSDtfsCounter, 1819 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 1066 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 4180 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1066 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:21,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1924 Valid, 4180 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1066 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 05:28:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2021-12-16 05:28:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3819. [2021-12-16 05:28:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 2591 states have (on average 1.1620995754534929) internal successors, (3011), 2683 states have internal predecessors, (3011), 827 states have call successors, (827), 382 states have call predecessors, (827), 380 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-16 05:28:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4667 transitions. [2021-12-16 05:28:21,973 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4667 transitions. Word has length 138 [2021-12-16 05:28:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:21,973 INFO L470 AbstractCegarLoop]: Abstraction has 3819 states and 4667 transitions. [2021-12-16 05:28:21,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-16 05:28:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4667 transitions. [2021-12-16 05:28:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-16 05:28:21,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:21,975 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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, 1] [2021-12-16 05:28:21,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 05:28:21,975 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_for_read_sectionErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:28:21,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:21,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1616326209, now seen corresponding path program 1 times [2021-12-16 05:28:21,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:21,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310891756] [2021-12-16 05:28:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:21,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:28:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:28:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:28:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:28:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 05:28:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 05:28:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-16 05:28:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 05:28:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-16 05:28:22,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:22,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310891756] [2021-12-16 05:28:22,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310891756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:22,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:22,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:28:22,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915726683] [2021-12-16 05:28:22,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:22,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:28:22,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:22,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:28:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:28:22,189 INFO L87 Difference]: Start difference. First operand 3819 states and 4667 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:28:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:23,686 INFO L93 Difference]: Finished difference Result 4075 states and 5007 transitions. [2021-12-16 05:28:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:28:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 150 [2021-12-16 05:28:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:23,699 INFO L225 Difference]: With dead ends: 4075 [2021-12-16 05:28:23,700 INFO L226 Difference]: Without dead ends: 4073 [2021-12-16 05:28:23,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:28:23,703 INFO L933 BasicCegarLoop]: 1272 mSDtfsCounter, 2361 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:23,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2541 Valid, 3394 Invalid, 2407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-16 05:28:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2021-12-16 05:28:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3817. [2021-12-16 05:28:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3817 states, 2590 states have (on average 1.159073359073359) internal successors, (3002), 2681 states have internal predecessors, (3002), 827 states have call successors, (827), 382 states have call predecessors, (827), 380 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-16 05:28:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 4658 transitions. [2021-12-16 05:28:23,887 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 4658 transitions. Word has length 150 [2021-12-16 05:28:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:23,887 INFO L470 AbstractCegarLoop]: Abstraction has 3817 states and 4658 transitions. [2021-12-16 05:28:23,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:28:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 4658 transitions. [2021-12-16 05:28:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-16 05:28:23,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:23,889 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:28:23,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-16 05:28:23,890 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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 29 more)] === [2021-12-16 05:28:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:23,890 INFO L85 PathProgramCache]: Analyzing trace with hash 713324926, now seen corresponding path program 1 times [2021-12-16 05:28:23,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:23,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074297908] [2021-12-16 05:28:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:23,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:23,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:23,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:28:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:28:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:28:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:28:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:28:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:28:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:28:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-16 05:28:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:28:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:28:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:28:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-16 05:28:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:24,128 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:28:24,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:24,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074297908] [2021-12-16 05:28:24,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074297908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:24,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:24,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:24,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972518847] [2021-12-16 05:28:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:24,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:24,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:24,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:24,133 INFO L87 Difference]: Start difference. First operand 3817 states and 4658 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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:28:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:25,270 INFO L93 Difference]: Finished difference Result 3817 states and 4658 transitions. [2021-12-16 05:28:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:28:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 144 [2021-12-16 05:28:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:25,290 INFO L225 Difference]: With dead ends: 3817 [2021-12-16 05:28:25,290 INFO L226 Difference]: Without dead ends: 3815 [2021-12-16 05:28:25,292 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:28:25,294 INFO L933 BasicCegarLoop]: 1278 mSDtfsCounter, 1867 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:25,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2028 Valid, 2950 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 05:28:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2021-12-16 05:28:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3815. [2021-12-16 05:28:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 2589 states have (on average 1.1583623020471225) internal successors, (2999), 2679 states have internal predecessors, (2999), 827 states have call successors, (827), 382 states have call predecessors, (827), 380 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-16 05:28:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 4655 transitions. [2021-12-16 05:28:25,466 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 4655 transitions. Word has length 144 [2021-12-16 05:28:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:25,467 INFO L470 AbstractCegarLoop]: Abstraction has 3815 states and 4655 transitions. [2021-12-16 05:28:25,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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:28:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 4655 transitions. [2021-12-16 05:28:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-16 05:28:25,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:25,469 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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, 1, 1, 1, 1] [2021-12-16 05:28:25,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-16 05:28:25,469 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_check_for_read_sectionErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:28:25,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1089934537, now seen corresponding path program 1 times [2021-12-16 05:28:25,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:25,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055600555] [2021-12-16 05:28:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:25,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:28:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:28:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:28:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:28:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 05:28:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 05:28:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-16 05:28:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 05:28:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-16 05:28:25,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055600555] [2021-12-16 05:28:25,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055600555] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:28:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896500425] [2021-12-16 05:28:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:25,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:28:25,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:28:25,806 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:28:25,841 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:28:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:26,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 05:28:26,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:28:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-16 05:28:26,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:28:26,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896500425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:26,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:28:26,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2021-12-16 05:28:26,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419608365] [2021-12-16 05:28:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:26,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:26,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-12-16 05:28:26,480 INFO L87 Difference]: Start difference. First operand 3815 states and 4655 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-16 05:28:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:27,850 INFO L93 Difference]: Finished difference Result 3839 states and 4671 transitions. [2021-12-16 05:28:27,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:28:27,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2021-12-16 05:28:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:27,866 INFO L225 Difference]: With dead ends: 3839 [2021-12-16 05:28:27,866 INFO L226 Difference]: Without dead ends: 3837 [2021-12-16 05:28:27,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-12-16 05:28:27,868 INFO L933 BasicCegarLoop]: 1100 mSDtfsCounter, 1360 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:27,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 2702 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-16 05:28:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2021-12-16 05:28:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3837. [2021-12-16 05:28:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 2604 states have (on average 1.1543778801843319) internal successors, (3006), 2693 states have internal predecessors, (3006), 827 states have call successors, (827), 390 states have call predecessors, (827), 388 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-16 05:28:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4662 transitions. [2021-12-16 05:28:28,020 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4662 transitions. Word has length 153 [2021-12-16 05:28:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:28,020 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 4662 transitions. [2021-12-16 05:28:28,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-12-16 05:28:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4662 transitions. [2021-12-16 05:28:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-16 05:28:28,023 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:28,023 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:28:28,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 05:28:28,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:28:28,245 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_check_for_read_sectionErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:28:28,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash -281219765, now seen corresponding path program 1 times [2021-12-16 05:28:28,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:28,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357107219] [2021-12-16 05:28:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:28,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:28:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:28:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:28:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:28:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 05:28:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 05:28:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-16 05:28:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 05:28:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2021-12-16 05:28:28,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:28,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357107219] [2021-12-16 05:28:28,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357107219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:28,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:28,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 05:28:28,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059939142] [2021-12-16 05:28:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:28,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 05:28:28,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:28,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 05:28:28,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:28:28,445 INFO L87 Difference]: Start difference. First operand 3837 states and 4662 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:28:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:30,020 INFO L93 Difference]: Finished difference Result 4093 states and 5002 transitions. [2021-12-16 05:28:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:28:30,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2021-12-16 05:28:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:30,031 INFO L225 Difference]: With dead ends: 4093 [2021-12-16 05:28:30,031 INFO L226 Difference]: Without dead ends: 4091 [2021-12-16 05:28:30,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:28:30,033 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 2321 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2501 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:30,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2501 Valid, 3388 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-16 05:28:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2021-12-16 05:28:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 3835. [2021-12-16 05:28:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3835 states, 2603 states have (on average 1.1513638109873223) internal successors, (2997), 2691 states have internal predecessors, (2997), 827 states have call successors, (827), 390 states have call predecessors, (827), 388 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-16 05:28:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 4653 transitions. [2021-12-16 05:28:30,191 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 4653 transitions. Word has length 156 [2021-12-16 05:28:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:30,191 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 4653 transitions. [2021-12-16 05:28:30,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-16 05:28:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 4653 transitions. [2021-12-16 05:28:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-16 05:28:30,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:30,194 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:28:30,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 05:28:30,194 INFO L402 AbstractCegarLoop]: === Iteration 24 === 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 29 more)] === [2021-12-16 05:28:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1200520837, now seen corresponding path program 1 times [2021-12-16 05:28:30,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:30,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431497734] [2021-12-16 05:28:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:30,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-16 05:28:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 05:28:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-16 05:28:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-16 05:28:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-16 05:28:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-16 05:28:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-16 05:28:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-16 05:28:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-16 05:28:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-16 05:28:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-16 05:28:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-16 05:28:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-16 05:28:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-16 05:28:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-16 05:28:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-16 05:28:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-16 05:28:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-16 05:28:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:30,398 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:28:30,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:30,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431497734] [2021-12-16 05:28:30,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431497734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:30,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:30,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:28:30,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179807289] [2021-12-16 05:28:30,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:30,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:28:30,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:28:30,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:28:30,400 INFO L87 Difference]: Start difference. First operand 3835 states and 4653 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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:28:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:28:31,579 INFO L93 Difference]: Finished difference Result 3835 states and 4653 transitions. [2021-12-16 05:28:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:28:31,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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 150 [2021-12-16 05:28:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:28:31,588 INFO L225 Difference]: With dead ends: 3835 [2021-12-16 05:28:31,588 INFO L226 Difference]: Without dead ends: 3833 [2021-12-16 05:28:31,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:28:31,590 INFO L933 BasicCegarLoop]: 1273 mSDtfsCounter, 1849 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 2945 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 796 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:28:31,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2009 Valid, 2945 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [796 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 05:28:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2021-12-16 05:28:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3833. [2021-12-16 05:28:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 2602 states have (on average 1.15065334358186) internal successors, (2994), 2689 states have internal predecessors, (2994), 827 states have call successors, (827), 390 states have call predecessors, (827), 388 states have return successors, (829), 801 states have call predecessors, (829), 825 states have call successors, (829) [2021-12-16 05:28:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 4650 transitions. [2021-12-16 05:28:31,762 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 4650 transitions. Word has length 150 [2021-12-16 05:28:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:28:31,763 INFO L470 AbstractCegarLoop]: Abstraction has 3833 states and 4650 transitions. [2021-12-16 05:28:31,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 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:28:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 4650 transitions. [2021-12-16 05:28:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-16 05:28:31,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:28:31,765 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 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] [2021-12-16 05:28:31,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-16 05:28:31,766 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2021-12-16 05:28:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:28:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1309291226, now seen corresponding path program 2 times [2021-12-16 05:28:31,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:28:31,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158147136] [2021-12-16 05:28:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:28:31,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:28:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 05:28:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-16 05:28:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-16 05:28:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-16 05:28:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 05:28:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-16 05:28:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 05:28:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-16 05:28:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-16 05:28:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-16 05:28:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-16 05:28:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 05:28:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 05:28:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 05:28:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:28:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2021-12-16 05:28:31,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:28:31,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158147136] [2021-12-16 05:28:31,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158147136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:28:31,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:28:31,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:28:31,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988819989] [2021-12-16 05:28:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:28:31,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:28:31,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:28:31,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:28:31,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:28:31,974 INFO L87 Difference]: Start difference. First operand 3833 states and 4650 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18)