./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.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 d25a5fddccc283f641b7212d7cb4f798f6892ab426c5d600c12492c2922640af --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 17:04:53,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 17:04:53,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 17:04:53,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 17:04:53,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 17:04:53,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 17:04:53,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 17:04:53,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 17:04:53,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 17:04:53,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 17:04:53,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 17:04:53,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 17:04:53,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 17:04:53,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 17:04:53,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 17:04:53,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 17:04:53,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 17:04:53,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 17:04:53,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 17:04:53,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 17:04:53,878 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 17:04:53,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 17:04:53,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 17:04:53,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 17:04:53,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 17:04:53,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 17:04:53,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 17:04:53,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 17:04:53,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 17:04:53,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 17:04:53,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 17:04:53,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 17:04:53,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 17:04:53,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 17:04:53,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 17:04:53,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 17:04:53,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 17:04:53,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 17:04:53,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 17:04:53,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 17:04:53,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 17:04:53,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 17:04:53,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 17:04:53,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 17:04:53,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 17:04:53,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 17:04:53,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 17:04:53,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 17:04:53,904 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 17:04:53,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 17:04:53,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 17:04:53,905 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 17:04:53,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 17:04:53,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 17:04:53,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 17:04:53,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 17:04:53,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 17:04:53,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 17:04:53,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 17:04:53,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 17:04:53,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 17:04:53,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 17:04:53,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 17:04:53,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 17:04:53,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:04:53,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 17:04:53,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 17:04:53,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 17:04:53,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 17:04:53,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 17:04:53,908 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 17:04:53,909 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 17:04:53,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 17:04:53,909 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 -> d25a5fddccc283f641b7212d7cb4f798f6892ab426c5d600c12492c2922640af [2022-07-12 17:04:54,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 17:04:54,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 17:04:54,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 17:04:54,103 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 17:04:54,104 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 17:04:54,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i [2022-07-12 17:04:54,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe6a9306f/837d9e3bb32e43e3b248a7e5616520a3/FLAG3e3e2de15 [2022-07-12 17:04:54,843 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 17:04:54,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i [2022-07-12 17:04:54,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe6a9306f/837d9e3bb32e43e3b248a7e5616520a3/FLAG3e3e2de15 [2022-07-12 17:04:55,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe6a9306f/837d9e3bb32e43e3b248a7e5616520a3 [2022-07-12 17:04:55,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 17:04:55,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 17:04:55,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 17:04:55,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 17:04:55,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 17:04:55,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:55,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395d3c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:55, skipping insertion in model container [2022-07-12 17:04:55,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 05:04:55" (1/1) ... [2022-07-12 17:04:55,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 17:04:55,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 17:04:59,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491154,491167] [2022-07-12 17:04:59,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491299,491312] [2022-07-12 17:04:59,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491445,491458] [2022-07-12 17:04:59,089 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491610,491623] [2022-07-12 17:04:59,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491768,491781] [2022-07-12 17:04:59,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491926,491939] [2022-07-12 17:04:59,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492084,492097] [2022-07-12 17:04:59,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492244,492257] [2022-07-12 17:04:59,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492403,492416] [2022-07-12 17:04:59,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492542,492555] [2022-07-12 17:04:59,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492684,492697] [2022-07-12 17:04:59,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492833,492846] [2022-07-12 17:04:59,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492972,492985] [2022-07-12 17:04:59,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493127,493140] [2022-07-12 17:04:59,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493287,493300] [2022-07-12 17:04:59,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493438,493451] [2022-07-12 17:04:59,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493589,493602] [2022-07-12 17:04:59,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493741,493754] [2022-07-12 17:04:59,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493890,493903] [2022-07-12 17:04:59,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494038,494051] [2022-07-12 17:04:59,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494195,494208] [2022-07-12 17:04:59,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494344,494357] [2022-07-12 17:04:59,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494500,494513] [2022-07-12 17:04:59,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494653,494666] [2022-07-12 17:04:59,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494799,494812] [2022-07-12 17:04:59,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494942,494955] [2022-07-12 17:04:59,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495094,495107] [2022-07-12 17:04:59,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495240,495253] [2022-07-12 17:04:59,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495385,495398] [2022-07-12 17:04:59,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495539,495552] [2022-07-12 17:04:59,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495690,495703] [2022-07-12 17:04:59,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495845,495858] [2022-07-12 17:04:59,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495997,496010] [2022-07-12 17:04:59,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496152,496165] [2022-07-12 17:04:59,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496316,496329] [2022-07-12 17:04:59,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496472,496485] [2022-07-12 17:04:59,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496636,496649] [2022-07-12 17:04:59,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496778,496791] [2022-07-12 17:04:59,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496936,496949] [2022-07-12 17:04:59,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497103,497116] [2022-07-12 17:04:59,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497262,497275] [2022-07-12 17:04:59,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497421,497434] [2022-07-12 17:04:59,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497570,497583] [2022-07-12 17:04:59,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497717,497730] [2022-07-12 17:04:59,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497856,497869] [2022-07-12 17:04:59,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498019,498032] [2022-07-12 17:04:59,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498185,498198] [2022-07-12 17:04:59,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498349,498362] [2022-07-12 17:04:59,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498514,498527] [2022-07-12 17:04:59,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498679,498692] [2022-07-12 17:04:59,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498845,498858] [2022-07-12 17:04:59,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499010,499023] [2022-07-12 17:04:59,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499177,499190] [2022-07-12 17:04:59,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499337,499350] [2022-07-12 17:04:59,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499499,499512] [2022-07-12 17:04:59,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499658,499671] [2022-07-12 17:04:59,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499804,499817] [2022-07-12 17:04:59,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499947,499960] [2022-07-12 17:04:59,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500091,500104] [2022-07-12 17:04:59,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500234,500247] [2022-07-12 17:04:59,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500378,500391] [2022-07-12 17:04:59,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500519,500532] [2022-07-12 17:04:59,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500657,500670] [2022-07-12 17:04:59,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500815,500828] [2022-07-12 17:04:59,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500974,500987] [2022-07-12 17:04:59,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501130,501143] [2022-07-12 17:04:59,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501279,501292] [2022-07-12 17:04:59,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501431,501444] [2022-07-12 17:04:59,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501582,501595] [2022-07-12 17:04:59,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501731,501744] [2022-07-12 17:04:59,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501883,501896] [2022-07-12 17:04:59,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502031,502044] [2022-07-12 17:04:59,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502184,502197] [2022-07-12 17:04:59,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502335,502348] [2022-07-12 17:04:59,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502485,502498] [2022-07-12 17:04:59,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502632,502645] [2022-07-12 17:04:59,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502783,502796] [2022-07-12 17:04:59,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502934,502947] [2022-07-12 17:04:59,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503082,503095] [2022-07-12 17:04:59,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503248,503261] [2022-07-12 17:04:59,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503417,503430] [2022-07-12 17:04:59,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503584,503597] [2022-07-12 17:04:59,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503752,503765] [2022-07-12 17:04:59,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503902,503915] [2022-07-12 17:04:59,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504049,504062] [2022-07-12 17:04:59,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504210,504223] [2022-07-12 17:04:59,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504380,504393] [2022-07-12 17:04:59,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504542,504555] [2022-07-12 17:04:59,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:04:59,207 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 17:04:59,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491154,491167] [2022-07-12 17:04:59,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491299,491312] [2022-07-12 17:04:59,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491445,491458] [2022-07-12 17:04:59,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491610,491623] [2022-07-12 17:04:59,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491768,491781] [2022-07-12 17:04:59,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[491926,491939] [2022-07-12 17:04:59,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492084,492097] [2022-07-12 17:04:59,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492244,492257] [2022-07-12 17:04:59,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492403,492416] [2022-07-12 17:04:59,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492542,492555] [2022-07-12 17:04:59,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492684,492697] [2022-07-12 17:04:59,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492833,492846] [2022-07-12 17:04:59,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[492972,492985] [2022-07-12 17:04:59,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493127,493140] [2022-07-12 17:04:59,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493287,493300] [2022-07-12 17:04:59,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493438,493451] [2022-07-12 17:04:59,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493589,493602] [2022-07-12 17:04:59,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493741,493754] [2022-07-12 17:04:59,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[493890,493903] [2022-07-12 17:04:59,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494038,494051] [2022-07-12 17:04:59,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494195,494208] [2022-07-12 17:04:59,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494344,494357] [2022-07-12 17:04:59,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494500,494513] [2022-07-12 17:04:59,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494653,494666] [2022-07-12 17:04:59,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494799,494812] [2022-07-12 17:04:59,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[494942,494955] [2022-07-12 17:04:59,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495094,495107] [2022-07-12 17:04:59,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495240,495253] [2022-07-12 17:04:59,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495385,495398] [2022-07-12 17:04:59,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495539,495552] [2022-07-12 17:04:59,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495690,495703] [2022-07-12 17:04:59,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495845,495858] [2022-07-12 17:04:59,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[495997,496010] [2022-07-12 17:04:59,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496152,496165] [2022-07-12 17:04:59,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496316,496329] [2022-07-12 17:04:59,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496472,496485] [2022-07-12 17:04:59,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496636,496649] [2022-07-12 17:04:59,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496778,496791] [2022-07-12 17:04:59,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[496936,496949] [2022-07-12 17:04:59,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497103,497116] [2022-07-12 17:04:59,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497262,497275] [2022-07-12 17:04:59,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497421,497434] [2022-07-12 17:04:59,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497570,497583] [2022-07-12 17:04:59,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497717,497730] [2022-07-12 17:04:59,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[497856,497869] [2022-07-12 17:04:59,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498019,498032] [2022-07-12 17:04:59,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498185,498198] [2022-07-12 17:04:59,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498349,498362] [2022-07-12 17:04:59,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498514,498527] [2022-07-12 17:04:59,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498679,498692] [2022-07-12 17:04:59,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[498845,498858] [2022-07-12 17:04:59,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499010,499023] [2022-07-12 17:04:59,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499177,499190] [2022-07-12 17:04:59,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499337,499350] [2022-07-12 17:04:59,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499499,499512] [2022-07-12 17:04:59,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499658,499671] [2022-07-12 17:04:59,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499804,499817] [2022-07-12 17:04:59,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[499947,499960] [2022-07-12 17:04:59,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500091,500104] [2022-07-12 17:04:59,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500234,500247] [2022-07-12 17:04:59,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500378,500391] [2022-07-12 17:04:59,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500519,500532] [2022-07-12 17:04:59,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500657,500670] [2022-07-12 17:04:59,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500815,500828] [2022-07-12 17:04:59,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[500974,500987] [2022-07-12 17:04:59,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501130,501143] [2022-07-12 17:04:59,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501279,501292] [2022-07-12 17:04:59,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501431,501444] [2022-07-12 17:04:59,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501582,501595] [2022-07-12 17:04:59,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501731,501744] [2022-07-12 17:04:59,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[501883,501896] [2022-07-12 17:04:59,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502031,502044] [2022-07-12 17:04:59,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502184,502197] [2022-07-12 17:04:59,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502335,502348] [2022-07-12 17:04:59,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502485,502498] [2022-07-12 17:04:59,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502632,502645] [2022-07-12 17:04:59,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502783,502796] [2022-07-12 17:04:59,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[502934,502947] [2022-07-12 17:04:59,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503082,503095] [2022-07-12 17:04:59,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503248,503261] [2022-07-12 17:04:59,550 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503417,503430] [2022-07-12 17:04:59,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503584,503597] [2022-07-12 17:04:59,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503752,503765] [2022-07-12 17:04:59,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[503902,503915] [2022-07-12 17:04:59,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504049,504062] [2022-07-12 17:04:59,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504210,504223] [2022-07-12 17:04:59,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504380,504393] [2022-07-12 17:04:59,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i[504542,504555] [2022-07-12 17:04:59,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 17:04:59,698 INFO L208 MainTranslator]: Completed translation [2022-07-12 17:04:59,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59 WrapperNode [2022-07-12 17:04:59,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 17:04:59,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 17:04:59,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 17:04:59,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 17:04:59,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:04:59,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:04:59,994 INFO L137 Inliner]: procedures = 687, calls = 4509, calls flagged for inlining = 318, calls inlined = 208, statements flattened = 7282 [2022-07-12 17:04:59,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 17:04:59,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 17:04:59,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 17:04:59,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 17:05:00,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:05:00,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:05:00,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:05:00,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:05:00,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:05:00,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:05:00,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:05:00,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 17:05:00,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 17:05:00,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 17:05:00,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 17:05:00,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (1/1) ... [2022-07-12 17:05:00,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 17:05:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:05:00,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 17:05:00,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 17:05:00,356 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-12 17:05:00,357 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-12 17:05:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:05:00,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 17:05:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_free_txskb [2022-07-12 17:05:00,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_free_txskb [2022-07-12 17:05:00,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 17:05:00,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 17:05:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:05:00,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 17:05:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 17:05:00,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 17:05:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_cancel_rx_cmd [2022-07-12 17:05:00,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_cancel_rx_cmd [2022-07-12 17:05:00,358 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:05:00,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 17:05:00,359 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_get_capability [2022-07-12 17:05:00,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_get_capability [2022-07-12 17:05:00,359 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 17:05:00,359 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 17:05:00,359 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:05:00,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 17:05:00,359 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:05:00,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 17:05:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_set_rxfilter [2022-07-12 17:05:00,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_set_rxfilter [2022-07-12 17:05:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_start [2022-07-12 17:05:00,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_start [2022-07-12 17:05:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_net_rtnetlink__double_lock [2022-07-12 17:05:00,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_net_rtnetlink__double_lock [2022-07-12 17:05:00,360 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 17:05:00,360 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 17:05:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_cmd_write [2022-07-12 17:05:00,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_cmd_write [2022-07-12 17:05:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_past_rtnl_lock [2022-07-12 17:05:00,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_past_rtnl_lock [2022-07-12 17:05:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_get_status [2022-07-12 17:05:00,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_get_status [2022-07-12 17:05:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 17:05:00,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 17:05:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 17:05:00,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 17:05:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:05:00,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 17:05:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 17:05:00,362 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 17:05:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_config [2022-07-12 17:05:00,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_config [2022-07-12 17:05:00,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_rx_data_list_lock_of_ar5523 [2022-07-12 17:05:00,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_rx_data_list_lock_of_ar5523 [2022-07-12 17:05:00,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 17:05:00,363 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-07-12 17:05:00,363 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-07-12 17:05:00,363 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-12 17:05:00,363 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-12 17:05:00,363 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 17:05:00,363 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 17:05:00,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:05:00,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 17:05:00,364 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_queue_delayed_work [2022-07-12 17:05:00,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_queue_delayed_work [2022-07-12 17:05:00,364 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_data_tx_pkt_put [2022-07-12 17:05:00,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_data_tx_pkt_put [2022-07-12 17:05:00,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 17:05:00,364 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_create_rateset [2022-07-12 17:05:00,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_create_rateset [2022-07-12 17:05:00,365 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 17:05:00,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 17:05:00,365 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_set_ledsteady [2022-07-12 17:05:00,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_set_ledsteady [2022-07-12 17:05:00,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 17:05:00,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 17:05:00,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 17:05:00,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 17:05:00,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 17:05:00,366 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_free_rx_bufs [2022-07-12 17:05:00,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_free_rx_bufs [2022-07-12 17:05:00,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:05:00,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 17:05:00,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 17:05:00,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:05:00,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 17:05:00,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 17:05:00,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 17:05:00,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 17:05:00,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 17:05:00,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_ar5523 [2022-07-12 17:05:00,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_ar5523 [2022-07-12 17:05:00,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:05:00,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 17:05:00,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 17:05:00,368 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 17:05:00,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 17:05:00,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 17:05:00,368 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_disconnect [2022-07-12 17:05:00,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_disconnect [2022-07-12 17:05:00,368 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-12 17:05:00,368 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-12 17:05:00,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:05:00,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 17:05:00,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:05:00,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 17:05:00,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 17:05:00,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2022-07-12 17:05:00,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2022-07-12 17:05:00,369 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-12 17:05:00,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-12 17:05:00,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 17:05:00,369 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_free_hw [2022-07-12 17:05:00,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_free_hw [2022-07-12 17:05:00,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 17:05:00,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 17:05:00,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 17:05:00,370 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:05:00,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 17:05:00,370 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 17:05:00,370 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 17:05:00,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 17:05:00,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 17:05:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-07-12 17:05:00,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-07-12 17:05:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_queue_work [2022-07-12 17:05:00,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_queue_work [2022-07-12 17:05:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:05:00,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 17:05:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2022-07-12 17:05:00,372 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2022-07-12 17:05:00,372 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 17:05:00,372 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 17:05:00,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_ar5523 [2022-07-12 17:05:00,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_ar5523 [2022-07-12 17:05:00,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 17:05:00,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 17:05:00,372 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 17:05:00,372 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 17:05:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_submit_rx_cmd [2022-07-12 17:05:00,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_submit_rx_cmd [2022-07-12 17:05:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 17:05:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 17:05:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 17:05:00,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 17:05:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-12 17:05:00,373 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-12 17:05:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:05:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 17:05:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ieee80211_free_hw [2022-07-12 17:05:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ieee80211_free_hw [2022-07-12 17:05:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_143 [2022-07-12 17:05:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_143 [2022-07-12 17:05:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-07-12 17:05:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-07-12 17:05:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_cmd_read [2022-07-12 17:05:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_cmd_read [2022-07-12 17:05:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-12 17:05:00,375 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-12 17:05:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_131 [2022-07-12 17:05:00,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_131 [2022-07-12 17:05:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 17:05:00,375 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 17:05:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_tx_data_list_lock_of_ar5523 [2022-07-12 17:05:00,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_tx_data_list_lock_of_ar5523 [2022-07-12 17:05:00,375 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-12 17:05:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-12 17:05:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 17:05:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 17:05:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:05:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 17:05:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 17:05:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 17:05:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:05:00,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 17:05:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_free_rx_cmd [2022-07-12 17:05:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_free_rx_cmd [2022-07-12 17:05:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 17:05:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 17:05:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 17:05:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:05:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 17:05:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_switch_chan [2022-07-12 17:05:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_switch_chan [2022-07-12 17:05:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure ieee80211_find_sta [2022-07-12 17:05:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ieee80211_find_sta [2022-07-12 17:05:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 17:05:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 17:05:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 17:05:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 17:05:00,378 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_tx_work_locked [2022-07-12 17:05:00,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_tx_work_locked [2022-07-12 17:05:00,379 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 17:05:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 17:05:00,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:05:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 17:05:00,379 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 17:05:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 17:05:00,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 17:05:00,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 17:05:00,379 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-07-12 17:05:00,380 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-07-12 17:05:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-12 17:05:00,380 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-12 17:05:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 17:05:00,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 17:05:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 17:05:00,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 17:05:00,380 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-12 17:05:00,380 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-12 17:05:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:05:00,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 17:05:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:05:00,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 17:05:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_stop [2022-07-12 17:05:00,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_stop [2022-07-12 17:05:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:05:00,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 17:05:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:05:00,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-12 17:05:00,382 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_flush_tx [2022-07-12 17:05:00,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_flush_tx [2022-07-12 17:05:00,382 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 17:05:00,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 17:05:00,382 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_cancel_rx_bufs [2022-07-12 17:05:00,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_cancel_rx_bufs [2022-07-12 17:05:00,382 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 17:05:00,382 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 17:05:00,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:05:00,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 17:05:00,383 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 17:05:00,383 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 17:05:00,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:05:00,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 17:05:00,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 17:05:00,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:05:00,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 17:05:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 17:05:00,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 17:05:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:05:00,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 17:05:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-12 17:05:00,384 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-12 17:05:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_lock [2022-07-12 17:05:00,384 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_lock [2022-07-12 17:05:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-12 17:05:00,385 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-12 17:05:00,385 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_free_tx_cmd [2022-07-12 17:05:00,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_free_tx_cmd [2022-07-12 17:05:00,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 17:05:00,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 17:05:00,385 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add_return [2022-07-12 17:05:00,385 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add_return [2022-07-12 17:05:00,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:05:00,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 17:05:00,386 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-12 17:05:00,386 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-12 17:05:00,386 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_past_rtnl_unlock [2022-07-12 17:05:00,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_past_rtnl_unlock [2022-07-12 17:05:00,386 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-07-12 17:05:00,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 17:05:00,386 INFO L130 BoogieDeclarations]: Found specification of procedure ar5523_cmd [2022-07-12 17:05:00,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ar5523_cmd [2022-07-12 17:05:00,386 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-12 17:05:00,387 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-12 17:05:00,387 INFO L130 BoogieDeclarations]: Found specification of procedure IEEE80211_SKB_CB [2022-07-12 17:05:00,387 INFO L138 BoogieDeclarations]: Found implementation of procedure IEEE80211_SKB_CB [2022-07-12 17:05:00,980 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 17:05:00,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 17:05:01,153 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 17:05:05,558 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 17:05:05,570 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 17:05:05,570 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 17:05:05,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:05:05 BoogieIcfgContainer [2022-07-12 17:05:05,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 17:05:05,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 17:05:05,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 17:05:05,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 17:05:05,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 05:04:55" (1/3) ... [2022-07-12 17:05:05,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f22852d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:05:05, skipping insertion in model container [2022-07-12 17:05:05,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 05:04:59" (2/3) ... [2022-07-12 17:05:05,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f22852d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 05:05:05, skipping insertion in model container [2022-07-12 17:05:05,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 05:05:05" (3/3) ... [2022-07-12 17:05:05,579 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--wireless--ath--ar5523--ar5523.ko.cil.i [2022-07-12 17:05:05,590 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 17:05:05,591 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-07-12 17:05:05,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 17:05:05,670 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30f39b5f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ab73b97 [2022-07-12 17:05:05,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-07-12 17:05:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 1885 states, 1208 states have (on average 1.265728476821192) internal successors, (1529), 1263 states have internal predecessors, (1529), 520 states have call successors, (520), 123 states have call predecessors, (520), 122 states have return successors, (516), 514 states have call predecessors, (516), 516 states have call successors, (516) [2022-07-12 17:05:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 17:05:05,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:05,703 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:05,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:05,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:05,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1171743283, now seen corresponding path program 1 times [2022-07-12 17:05:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094164963] [2022-07-12 17:05:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:06,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:06,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094164963] [2022-07-12 17:05:06,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094164963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:06,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:06,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:06,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476229016] [2022-07-12 17:05:06,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:06,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:06,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:06,860 INFO L87 Difference]: Start difference. First operand has 1885 states, 1208 states have (on average 1.265728476821192) internal successors, (1529), 1263 states have internal predecessors, (1529), 520 states have call successors, (520), 123 states have call predecessors, (520), 122 states have return successors, (516), 514 states have call predecessors, (516), 516 states have call successors, (516) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 17:05:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:11,145 INFO L93 Difference]: Finished difference Result 3695 states and 5230 transitions. [2022-07-12 17:05:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 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 71 [2022-07-12 17:05:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:11,191 INFO L225 Difference]: With dead ends: 3695 [2022-07-12 17:05:11,191 INFO L226 Difference]: Without dead ends: 1868 [2022-07-12 17:05:11,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:11,210 INFO L413 NwaCegarLoop]: 2288 mSDtfsCounter, 3404 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 1918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3691 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 4302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1918 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:11,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3691 Valid, 4522 Invalid, 4302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1918 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 17:05:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2022-07-12 17:05:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1868. [2022-07-12 17:05:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1198 states have (on average 1.2220367278797997) internal successors, (1464), 1249 states have internal predecessors, (1464), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2494 transitions. [2022-07-12 17:05:11,351 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2494 transitions. Word has length 71 [2022-07-12 17:05:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:11,352 INFO L495 AbstractCegarLoop]: Abstraction has 1868 states and 2494 transitions. [2022-07-12 17:05:11,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 17:05:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2494 transitions. [2022-07-12 17:05:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 17:05:11,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:11,355 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:11,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 17:05:11,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:11,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash 633462717, now seen corresponding path program 1 times [2022-07-12 17:05:11,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:11,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787018593] [2022-07-12 17:05:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:11,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:11,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787018593] [2022-07-12 17:05:11,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787018593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:11,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:11,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155270417] [2022-07-12 17:05:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:11,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:11,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:11,921 INFO L87 Difference]: Start difference. First operand 1868 states and 2494 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 17:05:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:15,779 INFO L93 Difference]: Finished difference Result 1868 states and 2494 transitions. [2022-07-12 17:05:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 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 77 [2022-07-12 17:05:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:15,788 INFO L225 Difference]: With dead ends: 1868 [2022-07-12 17:05:15,788 INFO L226 Difference]: Without dead ends: 1866 [2022-07-12 17:05:15,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:15,792 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 3372 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3656 SdHoareTripleChecker+Valid, 4488 SdHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:15,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3656 Valid, 4488 Invalid, 4280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 17:05:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-07-12 17:05:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2022-07-12 17:05:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1197 states have (on average 1.2213868003341688) internal successors, (1462), 1247 states have internal predecessors, (1462), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2492 transitions. [2022-07-12 17:05:15,857 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2492 transitions. Word has length 77 [2022-07-12 17:05:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:15,859 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 2492 transitions. [2022-07-12 17:05:15,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 17:05:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2492 transitions. [2022-07-12 17:05:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 17:05:15,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:15,864 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:15,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 17:05:15,865 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:15,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash -170471170, now seen corresponding path program 1 times [2022-07-12 17:05:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:15,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521818546] [2022-07-12 17:05:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:16,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:16,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521818546] [2022-07-12 17:05:16,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521818546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:16,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:16,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:16,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473525274] [2022-07-12 17:05:16,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:16,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:16,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:16,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:16,452 INFO L87 Difference]: Start difference. First operand 1866 states and 2492 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 17:05:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:20,306 INFO L93 Difference]: Finished difference Result 1866 states and 2492 transitions. [2022-07-12 17:05:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 83 [2022-07-12 17:05:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:20,315 INFO L225 Difference]: With dead ends: 1866 [2022-07-12 17:05:20,315 INFO L226 Difference]: Without dead ends: 1864 [2022-07-12 17:05:20,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:20,317 INFO L413 NwaCegarLoop]: 2268 mSDtfsCounter, 3366 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3649 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 4278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:20,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3649 Valid, 4486 Invalid, 4278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 17:05:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-07-12 17:05:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1864. [2022-07-12 17:05:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1196 states have (on average 1.2207357859531773) internal successors, (1460), 1245 states have internal predecessors, (1460), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2490 transitions. [2022-07-12 17:05:20,369 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2490 transitions. Word has length 83 [2022-07-12 17:05:20,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:20,370 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 2490 transitions. [2022-07-12 17:05:20,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 17:05:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2490 transitions. [2022-07-12 17:05:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 17:05:20,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:20,371 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:20,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 17:05:20,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1655639382, now seen corresponding path program 1 times [2022-07-12 17:05:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:20,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923011474] [2022-07-12 17:05:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:20,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:20,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:20,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923011474] [2022-07-12 17:05:20,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923011474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:20,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:20,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624136655] [2022-07-12 17:05:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:20,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:20,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:20,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:20,897 INFO L87 Difference]: Start difference. First operand 1864 states and 2490 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:05:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:23,965 INFO L93 Difference]: Finished difference Result 1864 states and 2490 transitions. [2022-07-12 17:05:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:23,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 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 89 [2022-07-12 17:05:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:23,975 INFO L225 Difference]: With dead ends: 1864 [2022-07-12 17:05:23,976 INFO L226 Difference]: Without dead ends: 1862 [2022-07-12 17:05:23,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:23,977 INFO L413 NwaCegarLoop]: 2266 mSDtfsCounter, 3360 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 2366 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3642 SdHoareTripleChecker+Valid, 4484 SdHoareTripleChecker+Invalid, 4276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:23,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3642 Valid, 4484 Invalid, 4276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2366 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 17:05:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2022-07-12 17:05:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2022-07-12 17:05:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1195 states have (on average 1.2200836820083683) internal successors, (1458), 1243 states have internal predecessors, (1458), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2488 transitions. [2022-07-12 17:05:24,028 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2488 transitions. Word has length 89 [2022-07-12 17:05:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:24,029 INFO L495 AbstractCegarLoop]: Abstraction has 1862 states and 2488 transitions. [2022-07-12 17:05:24,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 17:05:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2488 transitions. [2022-07-12 17:05:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 17:05:24,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:24,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:24,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 17:05:24,032 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:24,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1080701297, now seen corresponding path program 1 times [2022-07-12 17:05:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:24,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197312006] [2022-07-12 17:05:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:24,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197312006] [2022-07-12 17:05:24,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197312006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:24,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:24,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48297602] [2022-07-12 17:05:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:24,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:24,540 INFO L87 Difference]: Start difference. First operand 1862 states and 2488 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:05:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:28,061 INFO L93 Difference]: Finished difference Result 1862 states and 2488 transitions. [2022-07-12 17:05:28,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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 95 [2022-07-12 17:05:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:28,078 INFO L225 Difference]: With dead ends: 1862 [2022-07-12 17:05:28,078 INFO L226 Difference]: Without dead ends: 1860 [2022-07-12 17:05:28,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:28,080 INFO L413 NwaCegarLoop]: 2264 mSDtfsCounter, 3354 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3635 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 4274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:28,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3635 Valid, 4482 Invalid, 4274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 17:05:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-12 17:05:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2022-07-12 17:05:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1194 states have (on average 1.219430485762144) internal successors, (1456), 1241 states have internal predecessors, (1456), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2486 transitions. [2022-07-12 17:05:28,141 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2486 transitions. Word has length 95 [2022-07-12 17:05:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:28,143 INFO L495 AbstractCegarLoop]: Abstraction has 1860 states and 2486 transitions. [2022-07-12 17:05:28,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:05:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2486 transitions. [2022-07-12 17:05:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 17:05:28,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:28,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:28,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 17:05:28,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash 46306038, now seen corresponding path program 1 times [2022-07-12 17:05:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:28,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4703708] [2022-07-12 17:05:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:28,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:28,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4703708] [2022-07-12 17:05:28,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4703708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:28,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:28,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524317589] [2022-07-12 17:05:28,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:28,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:28,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:28,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:28,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:28,619 INFO L87 Difference]: Start difference. First operand 1860 states and 2486 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:05:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:32,392 INFO L93 Difference]: Finished difference Result 1860 states and 2486 transitions. [2022-07-12 17:05:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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 101 [2022-07-12 17:05:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:32,399 INFO L225 Difference]: With dead ends: 1860 [2022-07-12 17:05:32,399 INFO L226 Difference]: Without dead ends: 1858 [2022-07-12 17:05:32,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:32,400 INFO L413 NwaCegarLoop]: 2262 mSDtfsCounter, 3348 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3628 SdHoareTripleChecker+Valid, 4480 SdHoareTripleChecker+Invalid, 4272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:32,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3628 Valid, 4480 Invalid, 4272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 17:05:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2022-07-12 17:05:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2022-07-12 17:05:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1193 states have (on average 1.2187761944677284) internal successors, (1454), 1239 states have internal predecessors, (1454), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2484 transitions. [2022-07-12 17:05:32,445 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2484 transitions. Word has length 101 [2022-07-12 17:05:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:32,446 INFO L495 AbstractCegarLoop]: Abstraction has 1858 states and 2484 transitions. [2022-07-12 17:05:32,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:05:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2484 transitions. [2022-07-12 17:05:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 17:05:32,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:32,447 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:32,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 17:05:32,447 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1612779115, now seen corresponding path program 1 times [2022-07-12 17:05:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:32,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174830752] [2022-07-12 17:05:32,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:32,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:32,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174830752] [2022-07-12 17:05:32,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174830752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:32,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:32,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:32,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122048549] [2022-07-12 17:05:32,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:32,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:32,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:32,834 INFO L87 Difference]: Start difference. First operand 1858 states and 2484 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:05:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:36,758 INFO L93 Difference]: Finished difference Result 1858 states and 2484 transitions. [2022-07-12 17:05:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:36,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 107 [2022-07-12 17:05:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:36,766 INFO L225 Difference]: With dead ends: 1858 [2022-07-12 17:05:36,766 INFO L226 Difference]: Without dead ends: 1856 [2022-07-12 17:05:36,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:36,767 INFO L413 NwaCegarLoop]: 2260 mSDtfsCounter, 3342 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3621 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 4270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:36,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3621 Valid, 4478 Invalid, 4270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 17:05:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2022-07-12 17:05:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1856. [2022-07-12 17:05:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1192 states have (on average 1.2181208053691275) internal successors, (1452), 1237 states have internal predecessors, (1452), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2482 transitions. [2022-07-12 17:05:36,814 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2482 transitions. Word has length 107 [2022-07-12 17:05:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:36,814 INFO L495 AbstractCegarLoop]: Abstraction has 1856 states and 2482 transitions. [2022-07-12 17:05:36,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:05:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2482 transitions. [2022-07-12 17:05:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 17:05:36,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:36,815 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:36,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 17:05:36,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:36,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:36,816 INFO L85 PathProgramCache]: Analyzing trace with hash 379624396, now seen corresponding path program 1 times [2022-07-12 17:05:36,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:36,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501373964] [2022-07-12 17:05:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:36,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:37,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:37,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501373964] [2022-07-12 17:05:37,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501373964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:37,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:37,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774878337] [2022-07-12 17:05:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:37,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:37,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:37,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:37,223 INFO L87 Difference]: Start difference. First operand 1856 states and 2482 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:40,814 INFO L93 Difference]: Finished difference Result 1856 states and 2482 transitions. [2022-07-12 17:05:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:40,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 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 113 [2022-07-12 17:05:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:40,822 INFO L225 Difference]: With dead ends: 1856 [2022-07-12 17:05:40,822 INFO L226 Difference]: Without dead ends: 1854 [2022-07-12 17:05:40,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:40,823 INFO L413 NwaCegarLoop]: 2258 mSDtfsCounter, 3340 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3618 SdHoareTripleChecker+Valid, 4476 SdHoareTripleChecker+Invalid, 4264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:40,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3618 Valid, 4476 Invalid, 4264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 17:05:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-07-12 17:05:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854. [2022-07-12 17:05:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1191 states have (on average 1.2174643157010916) internal successors, (1450), 1235 states have internal predecessors, (1450), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2480 transitions. [2022-07-12 17:05:40,877 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2480 transitions. Word has length 113 [2022-07-12 17:05:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:40,877 INFO L495 AbstractCegarLoop]: Abstraction has 1854 states and 2480 transitions. [2022-07-12 17:05:40,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2480 transitions. [2022-07-12 17:05:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 17:05:40,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:40,879 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:40,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 17:05:40,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:40,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -253036209, now seen corresponding path program 1 times [2022-07-12 17:05:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:40,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951871127] [2022-07-12 17:05:40,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:41,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951871127] [2022-07-12 17:05:41,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951871127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:41,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:41,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:41,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659496344] [2022-07-12 17:05:41,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:41,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:41,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:41,418 INFO L87 Difference]: Start difference. First operand 1854 states and 2480 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:45,001 INFO L93 Difference]: Finished difference Result 1854 states and 2480 transitions. [2022-07-12 17:05:45,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:45,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 115 [2022-07-12 17:05:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:45,009 INFO L225 Difference]: With dead ends: 1854 [2022-07-12 17:05:45,009 INFO L226 Difference]: Without dead ends: 1852 [2022-07-12 17:05:45,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:45,011 INFO L413 NwaCegarLoop]: 2256 mSDtfsCounter, 3328 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3606 SdHoareTripleChecker+Valid, 4474 SdHoareTripleChecker+Invalid, 4266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:45,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3606 Valid, 4474 Invalid, 4266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 17:05:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-07-12 17:05:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1852. [2022-07-12 17:05:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1190 states have (on average 1.2168067226890755) internal successors, (1448), 1233 states have internal predecessors, (1448), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2478 transitions. [2022-07-12 17:05:45,166 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2478 transitions. Word has length 115 [2022-07-12 17:05:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:45,167 INFO L495 AbstractCegarLoop]: Abstraction has 1852 states and 2478 transitions. [2022-07-12 17:05:45,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 17:05:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2478 transitions. [2022-07-12 17:05:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 17:05:45,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:45,168 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:05:45,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 17:05:45,168 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1161560821, now seen corresponding path program 1 times [2022-07-12 17:05:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305949282] [2022-07-12 17:05:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:05:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:05:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:05:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:05:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:05:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:05:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:05:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:45,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305949282] [2022-07-12 17:05:45,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305949282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:45,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:45,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664274233] [2022-07-12 17:05:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:45,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:45,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:45,771 INFO L87 Difference]: Start difference. First operand 1852 states and 2478 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:05:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:49,386 INFO L93 Difference]: Finished difference Result 2627 states and 3415 transitions. [2022-07-12 17:05:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:05:49,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2022-07-12 17:05:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:49,395 INFO L225 Difference]: With dead ends: 2627 [2022-07-12 17:05:49,395 INFO L226 Difference]: Without dead ends: 1871 [2022-07-12 17:05:49,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:05:49,398 INFO L413 NwaCegarLoop]: 1940 mSDtfsCounter, 3727 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 2566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4025 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 4674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2566 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:49,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4025 Valid, 3773 Invalid, 4674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2566 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 17:05:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-07-12 17:05:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1848. [2022-07-12 17:05:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1187 states have (on average 1.215669755686605) internal successors, (1443), 1229 states have internal predecessors, (1443), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2473 transitions. [2022-07-12 17:05:49,475 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2473 transitions. Word has length 158 [2022-07-12 17:05:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:49,478 INFO L495 AbstractCegarLoop]: Abstraction has 1848 states and 2473 transitions. [2022-07-12 17:05:49,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 17:05:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2473 transitions. [2022-07-12 17:05:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 17:05:49,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:49,479 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:05:49,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 17:05:49,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1037344010, now seen corresponding path program 1 times [2022-07-12 17:05:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:49,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210249231] [2022-07-12 17:05:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:05:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:05:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:05:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:05:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:05:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:05:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:05:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:05:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:05:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:05:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:50,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:05:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:50,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:05:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:05:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:05:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210249231] [2022-07-12 17:05:50,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210249231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:50,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:50,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:05:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852550709] [2022-07-12 17:05:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:50,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:05:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:50,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:05:50,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:05:50,033 INFO L87 Difference]: Start difference. First operand 1848 states and 2473 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:53,668 INFO L93 Difference]: Finished difference Result 1848 states and 2473 transitions. [2022-07-12 17:05:53,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:05:53,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 121 [2022-07-12 17:05:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:53,697 INFO L225 Difference]: With dead ends: 1848 [2022-07-12 17:05:53,698 INFO L226 Difference]: Without dead ends: 1846 [2022-07-12 17:05:53,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:53,700 INFO L413 NwaCegarLoop]: 2249 mSDtfsCounter, 3319 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3596 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 4263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:53,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3596 Valid, 4453 Invalid, 4263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 17:05:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2022-07-12 17:05:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1846. [2022-07-12 17:05:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1186 states have (on average 1.215008431703204) internal successors, (1441), 1227 states have internal predecessors, (1441), 516 states have call successors, (516), 122 states have call predecessors, (516), 121 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-12 17:05:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2471 transitions. [2022-07-12 17:05:53,853 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2471 transitions. Word has length 121 [2022-07-12 17:05:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:53,854 INFO L495 AbstractCegarLoop]: Abstraction has 1846 states and 2471 transitions. [2022-07-12 17:05:53,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 17:05:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2471 transitions. [2022-07-12 17:05:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-12 17:05:53,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:53,855 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:05:53,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 17:05:53,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:53,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash 3490106, now seen corresponding path program 1 times [2022-07-12 17:05:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:53,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097112629] [2022-07-12 17:05:53,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:53,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:05:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:05:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:05:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:05:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:05:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:05:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:05:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-12 17:05:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:54,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097112629] [2022-07-12 17:05:54,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097112629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:05:54,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337298602] [2022-07-12 17:05:54,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:54,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:05:54,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:05:54,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:05:54,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 17:05:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:56,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 7793 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 17:05:56,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:05:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:05:56,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:05:56,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337298602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:56,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:05:56,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 17:05:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488905675] [2022-07-12 17:05:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:56,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 17:05:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 17:05:56,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:56,531 INFO L87 Difference]: Start difference. First operand 1846 states and 2471 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:05:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:05:56,675 INFO L93 Difference]: Finished difference Result 2645 states and 3428 transitions. [2022-07-12 17:05:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 17:05:56,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2022-07-12 17:05:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:05:56,683 INFO L225 Difference]: With dead ends: 2645 [2022-07-12 17:05:56,684 INFO L226 Difference]: Without dead ends: 1898 [2022-07-12 17:05:56,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:05:56,686 INFO L413 NwaCegarLoop]: 2530 mSDtfsCounter, 2446 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2446 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:05:56,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2446 Valid, 2597 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:05:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-07-12 17:05:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1895. [2022-07-12 17:05:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1215 states have (on average 1.2106995884773664) internal successors, (1471), 1259 states have internal predecessors, (1471), 531 states have call successors, (531), 128 states have call predecessors, (531), 127 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:05:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2531 transitions. [2022-07-12 17:05:56,886 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2531 transitions. Word has length 164 [2022-07-12 17:05:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:05:56,887 INFO L495 AbstractCegarLoop]: Abstraction has 1895 states and 2531 transitions. [2022-07-12 17:05:56,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:05:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2531 transitions. [2022-07-12 17:05:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-12 17:05:56,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:05:56,889 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:05:56,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 17:05:57,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 17:05:57,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:05:57,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:05:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash -951084831, now seen corresponding path program 1 times [2022-07-12 17:05:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:05:57,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683132465] [2022-07-12 17:05:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:05:57,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:05:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:05:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:05:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:05:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:05:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:05:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:05:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:05:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:05:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:05:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:05:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:05:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:05:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:05:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:05:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:05:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:05:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:05:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:05:57,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683132465] [2022-07-12 17:05:57,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683132465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:05:57,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:05:57,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:05:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670633901] [2022-07-12 17:05:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:05:57,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:05:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:05:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:05:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:05:57,804 INFO L87 Difference]: Start difference. First operand 1895 states and 2531 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:06:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:05,801 INFO L93 Difference]: Finished difference Result 3701 states and 5046 transitions. [2022-07-12 17:06:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 17:06:05,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 167 [2022-07-12 17:06:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:05,811 INFO L225 Difference]: With dead ends: 3701 [2022-07-12 17:06:05,811 INFO L226 Difference]: Without dead ends: 1924 [2022-07-12 17:06:05,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-07-12 17:06:05,819 INFO L413 NwaCegarLoop]: 2227 mSDtfsCounter, 3692 mSDsluCounter, 4311 mSDsCounter, 0 mSdLazyCounter, 6744 mSolverCounterSat, 2564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3979 SdHoareTripleChecker+Valid, 6538 SdHoareTripleChecker+Invalid, 9308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2564 IncrementalHoareTripleChecker+Valid, 6744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:05,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3979 Valid, 6538 Invalid, 9308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2564 Valid, 6744 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-07-12 17:06:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2022-07-12 17:06:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1901. [2022-07-12 17:06:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1219 states have (on average 1.2091878589007383) internal successors, (1474), 1263 states have internal predecessors, (1474), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2534 transitions. [2022-07-12 17:06:05,904 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2534 transitions. Word has length 167 [2022-07-12 17:06:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:05,905 INFO L495 AbstractCegarLoop]: Abstraction has 1901 states and 2534 transitions. [2022-07-12 17:06:05,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 17:06:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2534 transitions. [2022-07-12 17:06:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-12 17:06:05,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:05,908 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:06:05,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 17:06:05,908 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash -951025249, now seen corresponding path program 1 times [2022-07-12 17:06:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:05,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959485597] [2022-07-12 17:06:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:05,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 17:06:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:06:06,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:06,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959485597] [2022-07-12 17:06:06,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959485597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:06,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:06,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 17:06:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334914626] [2022-07-12 17:06:06,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:06,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 17:06:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 17:06:06,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 17:06:06,529 INFO L87 Difference]: Start difference. First operand 1901 states and 2534 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 17:06:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:13,035 INFO L93 Difference]: Finished difference Result 1924 states and 2573 transitions. [2022-07-12 17:06:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:06:13,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 167 [2022-07-12 17:06:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:13,044 INFO L225 Difference]: With dead ends: 1924 [2022-07-12 17:06:13,045 INFO L226 Difference]: Without dead ends: 1922 [2022-07-12 17:06:13,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 17:06:13,047 INFO L413 NwaCegarLoop]: 2226 mSDtfsCounter, 1993 mSDsluCounter, 3679 mSDsCounter, 0 mSdLazyCounter, 4882 mSolverCounterSat, 2092 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1993 SdHoareTripleChecker+Valid, 5905 SdHoareTripleChecker+Invalid, 6974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2092 IncrementalHoareTripleChecker+Valid, 4882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:13,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1993 Valid, 5905 Invalid, 6974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2092 Valid, 4882 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-12 17:06:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2022-07-12 17:06:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1899. [2022-07-12 17:06:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1218 states have (on average 1.2085385878489328) internal successors, (1472), 1261 states have internal predecessors, (1472), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2532 transitions. [2022-07-12 17:06:13,122 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2532 transitions. Word has length 167 [2022-07-12 17:06:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:13,123 INFO L495 AbstractCegarLoop]: Abstraction has 1899 states and 2532 transitions. [2022-07-12 17:06:13,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-12 17:06:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2532 transitions. [2022-07-12 17:06:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 17:06:13,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:13,125 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:13,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 17:06:13,126 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash 40942066, now seen corresponding path program 1 times [2022-07-12 17:06:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:13,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644161656] [2022-07-12 17:06:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:13,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644161656] [2022-07-12 17:06:13,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644161656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:13,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:13,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:13,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725435650] [2022-07-12 17:06:13,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:13,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:13,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:13,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:13,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:13,596 INFO L87 Difference]: Start difference. First operand 1899 states and 2532 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:06:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:17,624 INFO L93 Difference]: Finished difference Result 1899 states and 2532 transitions. [2022-07-12 17:06:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 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 127 [2022-07-12 17:06:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:17,631 INFO L225 Difference]: With dead ends: 1899 [2022-07-12 17:06:17,631 INFO L226 Difference]: Without dead ends: 1897 [2022-07-12 17:06:17,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:17,632 INFO L413 NwaCegarLoop]: 2239 mSDtfsCounter, 3299 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3575 SdHoareTripleChecker+Valid, 4429 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:17,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3575 Valid, 4429 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 17:06:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-07-12 17:06:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1897. [2022-07-12 17:06:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1217 states have (on average 1.2078882497945769) internal successors, (1470), 1259 states have internal predecessors, (1470), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2530 transitions. [2022-07-12 17:06:17,694 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2530 transitions. Word has length 127 [2022-07-12 17:06:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:17,695 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 2530 transitions. [2022-07-12 17:06:17,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 17:06:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2530 transitions. [2022-07-12 17:06:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-12 17:06:17,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:17,697 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-12 17:06:17,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 17:06:17,697 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1491341420, now seen corresponding path program 1 times [2022-07-12 17:06:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:17,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825560058] [2022-07-12 17:06:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 17:06:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:18,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825560058] [2022-07-12 17:06:18,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825560058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:18,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:18,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:18,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117994852] [2022-07-12 17:06:18,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:18,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:18,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:18,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:18,152 INFO L87 Difference]: Start difference. First operand 1897 states and 2530 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:06:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:22,368 INFO L93 Difference]: Finished difference Result 3695 states and 5036 transitions. [2022-07-12 17:06:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:22,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 174 [2022-07-12 17:06:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:22,377 INFO L225 Difference]: With dead ends: 3695 [2022-07-12 17:06:22,377 INFO L226 Difference]: Without dead ends: 1916 [2022-07-12 17:06:22,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:22,383 INFO L413 NwaCegarLoop]: 2221 mSDtfsCounter, 3656 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 2556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3945 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 4375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2556 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:22,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3945 Valid, 4042 Invalid, 4375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2556 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 17:06:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2022-07-12 17:06:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1893. [2022-07-12 17:06:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1214 states have (on average 1.2067545304777594) internal successors, (1465), 1255 states have internal predecessors, (1465), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2525 transitions. [2022-07-12 17:06:22,452 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2525 transitions. Word has length 174 [2022-07-12 17:06:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:22,452 INFO L495 AbstractCegarLoop]: Abstraction has 1893 states and 2525 transitions. [2022-07-12 17:06:22,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 17:06:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2525 transitions. [2022-07-12 17:06:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 17:06:22,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:22,454 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:22,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 17:06:22,454 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:22,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1263805297, now seen corresponding path program 1 times [2022-07-12 17:06:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:22,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709288172] [2022-07-12 17:06:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709288172] [2022-07-12 17:06:22,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709288172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:22,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:22,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:22,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957165891] [2022-07-12 17:06:22,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:22,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:22,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:22,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:22,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:22,976 INFO L87 Difference]: Start difference. First operand 1893 states and 2525 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:06:26,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 17:06:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:28,115 INFO L93 Difference]: Finished difference Result 1893 states and 2525 transitions. [2022-07-12 17:06:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:28,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 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 133 [2022-07-12 17:06:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:28,122 INFO L225 Difference]: With dead ends: 1893 [2022-07-12 17:06:28,123 INFO L226 Difference]: Without dead ends: 1891 [2022-07-12 17:06:28,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:28,125 INFO L413 NwaCegarLoop]: 2232 mSDtfsCounter, 3278 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3553 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 4250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:28,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3553 Valid, 4422 Invalid, 4250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-12 17:06:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-07-12 17:06:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2022-07-12 17:06:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1213 states have (on average 1.2061005770816158) internal successors, (1463), 1253 states have internal predecessors, (1463), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2523 transitions. [2022-07-12 17:06:28,201 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2523 transitions. Word has length 133 [2022-07-12 17:06:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:28,202 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 2523 transitions. [2022-07-12 17:06:28,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 17:06:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2523 transitions. [2022-07-12 17:06:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 17:06:28,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:28,203 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:28,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 17:06:28,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1476441388, now seen corresponding path program 1 times [2022-07-12 17:06:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:28,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441442035] [2022-07-12 17:06:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:28,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:28,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441442035] [2022-07-12 17:06:28,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441442035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:28,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:28,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:28,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457772201] [2022-07-12 17:06:28,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:28,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:28,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:28,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:28,669 INFO L87 Difference]: Start difference. First operand 1891 states and 2523 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:06:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:32,765 INFO L93 Difference]: Finished difference Result 1891 states and 2523 transitions. [2022-07-12 17:06:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 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 139 [2022-07-12 17:06:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:32,772 INFO L225 Difference]: With dead ends: 1891 [2022-07-12 17:06:32,773 INFO L226 Difference]: Without dead ends: 1889 [2022-07-12 17:06:32,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:32,774 INFO L413 NwaCegarLoop]: 2230 mSDtfsCounter, 3272 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3546 SdHoareTripleChecker+Valid, 4420 SdHoareTripleChecker+Invalid, 4248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:32,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3546 Valid, 4420 Invalid, 4248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 17:06:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2022-07-12 17:06:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1889. [2022-07-12 17:06:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1212 states have (on average 1.2054455445544554) internal successors, (1461), 1251 states have internal predecessors, (1461), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2521 transitions. [2022-07-12 17:06:32,943 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2521 transitions. Word has length 139 [2022-07-12 17:06:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:32,944 INFO L495 AbstractCegarLoop]: Abstraction has 1889 states and 2521 transitions. [2022-07-12 17:06:32,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 17:06:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2521 transitions. [2022-07-12 17:06:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 17:06:32,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:32,946 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:32,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 17:06:32,946 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1744457594, now seen corresponding path program 1 times [2022-07-12 17:06:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:32,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036518425] [2022-07-12 17:06:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:33,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036518425] [2022-07-12 17:06:33,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036518425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:33,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:33,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168925555] [2022-07-12 17:06:33,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:33,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:33,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:33,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:33,394 INFO L87 Difference]: Start difference. First operand 1889 states and 2521 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:06:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:36,601 INFO L93 Difference]: Finished difference Result 1889 states and 2521 transitions. [2022-07-12 17:06:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:36,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 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 145 [2022-07-12 17:06:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:36,607 INFO L225 Difference]: With dead ends: 1889 [2022-07-12 17:06:36,607 INFO L226 Difference]: Without dead ends: 1887 [2022-07-12 17:06:36,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:36,608 INFO L413 NwaCegarLoop]: 2228 mSDtfsCounter, 3266 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3539 SdHoareTripleChecker+Valid, 4418 SdHoareTripleChecker+Invalid, 4246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:36,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3539 Valid, 4418 Invalid, 4246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 17:06:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2022-07-12 17:06:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1887. [2022-07-12 17:06:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1211 states have (on average 1.2047894302229563) internal successors, (1459), 1249 states have internal predecessors, (1459), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2519 transitions. [2022-07-12 17:06:36,677 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2519 transitions. Word has length 145 [2022-07-12 17:06:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:36,677 INFO L495 AbstractCegarLoop]: Abstraction has 1887 states and 2519 transitions. [2022-07-12 17:06:36,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 17:06:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2519 transitions. [2022-07-12 17:06:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 17:06:36,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:36,679 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:36,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 17:06:36,679 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1280611182, now seen corresponding path program 1 times [2022-07-12 17:06:36,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:36,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372354045] [2022-07-12 17:06:36,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:36,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:37,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:37,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372354045] [2022-07-12 17:06:37,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372354045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:37,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:37,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:37,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610567413] [2022-07-12 17:06:37,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:37,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:37,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:37,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:37,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:37,083 INFO L87 Difference]: Start difference. First operand 1887 states and 2519 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:06:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:40,362 INFO L93 Difference]: Finished difference Result 1887 states and 2519 transitions. [2022-07-12 17:06:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-12 17:06:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:40,368 INFO L225 Difference]: With dead ends: 1887 [2022-07-12 17:06:40,368 INFO L226 Difference]: Without dead ends: 1885 [2022-07-12 17:06:40,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:40,371 INFO L413 NwaCegarLoop]: 2226 mSDtfsCounter, 3260 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3532 SdHoareTripleChecker+Valid, 4416 SdHoareTripleChecker+Invalid, 4244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:40,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3532 Valid, 4416 Invalid, 4244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 17:06:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2022-07-12 17:06:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1885. [2022-07-12 17:06:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1210 states have (on average 1.2041322314049587) internal successors, (1457), 1247 states have internal predecessors, (1457), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2517 transitions. [2022-07-12 17:06:40,459 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2517 transitions. Word has length 151 [2022-07-12 17:06:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:40,460 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 2517 transitions. [2022-07-12 17:06:40,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:06:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2517 transitions. [2022-07-12 17:06:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 17:06:40,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:40,461 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:40,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 17:06:40,461 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:40,462 INFO L85 PathProgramCache]: Analyzing trace with hash -838898210, now seen corresponding path program 1 times [2022-07-12 17:06:40,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:40,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781298684] [2022-07-12 17:06:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:40,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:06:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:40,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781298684] [2022-07-12 17:06:40,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781298684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:40,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:40,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158625355] [2022-07-12 17:06:40,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:40,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:40,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:40,934 INFO L87 Difference]: Start difference. First operand 1885 states and 2517 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:06:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:44,198 INFO L93 Difference]: Finished difference Result 1885 states and 2517 transitions. [2022-07-12 17:06:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:44,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-07-12 17:06:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:44,204 INFO L225 Difference]: With dead ends: 1885 [2022-07-12 17:06:44,204 INFO L226 Difference]: Without dead ends: 1883 [2022-07-12 17:06:44,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:44,205 INFO L413 NwaCegarLoop]: 2224 mSDtfsCounter, 3254 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3525 SdHoareTripleChecker+Valid, 4414 SdHoareTripleChecker+Invalid, 4242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:44,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3525 Valid, 4414 Invalid, 4242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 17:06:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2022-07-12 17:06:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1883. [2022-07-12 17:06:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1209 states have (on average 1.2034739454094292) internal successors, (1455), 1245 states have internal predecessors, (1455), 531 states have call successors, (531), 130 states have call predecessors, (531), 129 states have return successors, (529), 525 states have call predecessors, (529), 529 states have call successors, (529) [2022-07-12 17:06:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2515 transitions. [2022-07-12 17:06:44,281 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2515 transitions. Word has length 157 [2022-07-12 17:06:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:44,281 INFO L495 AbstractCegarLoop]: Abstraction has 1883 states and 2515 transitions. [2022-07-12 17:06:44,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:06:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2515 transitions. [2022-07-12 17:06:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 17:06:44,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:44,301 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:44,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 17:06:44,302 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:44,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -199714337, now seen corresponding path program 1 times [2022-07-12 17:06:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:44,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398150369] [2022-07-12 17:06:44,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:06:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:06:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:44,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398150369] [2022-07-12 17:06:44,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398150369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:44,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:44,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476677828] [2022-07-12 17:06:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:44,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:44,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:44,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:44,808 INFO L87 Difference]: Start difference. First operand 1883 states and 2515 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:06:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:49,570 INFO L93 Difference]: Finished difference Result 2269 states and 2989 transitions. [2022-07-12 17:06:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 17:06:49,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-07-12 17:06:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:49,577 INFO L225 Difference]: With dead ends: 2269 [2022-07-12 17:06:49,577 INFO L226 Difference]: Without dead ends: 2267 [2022-07-12 17:06:49,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:06:49,578 INFO L413 NwaCegarLoop]: 2222 mSDtfsCounter, 3794 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 2252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4054 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 5292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2252 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:49,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4054 Valid, 4426 Invalid, 5292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2252 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 17:06:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-07-12 17:06:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2257. [2022-07-12 17:06:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1454 states have (on average 1.1980742778541953) internal successors, (1742), 1489 states have internal predecessors, (1742), 621 states have call successors, (621), 170 states have call predecessors, (621), 169 states have return successors, (619), 615 states have call predecessors, (619), 619 states have call successors, (619) [2022-07-12 17:06:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2982 transitions. [2022-07-12 17:06:49,668 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 2982 transitions. Word has length 163 [2022-07-12 17:06:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:49,669 INFO L495 AbstractCegarLoop]: Abstraction has 2257 states and 2982 transitions. [2022-07-12 17:06:49,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 17:06:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 2982 transitions. [2022-07-12 17:06:49,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 17:06:49,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:49,671 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:49,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 17:06:49,671 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:49,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:49,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1579702988, now seen corresponding path program 1 times [2022-07-12 17:06:49,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:49,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541651805] [2022-07-12 17:06:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:49,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:06:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:06:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:06:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:06:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:06:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:06:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:06:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:06:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:06:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:06:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:06:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:06:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:06:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:06:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:06:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:06:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:50,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:06:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:50,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:06:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:06:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:06:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:06:50,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:50,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541651805] [2022-07-12 17:06:50,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541651805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:50,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:50,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:06:50,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893377112] [2022-07-12 17:06:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:50,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:06:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:50,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:06:50,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:06:50,031 INFO L87 Difference]: Start difference. First operand 2257 states and 2982 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:06:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:06:53,130 INFO L93 Difference]: Finished difference Result 2257 states and 2982 transitions. [2022-07-12 17:06:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:06:53,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-07-12 17:06:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:06:53,137 INFO L225 Difference]: With dead ends: 2257 [2022-07-12 17:06:53,137 INFO L226 Difference]: Without dead ends: 2255 [2022-07-12 17:06:53,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:06:53,141 INFO L413 NwaCegarLoop]: 2220 mSDtfsCounter, 3242 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3511 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 4238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:06:53,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3511 Valid, 4410 Invalid, 4238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 17:06:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2022-07-12 17:06:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2255. [2022-07-12 17:06:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1453 states have (on average 1.1975223675154851) internal successors, (1740), 1487 states have internal predecessors, (1740), 621 states have call successors, (621), 170 states have call predecessors, (621), 169 states have return successors, (619), 615 states have call predecessors, (619), 619 states have call successors, (619) [2022-07-12 17:06:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2980 transitions. [2022-07-12 17:06:53,239 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2980 transitions. Word has length 169 [2022-07-12 17:06:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:06:53,240 INFO L495 AbstractCegarLoop]: Abstraction has 2255 states and 2980 transitions. [2022-07-12 17:06:53,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:06:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2980 transitions. [2022-07-12 17:06:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-12 17:06:53,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:06:53,242 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:06:53,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 17:06:53,243 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:06:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:06:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash 100059458, now seen corresponding path program 1 times [2022-07-12 17:06:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:06:53,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809092909] [2022-07-12 17:06:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:06:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:06:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:06:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:06:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:06:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:06:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:06:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:06:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:06:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:06:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:06:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:06:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:06:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:06:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:06:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:06:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:06:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 17:06:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:06:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:06:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 17:06:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:06:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:06:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 17:06:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:06:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-12 17:06:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:06:53,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809092909] [2022-07-12 17:06:53,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809092909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:06:53,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:06:53,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:06:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602488451] [2022-07-12 17:06:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:06:53,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:06:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:06:53,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:06:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:06:53,892 INFO L87 Difference]: Start difference. First operand 2255 states and 2980 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:07:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:02,852 INFO L93 Difference]: Finished difference Result 2720 states and 3545 transitions. [2022-07-12 17:07:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:07:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 220 [2022-07-12 17:07:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:02,859 INFO L225 Difference]: With dead ends: 2720 [2022-07-12 17:07:02,859 INFO L226 Difference]: Without dead ends: 2718 [2022-07-12 17:07:02,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-12 17:07:02,861 INFO L413 NwaCegarLoop]: 2465 mSDtfsCounter, 4216 mSDsluCounter, 3793 mSDsCounter, 0 mSdLazyCounter, 6846 mSolverCounterSat, 3407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4458 SdHoareTripleChecker+Valid, 6258 SdHoareTripleChecker+Invalid, 10253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3407 IncrementalHoareTripleChecker+Valid, 6846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:02,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4458 Valid, 6258 Invalid, 10253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3407 Valid, 6846 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-07-12 17:07:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2022-07-12 17:07:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2676. [2022-07-12 17:07:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 1735 states have (on average 1.1902017291066282) internal successors, (2065), 1770 states have internal predecessors, (2065), 711 states have call successors, (711), 220 states have call predecessors, (711), 219 states have return successors, (709), 705 states have call predecessors, (709), 709 states have call successors, (709) [2022-07-12 17:07:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3485 transitions. [2022-07-12 17:07:03,032 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3485 transitions. Word has length 220 [2022-07-12 17:07:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:03,032 INFO L495 AbstractCegarLoop]: Abstraction has 2676 states and 3485 transitions. [2022-07-12 17:07:03,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 17:07:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3485 transitions. [2022-07-12 17:07:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 17:07:03,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:03,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:03,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 17:07:03,035 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:03,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash 679084499, now seen corresponding path program 1 times [2022-07-12 17:07:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:03,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879651922] [2022-07-12 17:07:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:07:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:07:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:07:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:07:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:07:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:07:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:07:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:07:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:07:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:07:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:07:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:07:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:07:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:07:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:07:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:07:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:07:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:07:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:07:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:07:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:07:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:07:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:03,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879651922] [2022-07-12 17:07:03,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879651922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:03,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:07:03,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:07:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722251677] [2022-07-12 17:07:03,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:03,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:07:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:03,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:07:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:07:03,588 INFO L87 Difference]: Start difference. First operand 2676 states and 3485 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:07:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:09,889 INFO L93 Difference]: Finished difference Result 3805 states and 4938 transitions. [2022-07-12 17:07:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:07:09,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-07-12 17:07:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:09,905 INFO L225 Difference]: With dead ends: 3805 [2022-07-12 17:07:09,905 INFO L226 Difference]: Without dead ends: 3803 [2022-07-12 17:07:09,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:07:09,907 INFO L413 NwaCegarLoop]: 2478 mSDtfsCounter, 4104 mSDsluCounter, 2664 mSDsCounter, 0 mSdLazyCounter, 4031 mSolverCounterSat, 2658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4367 SdHoareTripleChecker+Valid, 5142 SdHoareTripleChecker+Invalid, 6689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2658 IncrementalHoareTripleChecker+Valid, 4031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:09,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4367 Valid, 5142 Invalid, 6689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2658 Valid, 4031 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 17:07:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3803 states. [2022-07-12 17:07:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3803 to 3770. [2022-07-12 17:07:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 2453 states have (on average 1.1924174480228291) internal successors, (2925), 2494 states have internal predecessors, (2925), 989 states have call successors, (989), 318 states have call predecessors, (989), 317 states have return successors, (996), 982 states have call predecessors, (996), 987 states have call successors, (996) [2022-07-12 17:07:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 4910 transitions. [2022-07-12 17:07:10,073 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 4910 transitions. Word has length 175 [2022-07-12 17:07:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:10,074 INFO L495 AbstractCegarLoop]: Abstraction has 3770 states and 4910 transitions. [2022-07-12 17:07:10,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 17:07:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 4910 transitions. [2022-07-12 17:07:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-12 17:07:10,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:10,076 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:10,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 17:07:10,076 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_net_rtnetlink__double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:10,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash -55894581, now seen corresponding path program 1 times [2022-07-12 17:07:10,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:10,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156201951] [2022-07-12 17:07:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:07:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 17:07:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:07:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 17:07:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:07:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:07:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 17:07:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 17:07:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-12 17:07:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:10,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156201951] [2022-07-12 17:07:10,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156201951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:10,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:07:10,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:07:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688449736] [2022-07-12 17:07:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:10,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:07:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:10,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:07:10,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:07:10,601 INFO L87 Difference]: Start difference. First operand 3770 states and 4910 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:07:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:18,919 INFO L93 Difference]: Finished difference Result 3822 states and 4982 transitions. [2022-07-12 17:07:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 17:07:18,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 224 [2022-07-12 17:07:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:18,928 INFO L225 Difference]: With dead ends: 3822 [2022-07-12 17:07:18,929 INFO L226 Difference]: Without dead ends: 3820 [2022-07-12 17:07:18,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-12 17:07:18,930 INFO L413 NwaCegarLoop]: 2200 mSDtfsCounter, 4708 mSDsluCounter, 3693 mSDsCounter, 0 mSdLazyCounter, 5704 mSolverCounterSat, 3693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4981 SdHoareTripleChecker+Valid, 5893 SdHoareTripleChecker+Invalid, 9397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3693 IncrementalHoareTripleChecker+Valid, 5704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:18,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4981 Valid, 5893 Invalid, 9397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3693 Valid, 5704 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-12 17:07:18,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2022-07-12 17:07:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3768. [2022-07-12 17:07:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 2452 states have (on average 1.1916802610114192) internal successors, (2922), 2492 states have internal predecessors, (2922), 989 states have call successors, (989), 318 states have call predecessors, (989), 317 states have return successors, (996), 982 states have call predecessors, (996), 987 states have call successors, (996) [2022-07-12 17:07:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 4907 transitions. [2022-07-12 17:07:19,093 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 4907 transitions. Word has length 224 [2022-07-12 17:07:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:19,093 INFO L495 AbstractCegarLoop]: Abstraction has 3768 states and 4907 transitions. [2022-07-12 17:07:19,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 17:07:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 4907 transitions. [2022-07-12 17:07:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-12 17:07:19,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:19,095 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:19,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 17:07:19,096 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1808281440, now seen corresponding path program 1 times [2022-07-12 17:07:19,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:19,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185643454] [2022-07-12 17:07:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:07:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:07:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:07:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:07:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:07:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:07:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:07:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:07:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:07:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:07:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:07:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:07:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:07:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:07:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:07:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:07:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:07:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:07:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:07:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:07:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:07:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:07:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:07:19,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:19,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185643454] [2022-07-12 17:07:19,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185643454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:19,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:07:19,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:07:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564982920] [2022-07-12 17:07:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:19,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:07:19,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:19,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:07:19,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:07:19,484 INFO L87 Difference]: Start difference. First operand 3768 states and 4907 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:07:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:22,925 INFO L93 Difference]: Finished difference Result 3768 states and 4907 transitions. [2022-07-12 17:07:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 17:07:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-07-12 17:07:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:22,937 INFO L225 Difference]: With dead ends: 3768 [2022-07-12 17:07:22,938 INFO L226 Difference]: Without dead ends: 3766 [2022-07-12 17:07:22,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:07:22,941 INFO L413 NwaCegarLoop]: 2214 mSDtfsCounter, 3224 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 2322 mSolverCounterSat, 1910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3491 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 4232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1910 IncrementalHoareTripleChecker+Valid, 2322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:22,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3491 Valid, 4404 Invalid, 4232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1910 Valid, 2322 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 17:07:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2022-07-12 17:07:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3766. [2022-07-12 17:07:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 2451 states have (on average 1.1913504691962464) internal successors, (2920), 2490 states have internal predecessors, (2920), 989 states have call successors, (989), 318 states have call predecessors, (989), 317 states have return successors, (996), 982 states have call predecessors, (996), 987 states have call successors, (996) [2022-07-12 17:07:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 4905 transitions. [2022-07-12 17:07:23,173 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 4905 transitions. Word has length 181 [2022-07-12 17:07:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:23,174 INFO L495 AbstractCegarLoop]: Abstraction has 3766 states and 4905 transitions. [2022-07-12 17:07:23,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 17:07:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 4905 transitions. [2022-07-12 17:07:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-12 17:07:23,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:23,177 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:23,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 17:07:23,177 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_net_rtnetlink_past_rtnl_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:23,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash 304683425, now seen corresponding path program 1 times [2022-07-12 17:07:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:23,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287368598] [2022-07-12 17:07:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:07:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 17:07:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:07:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 17:07:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:07:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:07:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 17:07:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 17:07:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:07:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:07:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-12 17:07:23,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:23,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287368598] [2022-07-12 17:07:23,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287368598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:23,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:07:23,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:07:23,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727245843] [2022-07-12 17:07:23,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:23,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:07:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:07:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:07:23,692 INFO L87 Difference]: Start difference. First operand 3766 states and 4905 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (28), 7 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:07:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:32,773 INFO L93 Difference]: Finished difference Result 3818 states and 4977 transitions. [2022-07-12 17:07:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 17:07:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (28), 7 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 232 [2022-07-12 17:07:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:32,800 INFO L225 Difference]: With dead ends: 3818 [2022-07-12 17:07:32,800 INFO L226 Difference]: Without dead ends: 3816 [2022-07-12 17:07:32,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-07-12 17:07:32,802 INFO L413 NwaCegarLoop]: 2566 mSDtfsCounter, 3345 mSDsluCounter, 4296 mSDsCounter, 0 mSdLazyCounter, 5907 mSolverCounterSat, 3928 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3350 SdHoareTripleChecker+Valid, 6862 SdHoareTripleChecker+Invalid, 9835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3928 IncrementalHoareTripleChecker+Valid, 5907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:32,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3350 Valid, 6862 Invalid, 9835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3928 Valid, 5907 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-07-12 17:07:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2022-07-12 17:07:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3764. [2022-07-12 17:07:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 2450 states have (on average 1.1906122448979592) internal successors, (2917), 2488 states have internal predecessors, (2917), 989 states have call successors, (989), 318 states have call predecessors, (989), 317 states have return successors, (996), 982 states have call predecessors, (996), 987 states have call successors, (996) [2022-07-12 17:07:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 4902 transitions. [2022-07-12 17:07:32,987 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 4902 transitions. Word has length 232 [2022-07-12 17:07:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:32,988 INFO L495 AbstractCegarLoop]: Abstraction has 3764 states and 4902 transitions. [2022-07-12 17:07:32,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (28), 7 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 17:07:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 4902 transitions. [2022-07-12 17:07:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 17:07:32,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:32,990 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:32,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 17:07:32,990 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:32,991 INFO L85 PathProgramCache]: Analyzing trace with hash -919866016, now seen corresponding path program 1 times [2022-07-12 17:07:32,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:32,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469607720] [2022-07-12 17:07:32,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:32,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:07:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 17:07:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 17:07:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 17:07:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 17:07:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 17:07:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 17:07:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 17:07:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 17:07:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 17:07:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 17:07:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 17:07:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 17:07:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 17:07:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 17:07:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 17:07:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 17:07:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 17:07:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 17:07:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 17:07:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 17:07:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 17:07:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 17:07:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 17:07:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:33,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469607720] [2022-07-12 17:07:33,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469607720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:33,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:07:33,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 17:07:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955693358] [2022-07-12 17:07:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:33,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:07:33,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:07:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 17:07:33,418 INFO L87 Difference]: Start difference. First operand 3764 states and 4902 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:07:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:40,733 INFO L93 Difference]: Finished difference Result 7350 states and 9601 transitions. [2022-07-12 17:07:40,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 17:07:40,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-07-12 17:07:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:40,762 INFO L225 Difference]: With dead ends: 7350 [2022-07-12 17:07:40,762 INFO L226 Difference]: Without dead ends: 7154 [2022-07-12 17:07:40,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:07:40,765 INFO L413 NwaCegarLoop]: 3104 mSDtfsCounter, 4243 mSDsluCounter, 3776 mSDsCounter, 0 mSdLazyCounter, 5317 mSolverCounterSat, 2987 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4496 SdHoareTripleChecker+Valid, 6880 SdHoareTripleChecker+Invalid, 8304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2987 IncrementalHoareTripleChecker+Valid, 5317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:40,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4496 Valid, 6880 Invalid, 8304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2987 Valid, 5317 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-12 17:07:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7154 states. [2022-07-12 17:07:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7154 to 7134. [2022-07-12 17:07:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7134 states, 4660 states have (on average 1.1946351931330472) internal successors, (5567), 4716 states have internal predecessors, (5567), 1863 states have call successors, (1863), 606 states have call predecessors, (1863), 603 states have return successors, (1918), 1853 states have call predecessors, (1918), 1859 states have call successors, (1918) [2022-07-12 17:07:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 9348 transitions. [2022-07-12 17:07:41,130 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 9348 transitions. Word has length 187 [2022-07-12 17:07:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:41,130 INFO L495 AbstractCegarLoop]: Abstraction has 7134 states and 9348 transitions. [2022-07-12 17:07:41,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 17:07:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 9348 transitions. [2022-07-12 17:07:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-12 17:07:41,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:41,133 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:41,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 17:07:41,133 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_coherent_usb_free_coherentErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:41,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash 616667555, now seen corresponding path program 1 times [2022-07-12 17:07:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:41,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521521839] [2022-07-12 17:07:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:07:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 17:07:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:07:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 17:07:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:07:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:07:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 17:07:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 17:07:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:07:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:07:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-12 17:07:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 17:07:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2022-07-12 17:07:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:42,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521521839] [2022-07-12 17:07:42,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521521839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:42,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000696944] [2022-07-12 17:07:42,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:42,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:42,694 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) [2022-07-12 17:07:42,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 17:07:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:45,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 8251 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 17:07:45,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2022-07-12 17:07:45,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:07:45,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000696944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:45,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:07:45,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2022-07-12 17:07:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322902924] [2022-07-12 17:07:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:45,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 17:07:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 17:07:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-07-12 17:07:45,137 INFO L87 Difference]: Start difference. First operand 7134 states and 9348 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-12 17:07:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:45,639 INFO L93 Difference]: Finished difference Result 14195 states and 18598 transitions. [2022-07-12 17:07:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 17:07:45,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 253 [2022-07-12 17:07:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:45,665 INFO L225 Difference]: With dead ends: 14195 [2022-07-12 17:07:45,665 INFO L226 Difference]: Without dead ends: 7088 [2022-07-12 17:07:45,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-12 17:07:45,689 INFO L413 NwaCegarLoop]: 2403 mSDtfsCounter, 5 mSDsluCounter, 9547 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11950 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:45,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11950 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 17:07:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2022-07-12 17:07:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 7088. [2022-07-12 17:07:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7088 states, 4633 states have (on average 1.1951219512195121) internal successors, (5537), 4686 states have internal predecessors, (5537), 1850 states have call successors, (1850), 600 states have call predecessors, (1850), 597 states have return successors, (1905), 1841 states have call predecessors, (1905), 1846 states have call successors, (1905) [2022-07-12 17:07:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 9292 transitions. [2022-07-12 17:07:46,193 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 9292 transitions. Word has length 253 [2022-07-12 17:07:46,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:46,193 INFO L495 AbstractCegarLoop]: Abstraction has 7088 states and 9292 transitions. [2022-07-12 17:07:46,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-12 17:07:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 9292 transitions. [2022-07-12 17:07:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-12 17:07:46,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:46,196 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:46,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 17:07:46,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:46,412 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_usb_coherent_usb_free_coherentErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2142903071, now seen corresponding path program 1 times [2022-07-12 17:07:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:46,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764241863] [2022-07-12 17:07:46,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:46,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 17:07:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 17:07:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 17:07:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 17:07:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 17:07:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:07:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 17:07:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 17:07:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-12 17:07:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 17:07:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:07:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-12 17:07:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 17:07:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2022-07-12 17:07:47,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:47,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764241863] [2022-07-12 17:07:47,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764241863] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:47,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691754815] [2022-07-12 17:07:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:47,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:47,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:47,644 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) [2022-07-12 17:07:47,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 17:07:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:50,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 8249 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 17:07:50,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2022-07-12 17:07:50,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:07:50,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691754815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:50,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:07:50,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [14] total 25 [2022-07-12 17:07:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770443196] [2022-07-12 17:07:50,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:50,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:07:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:50,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:07:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2022-07-12 17:07:50,418 INFO L87 Difference]: Start difference. First operand 7088 states and 9292 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2022-07-12 17:07:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:51,664 INFO L93 Difference]: Finished difference Result 8535 states and 10975 transitions. [2022-07-12 17:07:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 17:07:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 253 [2022-07-12 17:07:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:51,686 INFO L225 Difference]: With dead ends: 8535 [2022-07-12 17:07:51,686 INFO L226 Difference]: Without dead ends: 7088 [2022-07-12 17:07:51,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 17:07:51,694 INFO L413 NwaCegarLoop]: 2394 mSDtfsCounter, 48 mSDsluCounter, 31017 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 33411 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:51,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 33411 Invalid, 662 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 17:07:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2022-07-12 17:07:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 7088. [2022-07-12 17:07:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7088 states, 4633 states have (on average 1.194906108353119) internal successors, (5536), 4686 states have internal predecessors, (5536), 1850 states have call successors, (1850), 600 states have call predecessors, (1850), 597 states have return successors, (1905), 1841 states have call predecessors, (1905), 1846 states have call successors, (1905) [2022-07-12 17:07:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 9291 transitions. [2022-07-12 17:07:52,057 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 9291 transitions. Word has length 253 [2022-07-12 17:07:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:52,058 INFO L495 AbstractCegarLoop]: Abstraction has 7088 states and 9291 transitions. [2022-07-12 17:07:52,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2022-07-12 17:07:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 9291 transitions. [2022-07-12 17:07:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-12 17:07:52,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:52,061 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:52,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 17:07:52,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:52,288 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_usb_coherent_usb_free_coherentErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1492859517, now seen corresponding path program 1 times [2022-07-12 17:07:52,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:52,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046104683] [2022-07-12 17:07:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 17:07:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:07:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 17:07:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 17:07:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 17:07:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 17:07:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 17:07:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-12 17:07:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-12 17:07:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-12 17:07:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-12 17:07:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 17:07:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-12 17:07:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:07:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-12 17:07:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 17:07:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 6 proven. 64 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2022-07-12 17:07:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:53,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046104683] [2022-07-12 17:07:53,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046104683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:53,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287069697] [2022-07-12 17:07:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:53,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:53,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 17:07:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:56,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 8338 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 17:07:56,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:07:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2022-07-12 17:07:56,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:07:56,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287069697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:07:56,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:07:56,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [14] total 25 [2022-07-12 17:07:56,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279085020] [2022-07-12 17:07:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:07:56,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 17:07:56,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:07:56,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 17:07:56,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2022-07-12 17:07:56,502 INFO L87 Difference]: Start difference. First operand 7088 states and 9291 transitions. Second operand has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-07-12 17:07:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:07:57,877 INFO L93 Difference]: Finished difference Result 9255 states and 12015 transitions. [2022-07-12 17:07:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:07:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 279 [2022-07-12 17:07:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:07:57,903 INFO L225 Difference]: With dead ends: 9255 [2022-07-12 17:07:57,903 INFO L226 Difference]: Without dead ends: 7428 [2022-07-12 17:07:57,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 17:07:57,914 INFO L413 NwaCegarLoop]: 2585 mSDtfsCounter, 578 mSDsluCounter, 32329 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 34914 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 17:07:57,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 34914 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 17:07:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2022-07-12 17:07:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 7106. [2022-07-12 17:07:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7106 states, 4645 states have (on average 1.193756727664155) internal successors, (5545), 4698 states have internal predecessors, (5545), 1856 states have call successors, (1856), 600 states have call predecessors, (1856), 597 states have return successors, (1911), 1847 states have call predecessors, (1911), 1852 states have call successors, (1911) [2022-07-12 17:07:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 9312 transitions. [2022-07-12 17:07:58,387 INFO L78 Accepts]: Start accepts. Automaton has 7106 states and 9312 transitions. Word has length 279 [2022-07-12 17:07:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:07:58,387 INFO L495 AbstractCegarLoop]: Abstraction has 7106 states and 9312 transitions. [2022-07-12 17:07:58,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2022-07-12 17:07:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7106 states and 9312 transitions. [2022-07-12 17:07:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-12 17:07:58,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:07:58,390 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:07:58,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 17:07:58,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:58,611 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_coherent_usb_free_coherentErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:07:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:07:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1627986322, now seen corresponding path program 1 times [2022-07-12 17:07:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:07:58,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236482269] [2022-07-12 17:07:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:07:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:07:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:07:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:07:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:07:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:07:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:07:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:07:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:07:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:07:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:07:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:07:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:07:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 17:07:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:07:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:07:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 17:07:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 17:07:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 17:07:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 17:07:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-12 17:07:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 17:07:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-12 17:07:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-12 17:07:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-12 17:07:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 17:07:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-12 17:07:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:07:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 17:07:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-12 17:07:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:07:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:07:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2022-07-12 17:07:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:07:59,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236482269] [2022-07-12 17:07:59,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236482269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 17:07:59,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544906327] [2022-07-12 17:07:59,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:07:59,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 17:07:59,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 17:07:59,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 17:07:59,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 17:08:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:02,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 8389 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 17:08:02,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 17:08:02,784 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-07-12 17:08:02,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 17:08:02,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544906327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:02,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 17:08:02,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [14] total 26 [2022-07-12 17:08:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946292709] [2022-07-12 17:08:02,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:02,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 17:08:02,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:02,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 17:08:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2022-07-12 17:08:02,785 INFO L87 Difference]: Start difference. First operand 7106 states and 9312 transitions. Second operand has 16 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 7 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2022-07-12 17:08:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:03,853 INFO L93 Difference]: Finished difference Result 8570 states and 11021 transitions. [2022-07-12 17:08:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:08:03,854 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 7 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) Word has length 299 [2022-07-12 17:08:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:03,877 INFO L225 Difference]: With dead ends: 8570 [2022-07-12 17:08:03,877 INFO L226 Difference]: Without dead ends: 7118 [2022-07-12 17:08:03,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 17:08:03,885 INFO L413 NwaCegarLoop]: 2399 mSDtfsCounter, 76 mSDsluCounter, 33448 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 35847 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:03,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 35847 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 17:08:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7118 states. [2022-07-12 17:08:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7118 to 7106. [2022-07-12 17:08:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7106 states, 4645 states have (on average 1.1928955866523143) internal successors, (5541), 4695 states have internal predecessors, (5541), 1856 states have call successors, (1856), 600 states have call predecessors, (1856), 597 states have return successors, (1911), 1847 states have call predecessors, (1911), 1852 states have call successors, (1911) [2022-07-12 17:08:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 9308 transitions. [2022-07-12 17:08:04,260 INFO L78 Accepts]: Start accepts. Automaton has 7106 states and 9308 transitions. Word has length 299 [2022-07-12 17:08:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:04,261 INFO L495 AbstractCegarLoop]: Abstraction has 7106 states and 9308 transitions. [2022-07-12 17:08:04,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.533333333333333) internal successors, (128), 15 states have internal predecessors, (128), 7 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2022-07-12 17:08:04,261 INFO L276 IsEmpty]: Start isEmpty. Operand 7106 states and 9308 transitions. [2022-07-12 17:08:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2022-07-12 17:08:04,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:04,264 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:08:04,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 17:08:04,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-12 17:08:04,492 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ar5523_cmdErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:08:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 244188620, now seen corresponding path program 1 times [2022-07-12 17:08:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:04,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705013963] [2022-07-12 17:08:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:08:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:08:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:08:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:08:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:08:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:04,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:08:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:08:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 17:08:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:08:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 17:08:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:08:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 17:08:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-12 17:08:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 17:08:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 17:08:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-12 17:08:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 17:08:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-12 17:08:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:08:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-07-12 17:08:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-12 17:08:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-07-12 17:08:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-12 17:08:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-12 17:08:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-12 17:08:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-07-12 17:08:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2022-07-12 17:08:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-07-12 17:08:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2022-07-12 17:08:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:08:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2022-07-12 17:08:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:05,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705013963] [2022-07-12 17:08:05,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705013963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:05,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:05,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 17:08:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104934212] [2022-07-12 17:08:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:05,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 17:08:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 17:08:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 17:08:05,254 INFO L87 Difference]: Start difference. First operand 7106 states and 9308 transitions. Second operand has 11 states, 9 states have (on average 13.777777777777779) internal successors, (124), 4 states have internal predecessors, (124), 5 states have call successors, (44), 8 states have call predecessors, (44), 1 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2022-07-12 17:08:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:16,338 INFO L93 Difference]: Finished difference Result 14716 states and 19678 transitions. [2022-07-12 17:08:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 17:08:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 13.777777777777779) internal successors, (124), 4 states have internal predecessors, (124), 5 states have call successors, (44), 8 states have call predecessors, (44), 1 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 410 [2022-07-12 17:08:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:16,363 INFO L225 Difference]: With dead ends: 14716 [2022-07-12 17:08:16,363 INFO L226 Difference]: Without dead ends: 7733 [2022-07-12 17:08:16,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-12 17:08:16,387 INFO L413 NwaCegarLoop]: 2144 mSDtfsCounter, 4013 mSDsluCounter, 6342 mSDsCounter, 0 mSdLazyCounter, 8190 mSolverCounterSat, 4595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4013 SdHoareTripleChecker+Valid, 8486 SdHoareTripleChecker+Invalid, 12785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4595 IncrementalHoareTripleChecker+Valid, 8190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:16,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4013 Valid, 8486 Invalid, 12785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4595 Valid, 8190 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2022-07-12 17:08:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7733 states. [2022-07-12 17:08:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7733 to 7376. [2022-07-12 17:08:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7376 states, 4843 states have (on average 1.1936816023126162) internal successors, (5781), 4899 states have internal predecessors, (5781), 1922 states have call successors, (1922), 606 states have call predecessors, (1922), 603 states have return successors, (1977), 1907 states have call predecessors, (1977), 1918 states have call successors, (1977) [2022-07-12 17:08:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7376 states to 7376 states and 9680 transitions. [2022-07-12 17:08:16,816 INFO L78 Accepts]: Start accepts. Automaton has 7376 states and 9680 transitions. Word has length 410 [2022-07-12 17:08:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:16,817 INFO L495 AbstractCegarLoop]: Abstraction has 7376 states and 9680 transitions. [2022-07-12 17:08:16,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 13.777777777777779) internal successors, (124), 4 states have internal predecessors, (124), 5 states have call successors, (44), 8 states have call predecessors, (44), 1 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2022-07-12 17:08:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 9680 transitions. [2022-07-12 17:08:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2022-07-12 17:08:16,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:16,821 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:08:16,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 17:08:16,821 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ar5523_cmdErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:08:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1782528650, now seen corresponding path program 1 times [2022-07-12 17:08:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:16,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309461328] [2022-07-12 17:08:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:08:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:08:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:08:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:08:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:08:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:08:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:08:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 17:08:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:08:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 17:08:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:08:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 17:08:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-12 17:08:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 17:08:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 17:08:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-12 17:08:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 17:08:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-12 17:08:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:08:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-07-12 17:08:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-12 17:08:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-07-12 17:08:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-12 17:08:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-12 17:08:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-12 17:08:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-07-12 17:08:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2022-07-12 17:08:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2022-07-12 17:08:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2022-07-12 17:08:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:08:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2022-07-12 17:08:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:18,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309461328] [2022-07-12 17:08:18,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309461328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:18,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:18,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 17:08:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398801014] [2022-07-12 17:08:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:18,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 17:08:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:18,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 17:08:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-12 17:08:18,006 INFO L87 Difference]: Start difference. First operand 7376 states and 9680 transitions. Second operand has 12 states, 11 states have (on average 11.272727272727273) internal successors, (124), 4 states have internal predecessors, (124), 4 states have call successors, (44), 9 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 3 states have call successors, (41) [2022-07-12 17:08:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:31,837 INFO L93 Difference]: Finished difference Result 16266 states and 21671 transitions. [2022-07-12 17:08:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 17:08:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 11.272727272727273) internal successors, (124), 4 states have internal predecessors, (124), 4 states have call successors, (44), 9 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 3 states have call successors, (41) Word has length 410 [2022-07-12 17:08:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:31,868 INFO L225 Difference]: With dead ends: 16266 [2022-07-12 17:08:31,868 INFO L226 Difference]: Without dead ends: 9013 [2022-07-12 17:08:31,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2022-07-12 17:08:31,889 INFO L413 NwaCegarLoop]: 2150 mSDtfsCounter, 4119 mSDsluCounter, 7259 mSDsCounter, 0 mSdLazyCounter, 9862 mSolverCounterSat, 4658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4119 SdHoareTripleChecker+Valid, 9409 SdHoareTripleChecker+Invalid, 14520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4658 IncrementalHoareTripleChecker+Valid, 9862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:31,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4119 Valid, 9409 Invalid, 14520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4658 Valid, 9862 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2022-07-12 17:08:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9013 states. [2022-07-12 17:08:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9013 to 7964. [2022-07-12 17:08:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7964 states, 5281 states have (on average 1.1935239537966293) internal successors, (6303), 5343 states have internal predecessors, (6303), 2054 states have call successors, (2054), 624 states have call predecessors, (2054), 621 states have return successors, (2109), 2033 states have call predecessors, (2109), 2050 states have call successors, (2109) [2022-07-12 17:08:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7964 states to 7964 states and 10466 transitions. [2022-07-12 17:08:32,379 INFO L78 Accepts]: Start accepts. Automaton has 7964 states and 10466 transitions. Word has length 410 [2022-07-12 17:08:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:32,380 INFO L495 AbstractCegarLoop]: Abstraction has 7964 states and 10466 transitions. [2022-07-12 17:08:32,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 11.272727272727273) internal successors, (124), 4 states have internal predecessors, (124), 4 states have call successors, (44), 9 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 3 states have call successors, (41) [2022-07-12 17:08:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7964 states and 10466 transitions. [2022-07-12 17:08:32,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2022-07-12 17:08:32,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:32,383 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:08:32,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 17:08:32,384 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ar5523_cmdErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:08:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1935940568, now seen corresponding path program 1 times [2022-07-12 17:08:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:32,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008318897] [2022-07-12 17:08:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:32,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:08:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:08:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:08:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:08:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:08:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:32,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:08:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:08:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 17:08:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:08:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 17:08:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:08:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 17:08:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-12 17:08:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 17:08:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 17:08:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-12 17:08:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 17:08:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-12 17:08:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:08:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-07-12 17:08:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-12 17:08:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-12 17:08:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2022-07-12 17:08:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-07-12 17:08:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-12 17:08:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2022-07-12 17:08:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 379 [2022-07-12 17:08:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2022-07-12 17:08:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 389 [2022-07-12 17:08:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:08:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2022-07-12 17:08:33,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:33,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008318897] [2022-07-12 17:08:33,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008318897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:33,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:33,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:08:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444119953] [2022-07-12 17:08:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:33,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:08:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:08:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:08:33,319 INFO L87 Difference]: Start difference. First operand 7964 states and 10466 transitions. Second operand has 10 states, 9 states have (on average 14.444444444444445) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (44), 9 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 3 states have call successors, (41) [2022-07-12 17:08:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:08:43,231 INFO L93 Difference]: Finished difference Result 15848 states and 21145 transitions. [2022-07-12 17:08:43,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:08:43,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.444444444444445) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (44), 9 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 3 states have call successors, (41) Word has length 416 [2022-07-12 17:08:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:08:43,256 INFO L225 Difference]: With dead ends: 15848 [2022-07-12 17:08:43,256 INFO L226 Difference]: Without dead ends: 8007 [2022-07-12 17:08:43,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-07-12 17:08:43,281 INFO L413 NwaCegarLoop]: 2140 mSDtfsCounter, 3731 mSDsluCounter, 5419 mSDsCounter, 0 mSdLazyCounter, 6609 mSolverCounterSat, 4411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3731 SdHoareTripleChecker+Valid, 7559 SdHoareTripleChecker+Invalid, 11020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4411 IncrementalHoareTripleChecker+Valid, 6609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:08:43,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3731 Valid, 7559 Invalid, 11020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4411 Valid, 6609 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-07-12 17:08:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8007 states. [2022-07-12 17:08:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8007 to 7652. [2022-07-12 17:08:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7652 states, 5047 states have (on average 1.1917971071923916) internal successors, (6015), 5097 states have internal predecessors, (6015), 1982 states have call successors, (1982), 618 states have call predecessors, (1982), 615 states have return successors, (2037), 1973 states have call predecessors, (2037), 1978 states have call successors, (2037) [2022-07-12 17:08:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 10034 transitions. [2022-07-12 17:08:43,783 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 10034 transitions. Word has length 416 [2022-07-12 17:08:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:08:43,784 INFO L495 AbstractCegarLoop]: Abstraction has 7652 states and 10034 transitions. [2022-07-12 17:08:43,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.444444444444445) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (44), 9 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 3 states have call successors, (41) [2022-07-12 17:08:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 10034 transitions. [2022-07-12 17:08:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-07-12 17:08:43,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:08:43,787 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:08:43,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-12 17:08:43,787 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ar5523_cmdErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 32 more)] === [2022-07-12 17:08:43,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:08:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash -170837734, now seen corresponding path program 1 times [2022-07-12 17:08:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:08:43,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696432487] [2022-07-12 17:08:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:08:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:08:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:08:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 17:08:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 17:08:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 17:08:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 17:08:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 17:08:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 17:08:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 17:08:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 17:08:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 17:08:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 17:08:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 17:08:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 17:08:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 17:08:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 17:08:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 17:08:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-12 17:08:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-12 17:08:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 17:08:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:08:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:08:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-12 17:08:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 17:08:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-12 17:08:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 17:08:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-07-12 17:08:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-12 17:08:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-07-12 17:08:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-12 17:08:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-07-12 17:08:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2022-07-12 17:08:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-12 17:08:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2022-07-12 17:08:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-12 17:08:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-12 17:08:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:08:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 17:08:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:08:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2022-07-12 17:08:45,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:08:45,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696432487] [2022-07-12 17:08:45,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696432487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:08:45,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:08:45,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:08:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570139443] [2022-07-12 17:08:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:08:45,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:08:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:08:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:08:45,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:08:45,485 INFO L87 Difference]: Start difference. First operand 7652 states and 10034 transitions. Second operand has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (44), 7 states have call predecessors, (44), 2 states have return successors, (41), 2 states have call predecessors, (41), 3 states have call successors, (41) [2022-07-12 17:08:52,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []