./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--block--virtio_blk.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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--block--virtio_blk.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 cc21d3f2365aa3e9759266a2897b17abd63f704e2f2c46d2220f73d4b814d4db --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:19:20,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:19:20,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:19:20,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:19:20,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:19:20,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:19:20,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:19:20,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:19:20,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:19:20,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:19:20,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:19:20,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:19:20,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:19:20,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:19:20,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:19:20,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:19:20,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:19:20,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:19:20,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:19:20,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:19:20,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:19:20,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:19:20,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:19:20,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:19:20,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:19:20,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:19:20,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:19:20,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:19:20,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:19:20,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:19:20,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:19:20,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:19:20,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:19:20,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:19:20,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:19:20,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:19:20,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:19:20,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:19:20,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:19:20,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:19:20,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:19:20,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 05:19:20,970 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:19:20,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:19:20,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:19:20,971 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:19:20,972 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:19:20,972 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:19:20,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:19:20,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:19:20,974 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:19:20,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:19:20,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:19:20,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:19:20,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 05:19:20,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:19:20,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 05:19:20,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 05:19:20,975 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:19:20,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 05:19:20,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:19:20,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:19:20,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:19:20,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:19:20,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:19:20,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:19:20,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 05:19:20,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:19:20,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:19:20,977 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 05:19:20,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 05:19:20,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 05:19:20,977 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 -> cc21d3f2365aa3e9759266a2897b17abd63f704e2f2c46d2220f73d4b814d4db [2021-12-28 05:19:21,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:19:21,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:19:21,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:19:21,266 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:19:21,266 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:19:21,267 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--block--virtio_blk.ko.cil.i [2021-12-28 05:19:21,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc92797c8/8db2ea298b594773b39ce0e831ff2309/FLAGe6e0a0042 [2021-12-28 05:19:22,015 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:19:22,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i [2021-12-28 05:19:22,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc92797c8/8db2ea298b594773b39ce0e831ff2309/FLAGe6e0a0042 [2021-12-28 05:19:22,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc92797c8/8db2ea298b594773b39ce0e831ff2309 [2021-12-28 05:19:22,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:19:22,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:19:22,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:19:22,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:19:22,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:19:22,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:19:22" (1/1) ... [2021-12-28 05:19:22,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560607a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:22, skipping insertion in model container [2021-12-28 05:19:22,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:19:22" (1/1) ... [2021-12-28 05:19:22,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:19:22,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:19:24,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[300556,300569] [2021-12-28 05:19:24,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[300701,300714] [2021-12-28 05:19:24,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[300847,300860] [2021-12-28 05:19:24,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301012,301025] [2021-12-28 05:19:24,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301170,301183] [2021-12-28 05:19:24,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301328,301341] [2021-12-28 05:19:24,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301486,301499] [2021-12-28 05:19:24,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301646,301659] [2021-12-28 05:19:24,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301805,301818] [2021-12-28 05:19:24,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301944,301957] [2021-12-28 05:19:24,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302086,302099] [2021-12-28 05:19:24,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302235,302248] [2021-12-28 05:19:24,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302374,302387] [2021-12-28 05:19:24,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302529,302542] [2021-12-28 05:19:24,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302689,302702] [2021-12-28 05:19:24,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302840,302853] [2021-12-28 05:19:24,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302991,303004] [2021-12-28 05:19:24,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303143,303156] [2021-12-28 05:19:24,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303292,303305] [2021-12-28 05:19:24,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303440,303453] [2021-12-28 05:19:24,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303597,303610] [2021-12-28 05:19:24,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303746,303759] [2021-12-28 05:19:24,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303902,303915] [2021-12-28 05:19:24,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304055,304068] [2021-12-28 05:19:24,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304201,304214] [2021-12-28 05:19:24,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304344,304357] [2021-12-28 05:19:24,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304496,304509] [2021-12-28 05:19:24,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304642,304655] [2021-12-28 05:19:24,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304787,304800] [2021-12-28 05:19:24,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304941,304954] [2021-12-28 05:19:24,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305092,305105] [2021-12-28 05:19:24,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305247,305260] [2021-12-28 05:19:24,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305399,305412] [2021-12-28 05:19:24,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305554,305567] [2021-12-28 05:19:24,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305718,305731] [2021-12-28 05:19:24,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305874,305887] [2021-12-28 05:19:24,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306038,306051] [2021-12-28 05:19:24,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306180,306193] [2021-12-28 05:19:24,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306338,306351] [2021-12-28 05:19:24,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306505,306518] [2021-12-28 05:19:24,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306664,306677] [2021-12-28 05:19:24,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306823,306836] [2021-12-28 05:19:24,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306972,306985] [2021-12-28 05:19:24,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307119,307132] [2021-12-28 05:19:24,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307258,307271] [2021-12-28 05:19:24,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307421,307434] [2021-12-28 05:19:24,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307587,307600] [2021-12-28 05:19:24,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307751,307764] [2021-12-28 05:19:24,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307916,307929] [2021-12-28 05:19:24,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308081,308094] [2021-12-28 05:19:24,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308247,308260] [2021-12-28 05:19:24,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308412,308425] [2021-12-28 05:19:24,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308579,308592] [2021-12-28 05:19:24,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308739,308752] [2021-12-28 05:19:24,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308901,308914] [2021-12-28 05:19:24,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309060,309073] [2021-12-28 05:19:24,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309206,309219] [2021-12-28 05:19:24,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309349,309362] [2021-12-28 05:19:24,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309493,309506] [2021-12-28 05:19:24,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309636,309649] [2021-12-28 05:19:24,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309780,309793] [2021-12-28 05:19:24,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309921,309934] [2021-12-28 05:19:24,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310059,310072] [2021-12-28 05:19:24,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310217,310230] [2021-12-28 05:19:24,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310376,310389] [2021-12-28 05:19:24,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310532,310545] [2021-12-28 05:19:24,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310681,310694] [2021-12-28 05:19:24,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310833,310846] [2021-12-28 05:19:24,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310984,310997] [2021-12-28 05:19:24,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311133,311146] [2021-12-28 05:19:24,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311285,311298] [2021-12-28 05:19:24,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311433,311446] [2021-12-28 05:19:24,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311586,311599] [2021-12-28 05:19:24,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311737,311750] [2021-12-28 05:19:24,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311887,311900] [2021-12-28 05:19:24,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312034,312047] [2021-12-28 05:19:24,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312185,312198] [2021-12-28 05:19:24,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312336,312349] [2021-12-28 05:19:24,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312484,312497] [2021-12-28 05:19:24,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312650,312663] [2021-12-28 05:19:24,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312819,312832] [2021-12-28 05:19:24,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312986,312999] [2021-12-28 05:19:24,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313154,313167] [2021-12-28 05:19:24,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313304,313317] [2021-12-28 05:19:24,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313451,313464] [2021-12-28 05:19:24,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313612,313625] [2021-12-28 05:19:24,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313782,313795] [2021-12-28 05:19:24,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313944,313957] [2021-12-28 05:19:24,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:19:24,429 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:19:24,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[300556,300569] [2021-12-28 05:19:24,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[300701,300714] [2021-12-28 05:19:24,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[300847,300860] [2021-12-28 05:19:24,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301012,301025] [2021-12-28 05:19:24,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301170,301183] [2021-12-28 05:19:24,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301328,301341] [2021-12-28 05:19:24,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301486,301499] [2021-12-28 05:19:24,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301646,301659] [2021-12-28 05:19:24,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301805,301818] [2021-12-28 05:19:24,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[301944,301957] [2021-12-28 05:19:24,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302086,302099] [2021-12-28 05:19:24,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302235,302248] [2021-12-28 05:19:24,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302374,302387] [2021-12-28 05:19:24,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302529,302542] [2021-12-28 05:19:24,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302689,302702] [2021-12-28 05:19:24,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302840,302853] [2021-12-28 05:19:24,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[302991,303004] [2021-12-28 05:19:24,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303143,303156] [2021-12-28 05:19:24,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303292,303305] [2021-12-28 05:19:24,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303440,303453] [2021-12-28 05:19:24,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303597,303610] [2021-12-28 05:19:24,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303746,303759] [2021-12-28 05:19:24,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[303902,303915] [2021-12-28 05:19:24,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304055,304068] [2021-12-28 05:19:24,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304201,304214] [2021-12-28 05:19:24,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304344,304357] [2021-12-28 05:19:24,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304496,304509] [2021-12-28 05:19:24,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304642,304655] [2021-12-28 05:19:24,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304787,304800] [2021-12-28 05:19:24,705 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[304941,304954] [2021-12-28 05:19:24,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305092,305105] [2021-12-28 05:19:24,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305247,305260] [2021-12-28 05:19:24,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305399,305412] [2021-12-28 05:19:24,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305554,305567] [2021-12-28 05:19:24,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305718,305731] [2021-12-28 05:19:24,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[305874,305887] [2021-12-28 05:19:24,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306038,306051] [2021-12-28 05:19:24,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306180,306193] [2021-12-28 05:19:24,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306338,306351] [2021-12-28 05:19:24,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306505,306518] [2021-12-28 05:19:24,710 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306664,306677] [2021-12-28 05:19:24,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306823,306836] [2021-12-28 05:19:24,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[306972,306985] [2021-12-28 05:19:24,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307119,307132] [2021-12-28 05:19:24,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307258,307271] [2021-12-28 05:19:24,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307421,307434] [2021-12-28 05:19:24,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307587,307600] [2021-12-28 05:19:24,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307751,307764] [2021-12-28 05:19:24,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[307916,307929] [2021-12-28 05:19:24,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308081,308094] [2021-12-28 05:19:24,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308247,308260] [2021-12-28 05:19:24,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308412,308425] [2021-12-28 05:19:24,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308579,308592] [2021-12-28 05:19:24,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308739,308752] [2021-12-28 05:19:24,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[308901,308914] [2021-12-28 05:19:24,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309060,309073] [2021-12-28 05:19:24,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309206,309219] [2021-12-28 05:19:24,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309349,309362] [2021-12-28 05:19:24,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309493,309506] [2021-12-28 05:19:24,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309636,309649] [2021-12-28 05:19:24,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309780,309793] [2021-12-28 05:19:24,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[309921,309934] [2021-12-28 05:19:24,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310059,310072] [2021-12-28 05:19:24,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310217,310230] [2021-12-28 05:19:24,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310376,310389] [2021-12-28 05:19:24,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310532,310545] [2021-12-28 05:19:24,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310681,310694] [2021-12-28 05:19:24,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310833,310846] [2021-12-28 05:19:24,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[310984,310997] [2021-12-28 05:19:24,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311133,311146] [2021-12-28 05:19:24,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311285,311298] [2021-12-28 05:19:24,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311433,311446] [2021-12-28 05:19:24,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311586,311599] [2021-12-28 05:19:24,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311737,311750] [2021-12-28 05:19:24,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[311887,311900] [2021-12-28 05:19:24,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312034,312047] [2021-12-28 05:19:24,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312185,312198] [2021-12-28 05:19:24,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312336,312349] [2021-12-28 05:19:24,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312484,312497] [2021-12-28 05:19:24,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312650,312663] [2021-12-28 05:19:24,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312819,312832] [2021-12-28 05:19:24,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[312986,312999] [2021-12-28 05:19:24,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313154,313167] [2021-12-28 05:19:24,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313304,313317] [2021-12-28 05:19:24,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313451,313464] [2021-12-28 05:19:24,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313612,313625] [2021-12-28 05:19:24,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313782,313795] [2021-12-28 05:19:24,742 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i[313944,313957] [2021-12-28 05:19:24,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:19:24,877 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:19:24,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24 WrapperNode [2021-12-28 05:19:24,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:19:24,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:19:24,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:19:24,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:19:24,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:24,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,063 INFO L137 Inliner]: procedures = 554, calls = 1441, calls flagged for inlining = 247, calls inlined = 157, statements flattened = 3174 [2021-12-28 05:19:25,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:19:25,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:19:25,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:19:25,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:19:25,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:19:25,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:19:25,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:19:25,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:19:25,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (1/1) ... [2021-12-28 05:19:25,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:19:25,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:19:25,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:19:25,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:19:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2021-12-28 05:19:25,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2021-12-28 05:19:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:19:25,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:19:25,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 05:19:25,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 05:19:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:19:25,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:19:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_del_gendisk [2021-12-28 05:19:25,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_del_gendisk [2021-12-28 05:19:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-28 05:19:25,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-28 05:19:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:19:25,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:19:25,277 INFO L130 BoogieDeclarations]: Found specification of procedure init_vq [2021-12-28 05:19:25,277 INFO L138 BoogieDeclarations]: Found implementation of procedure init_vq [2021-12-28 05:19:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:19:25,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:19:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_config_changed [2021-12-28 05:19:25,278 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_config_changed [2021-12-28 05:19:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-28 05:19:25,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-28 05:19:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-28 05:19:25,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-28 05:19:25,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:19:25,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:19:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:19:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_get_cache_mode [2021-12-28 05:19:25,279 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_get_cache_mode [2021-12-28 05:19:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-28 05:19:25,279 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-28 05:19:25,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:19:25,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:19:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure string_get_size [2021-12-28 05:19:25,280 INFO L138 BoogieDeclarations]: Found implementation of procedure string_get_size [2021-12-28 05:19:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-28 05:19:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure blk_mq_free_tag_set [2021-12-28 05:19:25,280 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_mq_free_tag_set [2021-12-28 05:19:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_update_cache_mode [2021-12-28 05:19:25,280 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_update_cache_mode [2021-12-28 05:19:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-28 05:19:25,280 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_blk_cleanup_queue [2021-12-28 05:19:25,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_blk_cleanup_queue [2021-12-28 05:19:25,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-28 05:19:25,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-28 05:19:25,281 INFO L130 BoogieDeclarations]: Found specification of procedure flush_work [2021-12-28 05:19:25,281 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_work [2021-12-28 05:19:25,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-28 05:19:25,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-28 05:19:25,281 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_flush [2021-12-28 05:19:25,281 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_flush [2021-12-28 05:19:25,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:19:25,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:19:25,282 INFO L130 BoogieDeclarations]: Found specification of procedure ida_simple_remove [2021-12-28 05:19:25,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ida_simple_remove [2021-12-28 05:19:25,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:19:25,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:19:25,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:19:25,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-28 05:19:25,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-28 05:19:25,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:19:25,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:19:25,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-28 05:19:25,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-28 05:19:25,283 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2021-12-28 05:19:25,283 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2021-12-28 05:19:25,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:19:25,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:19:25,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:19:25,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:19:25,283 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_cread8 [2021-12-28 05:19:25,284 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_cread8 [2021-12-28 05:19:25,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:19:25,284 INFO L130 BoogieDeclarations]: Found specification of procedure revalidate_disk [2021-12-28 05:19:25,284 INFO L138 BoogieDeclarations]: Found implementation of procedure revalidate_disk [2021-12-28 05:19:25,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:19:25,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-28 05:19:25,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-28 05:19:25,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:19:25,284 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2021-12-28 05:19:25,285 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2021-12-28 05:19:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-12-28 05:19:25,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-12-28 05:19:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2021-12-28 05:19:25,285 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2021-12-28 05:19:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_cache_type_store [2021-12-28 05:19:25,285 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_cache_type_store [2021-12-28 05:19:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2021-12-28 05:19:25,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2021-12-28 05:19:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:19:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:19:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:19:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:19:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2021-12-28 05:19:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2021-12-28 05:19:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-28 05:19:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-28 05:19:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-28 05:19:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-28 05:19:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-28 05:19:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-28 05:19:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_cread32 [2021-12-28 05:19:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_cread32 [2021-12-28 05:19:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2021-12-28 05:19:25,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2021-12-28 05:19:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2021-12-28 05:19:25,303 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2021-12-28 05:19:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure del_gendisk [2021-12-28 05:19:25,303 INFO L138 BoogieDeclarations]: Found implementation of procedure del_gendisk [2021-12-28 05:19:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2021-12-28 05:19:25,303 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2021-12-28 05:19:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2021-12-28 05:19:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2021-12-28 05:19:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_cread16 [2021-12-28 05:19:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_cread16 [2021-12-28 05:19:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:19:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:19:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2021-12-28 05:19:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2021-12-28 05:19:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:19:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:19:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_cread64 [2021-12-28 05:19:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_cread64 [2021-12-28 05:19:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:19:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:19:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:19:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_block_request__double_get [2021-12-28 05:19:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_block_request__double_get [2021-12-28 05:19:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure blk_mq_rq_to_pdu [2021-12-28 05:19:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_mq_rq_to_pdu [2021-12-28 05:19:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:19:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:19:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure virtio32_to_cpu [2021-12-28 05:19:25,306 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio32_to_cpu [2021-12-28 05:19:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:19:25,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:19:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-28 05:19:25,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-28 05:19:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure blk_mq_start_stopped_hw_queues [2021-12-28 05:19:25,306 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_mq_start_stopped_hw_queues [2021-12-28 05:19:25,306 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2021-12-28 05:19:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2021-12-28 05:19:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:19:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:19:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:19:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:19:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-28 05:19:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2021-12-28 05:19:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:19:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:19:25,307 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-28 05:19:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-28 05:19:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:19:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:19:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:19:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-28 05:19:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-28 05:19:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_virtio_blk_vq [2021-12-28 05:19:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_virtio_blk_vq [2021-12-28 05:19:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:19:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:19:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2021-12-28 05:19:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2021-12-28 05:19:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure queue_logical_block_size [2021-12-28 05:19:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_logical_block_size [2021-12-28 05:19:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-28 05:19:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-28 05:19:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:19:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:19:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2021-12-28 05:19:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2021-12-28 05:19:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_put_disk [2021-12-28 05:19:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_put_disk [2021-12-28 05:19:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:19:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_device_ready [2021-12-28 05:19:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_device_ready [2021-12-28 05:19:25,852 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:19:25,855 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:19:26,205 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-28 05:19:27,302 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:19:27,316 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:19:27,316 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-12-28 05:19:27,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:19:27 BoogieIcfgContainer [2021-12-28 05:19:27,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:19:27,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:19:27,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:19:27,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:19:27,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:19:22" (1/3) ... [2021-12-28 05:19:27,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44123c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:19:27, skipping insertion in model container [2021-12-28 05:19:27,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:19:24" (2/3) ... [2021-12-28 05:19:27,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44123c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:19:27, skipping insertion in model container [2021-12-28 05:19:27,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:19:27" (3/3) ... [2021-12-28 05:19:27,326 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--block--virtio_blk.ko.cil.i [2021-12-28 05:19:27,329 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:19:27,330 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2021-12-28 05:19:27,374 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:19:27,379 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:19:27,379 INFO L340 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2021-12-28 05:19:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 1211 states, 829 states have (on average 1.284680337756333) internal successors, (1065), 870 states have internal predecessors, (1065), 281 states have call successors, (281), 80 states have call predecessors, (281), 79 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2021-12-28 05:19:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-28 05:19:27,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:27,420 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:27,420 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -923090692, now seen corresponding path program 1 times [2021-12-28 05:19:27,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:27,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474930515] [2021-12-28 05:19:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:27,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:27,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:27,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474930515] [2021-12-28 05:19:27,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474930515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:27,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:27,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:27,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13527542] [2021-12-28 05:19:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:27,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:27,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:27,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:27,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:27,908 INFO L87 Difference]: Start difference. First operand has 1211 states, 829 states have (on average 1.284680337756333) internal successors, (1065), 870 states have internal predecessors, (1065), 281 states have call successors, (281), 80 states have call predecessors, (281), 79 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 05:19:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:29,437 INFO L93 Difference]: Finished difference Result 2254 states and 3109 transitions. [2021-12-28 05:19:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2021-12-28 05:19:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:29,456 INFO L225 Difference]: With dead ends: 2254 [2021-12-28 05:19:29,456 INFO L226 Difference]: Without dead ends: 1063 [2021-12-28 05:19:29,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:29,489 INFO L933 BasicCegarLoop]: 1267 mSDtfsCounter, 2027 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:29,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2173 Valid, 2539 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-28 05:19:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-12-28 05:19:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2021-12-28 05:19:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 718 states have (on average 1.2103064066852367) internal successors, (869), 767 states have internal predecessors, (869), 236 states have call successors, (236), 79 states have call predecessors, (236), 78 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2021-12-28 05:19:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1339 transitions. [2021-12-28 05:19:29,596 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1339 transitions. Word has length 50 [2021-12-28 05:19:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:29,597 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1339 transitions. [2021-12-28 05:19:29,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 05:19:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1339 transitions. [2021-12-28 05:19:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 05:19:29,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:29,600 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:29,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:19:29,601 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash -376852613, now seen corresponding path program 1 times [2021-12-28 05:19:29,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:29,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666798348] [2021-12-28 05:19:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:29,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:29,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666798348] [2021-12-28 05:19:29,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666798348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:29,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:29,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:29,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693326669] [2021-12-28 05:19:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:29,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:29,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:29,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:29,794 INFO L87 Difference]: Start difference. First operand 1063 states and 1339 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 05:19:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:32,581 INFO L93 Difference]: Finished difference Result 2053 states and 2596 transitions. [2021-12-28 05:19:32,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:19:32,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2021-12-28 05:19:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:32,592 INFO L225 Difference]: With dead ends: 2053 [2021-12-28 05:19:32,593 INFO L226 Difference]: Without dead ends: 2051 [2021-12-28 05:19:32,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:19:32,595 INFO L933 BasicCegarLoop]: 1690 mSDtfsCounter, 2683 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 2757 mSolverCounterSat, 1297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2813 SdHoareTripleChecker+Valid, 3861 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1297 IncrementalHoareTripleChecker+Valid, 2757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:32,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2813 Valid, 3861 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1297 Valid, 2757 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-12-28 05:19:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2021-12-28 05:19:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1858. [2021-12-28 05:19:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1280 states have (on average 1.2125) internal successors, (1552), 1348 states have internal predecessors, (1552), 413 states have call successors, (413), 135 states have call predecessors, (413), 134 states have return successors, (426), 404 states have call predecessors, (426), 411 states have call successors, (426) [2021-12-28 05:19:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2391 transitions. [2021-12-28 05:19:32,684 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2391 transitions. Word has length 56 [2021-12-28 05:19:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:32,685 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 2391 transitions. [2021-12-28 05:19:32,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 05:19:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2391 transitions. [2021-12-28 05:19:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 05:19:32,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:32,687 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:32,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:19:32,688 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash -721796001, now seen corresponding path program 1 times [2021-12-28 05:19:32,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:32,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255323902] [2021-12-28 05:19:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:32,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:32,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:32,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255323902] [2021-12-28 05:19:32,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255323902] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:32,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:32,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:32,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897701111] [2021-12-28 05:19:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:32,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:32,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:32,824 INFO L87 Difference]: Start difference. First operand 1858 states and 2391 transitions. 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, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-28 05:19:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:34,182 INFO L93 Difference]: Finished difference Result 1858 states and 2391 transitions. [2021-12-28 05:19:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:34,183 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, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2021-12-28 05:19:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:34,192 INFO L225 Difference]: With dead ends: 1858 [2021-12-28 05:19:34,192 INFO L226 Difference]: Without dead ends: 1856 [2021-12-28 05:19:34,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:34,194 INFO L933 BasicCegarLoop]: 1250 mSDtfsCounter, 1996 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:34,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2133 Valid, 2510 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:19:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2021-12-28 05:19:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1856. [2021-12-28 05:19:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1279 states have (on average 1.2118842845973417) internal successors, (1550), 1346 states have internal predecessors, (1550), 413 states have call successors, (413), 135 states have call predecessors, (413), 134 states have return successors, (426), 404 states have call predecessors, (426), 411 states have call successors, (426) [2021-12-28 05:19:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2389 transitions. [2021-12-28 05:19:34,258 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2389 transitions. Word has length 62 [2021-12-28 05:19:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:34,258 INFO L470 AbstractCegarLoop]: Abstraction has 1856 states and 2389 transitions. [2021-12-28 05:19:34,258 INFO L471 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, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-28 05:19:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2389 transitions. [2021-12-28 05:19:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-28 05:19:34,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:34,260 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:34,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:19:34,261 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1804222514, now seen corresponding path program 1 times [2021-12-28 05:19:34,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:34,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484413920] [2021-12-28 05:19:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:34,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:34,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:34,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484413920] [2021-12-28 05:19:34,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484413920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:34,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:34,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:34,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132576381] [2021-12-28 05:19:34,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:34,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:34,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:34,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:34,410 INFO L87 Difference]: Start difference. First operand 1856 states and 2389 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, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 05:19:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:36,198 INFO L93 Difference]: Finished difference Result 2421 states and 3037 transitions. [2021-12-28 05:19:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:19:36,198 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, (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 68 [2021-12-28 05:19:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:36,213 INFO L225 Difference]: With dead ends: 2421 [2021-12-28 05:19:36,213 INFO L226 Difference]: Without dead ends: 2419 [2021-12-28 05:19:36,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:19:36,216 INFO L933 BasicCegarLoop]: 1309 mSDtfsCounter, 2433 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 948 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 2615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 948 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:36,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2574 Valid, 2700 Invalid, 2615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [948 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-28 05:19:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2021-12-28 05:19:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2370. [2021-12-28 05:19:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 1631 states have (on average 1.2035561005518087) internal successors, (1963), 1702 states have internal predecessors, (1963), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3004 transitions. [2021-12-28 05:19:36,319 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3004 transitions. Word has length 68 [2021-12-28 05:19:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:36,319 INFO L470 AbstractCegarLoop]: Abstraction has 2370 states and 3004 transitions. [2021-12-28 05:19:36,320 INFO L471 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, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 05:19:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3004 transitions. [2021-12-28 05:19:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-28 05:19:36,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:36,322 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:36,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:19:36,322 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 780461203, now seen corresponding path program 1 times [2021-12-28 05:19:36,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:36,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753079452] [2021-12-28 05:19:36,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:36,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:36,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:36,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753079452] [2021-12-28 05:19:36,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753079452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:36,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:36,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:36,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337949360] [2021-12-28 05:19:36,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:36,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:36,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:36,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:36,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:36,507 INFO L87 Difference]: Start difference. First operand 2370 states and 3004 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, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 05:19:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:37,897 INFO L93 Difference]: Finished difference Result 2370 states and 3004 transitions. [2021-12-28 05:19:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:37,897 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, (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 74 [2021-12-28 05:19:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:37,912 INFO L225 Difference]: With dead ends: 2370 [2021-12-28 05:19:37,912 INFO L226 Difference]: Without dead ends: 2368 [2021-12-28 05:19:37,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:37,914 INFO L933 BasicCegarLoop]: 1249 mSDtfsCounter, 1991 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2131 SdHoareTripleChecker+Valid, 2509 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:37,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2131 Valid, 2509 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-28 05:19:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2021-12-28 05:19:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2021-12-28 05:19:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1630 states have (on average 1.2024539877300613) internal successors, (1960), 1700 states have internal predecessors, (1960), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3001 transitions. [2021-12-28 05:19:37,991 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3001 transitions. Word has length 74 [2021-12-28 05:19:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:37,991 INFO L470 AbstractCegarLoop]: Abstraction has 2368 states and 3001 transitions. [2021-12-28 05:19:37,992 INFO L471 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, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-28 05:19:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3001 transitions. [2021-12-28 05:19:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-28 05:19:37,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:37,993 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:37,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:19:37,994 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 913568252, now seen corresponding path program 1 times [2021-12-28 05:19:37,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:37,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122229438] [2021-12-28 05:19:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:37,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:38,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:38,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122229438] [2021-12-28 05:19:38,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122229438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:38,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:38,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:38,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534257097] [2021-12-28 05:19:38,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:38,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:38,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:38,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:38,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:38,168 INFO L87 Difference]: Start difference. First operand 2368 states and 3001 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, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-28 05:19:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:39,407 INFO L93 Difference]: Finished difference Result 2368 states and 3001 transitions. [2021-12-28 05:19:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:39,407 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, (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 80 [2021-12-28 05:19:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:39,417 INFO L225 Difference]: With dead ends: 2368 [2021-12-28 05:19:39,418 INFO L226 Difference]: Without dead ends: 2366 [2021-12-28 05:19:39,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:39,421 INFO L933 BasicCegarLoop]: 1247 mSDtfsCounter, 1985 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:39,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2124 Valid, 2507 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:19:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-12-28 05:19:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2021-12-28 05:19:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1629 states have (on average 1.2013505217925107) internal successors, (1957), 1698 states have internal predecessors, (1957), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 2998 transitions. [2021-12-28 05:19:39,511 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 2998 transitions. Word has length 80 [2021-12-28 05:19:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:39,513 INFO L470 AbstractCegarLoop]: Abstraction has 2366 states and 2998 transitions. [2021-12-28 05:19:39,513 INFO L471 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, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-28 05:19:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2998 transitions. [2021-12-28 05:19:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-28 05:19:39,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:39,517 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:39,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:19:39,517 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash -437614153, now seen corresponding path program 1 times [2021-12-28 05:19:39,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:39,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486064088] [2021-12-28 05:19:39,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:39,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:19:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:39,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486064088] [2021-12-28 05:19:39,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486064088] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:39,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:39,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:39,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456053588] [2021-12-28 05:19:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:39,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:39,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:39,672 INFO L87 Difference]: Start difference. First operand 2366 states and 2998 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, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 05:19:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:40,920 INFO L93 Difference]: Finished difference Result 2366 states and 2998 transitions. [2021-12-28 05:19:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:40,921 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, (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 86 [2021-12-28 05:19:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:40,938 INFO L225 Difference]: With dead ends: 2366 [2021-12-28 05:19:40,938 INFO L226 Difference]: Without dead ends: 2364 [2021-12-28 05:19:40,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:40,940 INFO L933 BasicCegarLoop]: 1245 mSDtfsCounter, 1979 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2117 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:40,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2117 Valid, 2505 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:19:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2021-12-28 05:19:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2364. [2021-12-28 05:19:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 1628 states have (on average 1.2002457002457003) internal successors, (1954), 1696 states have internal predecessors, (1954), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 2995 transitions. [2021-12-28 05:19:41,040 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 2995 transitions. Word has length 86 [2021-12-28 05:19:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:41,041 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 2995 transitions. [2021-12-28 05:19:41,041 INFO L471 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, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 05:19:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2995 transitions. [2021-12-28 05:19:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-28 05:19:41,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:41,042 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:41,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:19:41,043 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash -656719705, now seen corresponding path program 1 times [2021-12-28 05:19:41,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:41,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928106845] [2021-12-28 05:19:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:41,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:19:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:19:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:41,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:41,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928106845] [2021-12-28 05:19:41,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928106845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:41,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:41,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:41,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426818745] [2021-12-28 05:19:41,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:41,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:41,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:41,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:41,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:41,200 INFO L87 Difference]: Start difference. First operand 2364 states and 2995 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:19:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:42,340 INFO L93 Difference]: Finished difference Result 2364 states and 2995 transitions. [2021-12-28 05:19:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:42,340 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, (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 92 [2021-12-28 05:19:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:42,367 INFO L225 Difference]: With dead ends: 2364 [2021-12-28 05:19:42,368 INFO L226 Difference]: Without dead ends: 2362 [2021-12-28 05:19:42,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:42,369 INFO L933 BasicCegarLoop]: 1243 mSDtfsCounter, 1977 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:42,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2114 Valid, 2503 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-28 05:19:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2021-12-28 05:19:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2021-12-28 05:19:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 1627 states have (on average 1.199139520590043) internal successors, (1951), 1694 states have internal predecessors, (1951), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2992 transitions. [2021-12-28 05:19:42,459 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2992 transitions. Word has length 92 [2021-12-28 05:19:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:42,459 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2992 transitions. [2021-12-28 05:19:42,468 INFO L471 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:19:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2992 transitions. [2021-12-28 05:19:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 05:19:42,470 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:42,470 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:42,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:19:42,470 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 252701098, now seen corresponding path program 1 times [2021-12-28 05:19:42,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:42,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417780521] [2021-12-28 05:19:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:42,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:19:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:19:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:42,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:42,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417780521] [2021-12-28 05:19:42,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417780521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:42,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:42,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:42,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724512074] [2021-12-28 05:19:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:42,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:42,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:42,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:42,626 INFO L87 Difference]: Start difference. First operand 2362 states and 2992 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:19:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:43,831 INFO L93 Difference]: Finished difference Result 2362 states and 2992 transitions. [2021-12-28 05:19:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2021-12-28 05:19:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:43,845 INFO L225 Difference]: With dead ends: 2362 [2021-12-28 05:19:43,846 INFO L226 Difference]: Without dead ends: 2360 [2021-12-28 05:19:43,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:43,850 INFO L933 BasicCegarLoop]: 1241 mSDtfsCounter, 1965 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:43,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2102 Valid, 2501 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:19:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2021-12-28 05:19:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2360. [2021-12-28 05:19:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 1626 states have (on average 1.1980319803198032) internal successors, (1948), 1692 states have internal predecessors, (1948), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 2989 transitions. [2021-12-28 05:19:43,946 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 2989 transitions. Word has length 94 [2021-12-28 05:19:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:43,946 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 2989 transitions. [2021-12-28 05:19:43,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:19:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2989 transitions. [2021-12-28 05:19:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-28 05:19:43,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:43,948 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:43,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:19:43,948 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:43,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1323316452, now seen corresponding path program 1 times [2021-12-28 05:19:43,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:43,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663119978] [2021-12-28 05:19:43,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:43,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:19:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:19:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:19:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:44,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:44,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663119978] [2021-12-28 05:19:44,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663119978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:44,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:44,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:44,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038909616] [2021-12-28 05:19:44,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:44,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:44,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:44,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:44,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:44,132 INFO L87 Difference]: Start difference. First operand 2360 states and 2989 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-28 05:19:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:45,324 INFO L93 Difference]: Finished difference Result 2360 states and 2989 transitions. [2021-12-28 05:19:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:45,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2021-12-28 05:19:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:45,333 INFO L225 Difference]: With dead ends: 2360 [2021-12-28 05:19:45,334 INFO L226 Difference]: Without dead ends: 2358 [2021-12-28 05:19:45,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:45,336 INFO L933 BasicCegarLoop]: 1239 mSDtfsCounter, 1961 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2097 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:45,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2097 Valid, 2499 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:19:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2021-12-28 05:19:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2358. [2021-12-28 05:19:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1625 states have (on average 1.196923076923077) internal successors, (1945), 1690 states have internal predecessors, (1945), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 2986 transitions. [2021-12-28 05:19:45,453 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 2986 transitions. Word has length 100 [2021-12-28 05:19:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:45,453 INFO L470 AbstractCegarLoop]: Abstraction has 2358 states and 2986 transitions. [2021-12-28 05:19:45,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-28 05:19:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2986 transitions. [2021-12-28 05:19:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-28 05:19:45,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:45,457 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:45,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:19:45,457 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -235668590, now seen corresponding path program 1 times [2021-12-28 05:19:45,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798584133] [2021-12-28 05:19:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:45,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:19:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:19:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:19:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:19:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:45,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:45,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798584133] [2021-12-28 05:19:45,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798584133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:45,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:45,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:45,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485500350] [2021-12-28 05:19:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:45,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:45,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:45,633 INFO L87 Difference]: Start difference. First operand 2358 states and 2986 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, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 05:19:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:46,942 INFO L93 Difference]: Finished difference Result 2358 states and 2986 transitions. [2021-12-28 05:19:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:46,942 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, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2021-12-28 05:19:46,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:46,951 INFO L225 Difference]: With dead ends: 2358 [2021-12-28 05:19:46,951 INFO L226 Difference]: Without dead ends: 2356 [2021-12-28 05:19:46,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:46,953 INFO L933 BasicCegarLoop]: 1237 mSDtfsCounter, 1955 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2090 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:46,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2090 Valid, 2497 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:19:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2021-12-28 05:19:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2356. [2021-12-28 05:19:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1624 states have (on average 1.1958128078817734) internal successors, (1942), 1688 states have internal predecessors, (1942), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2983 transitions. [2021-12-28 05:19:47,045 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2983 transitions. Word has length 106 [2021-12-28 05:19:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:47,045 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 2983 transitions. [2021-12-28 05:19:47,046 INFO L471 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, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 05:19:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2983 transitions. [2021-12-28 05:19:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-28 05:19:47,047 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:47,047 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:47,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:19:47,047 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1421295643, now seen corresponding path program 1 times [2021-12-28 05:19:47,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:47,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182692384] [2021-12-28 05:19:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:47,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:19:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:19:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:19:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:19:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:19:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:47,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:47,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182692384] [2021-12-28 05:19:47,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182692384] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:47,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:47,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:47,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900076243] [2021-12-28 05:19:47,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:47,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:47,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:47,237 INFO L87 Difference]: Start difference. First operand 2356 states and 2983 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, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-28 05:19:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:48,527 INFO L93 Difference]: Finished difference Result 2356 states and 2983 transitions. [2021-12-28 05:19:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:48,527 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, (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 112 [2021-12-28 05:19:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:48,540 INFO L225 Difference]: With dead ends: 2356 [2021-12-28 05:19:48,541 INFO L226 Difference]: Without dead ends: 2354 [2021-12-28 05:19:48,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:48,543 INFO L933 BasicCegarLoop]: 1235 mSDtfsCounter, 1949 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:48,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2083 Valid, 2495 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:19:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2021-12-28 05:19:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2021-12-28 05:19:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 1623 states have (on average 1.1947011706715958) internal successors, (1939), 1686 states have internal predecessors, (1939), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 2980 transitions. [2021-12-28 05:19:48,651 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 2980 transitions. Word has length 112 [2021-12-28 05:19:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:48,653 INFO L470 AbstractCegarLoop]: Abstraction has 2354 states and 2980 transitions. [2021-12-28 05:19:48,653 INFO L471 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, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-28 05:19:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2980 transitions. [2021-12-28 05:19:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-28 05:19:48,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:48,655 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:48,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:19:48,655 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1546267020, now seen corresponding path program 1 times [2021-12-28 05:19:48,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:48,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843313570] [2021-12-28 05:19:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:48,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:19:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:19:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:19:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:19:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:19:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:19:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:48,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:48,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843313570] [2021-12-28 05:19:48,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843313570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:48,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:48,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:48,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282451736] [2021-12-28 05:19:48,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:48,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:48,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:48,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:48,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:48,816 INFO L87 Difference]: Start difference. First operand 2354 states and 2980 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, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-28 05:19:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:50,046 INFO L93 Difference]: Finished difference Result 2354 states and 2980 transitions. [2021-12-28 05:19:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:50,046 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, (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 118 [2021-12-28 05:19:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:50,061 INFO L225 Difference]: With dead ends: 2354 [2021-12-28 05:19:50,061 INFO L226 Difference]: Without dead ends: 2352 [2021-12-28 05:19:50,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:50,065 INFO L933 BasicCegarLoop]: 1233 mSDtfsCounter, 1943 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:50,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2076 Valid, 2493 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:19:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2021-12-28 05:19:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2352. [2021-12-28 05:19:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 1622 states have (on average 1.1935881627620222) internal successors, (1936), 1684 states have internal predecessors, (1936), 514 states have call successors, (514), 196 states have call predecessors, (514), 195 states have return successors, (527), 503 states have call predecessors, (527), 512 states have call successors, (527) [2021-12-28 05:19:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 2977 transitions. [2021-12-28 05:19:50,162 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 2977 transitions. Word has length 118 [2021-12-28 05:19:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:50,163 INFO L470 AbstractCegarLoop]: Abstraction has 2352 states and 2977 transitions. [2021-12-28 05:19:50,163 INFO L471 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, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-28 05:19:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2977 transitions. [2021-12-28 05:19:50,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-28 05:19:50,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:50,165 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:50,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:19:50,166 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:50,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1462377836, now seen corresponding path program 1 times [2021-12-28 05:19:50,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:50,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510541991] [2021-12-28 05:19:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:50,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:19:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 05:19:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:19:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:19:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 05:19:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:19:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:19:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 05:19:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:19:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-28 05:19:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-12-28 05:19:50,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:50,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510541991] [2021-12-28 05:19:50,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510541991] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:50,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:50,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:19:50,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898099541] [2021-12-28 05:19:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:50,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:19:50,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:50,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:19:50,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:19:50,376 INFO L87 Difference]: Start difference. First operand 2352 states and 2977 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:19:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:51,567 INFO L93 Difference]: Finished difference Result 5716 states and 7519 transitions. [2021-12-28 05:19:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:19:51,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 153 [2021-12-28 05:19:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:51,583 INFO L225 Difference]: With dead ends: 5716 [2021-12-28 05:19:51,584 INFO L226 Difference]: Without dead ends: 3390 [2021-12-28 05:19:51,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:19:51,594 INFO L933 BasicCegarLoop]: 1905 mSDtfsCounter, 683 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 3821 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:51,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 3821 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-28 05:19:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2021-12-28 05:19:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 2358. [2021-12-28 05:19:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1626 states have (on average 1.1931119311193112) internal successors, (1940), 1690 states have internal predecessors, (1940), 514 states have call successors, (514), 196 states have call predecessors, (514), 197 states have return successors, (536), 505 states have call predecessors, (536), 512 states have call successors, (536) [2021-12-28 05:19:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 2990 transitions. [2021-12-28 05:19:51,717 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 2990 transitions. Word has length 153 [2021-12-28 05:19:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:51,717 INFO L470 AbstractCegarLoop]: Abstraction has 2358 states and 2990 transitions. [2021-12-28 05:19:51,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:19:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 2990 transitions. [2021-12-28 05:19:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-28 05:19:51,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:51,720 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:51,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:19:51,720 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -531766870, now seen corresponding path program 1 times [2021-12-28 05:19:51,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:51,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854293433] [2021-12-28 05:19:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:51,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:19:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 05:19:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:19:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:19:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 05:19:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:19:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:19:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 05:19:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 05:19:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-28 05:19:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-12-28 05:19:52,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:52,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854293433] [2021-12-28 05:19:52,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854293433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:52,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:52,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:52,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005668753] [2021-12-28 05:19:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:52,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:52,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:52,002 INFO L87 Difference]: Start difference. First operand 2358 states and 2990 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-28 05:19:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:53,102 INFO L93 Difference]: Finished difference Result 4843 states and 6176 transitions. [2021-12-28 05:19:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:19:53,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 153 [2021-12-28 05:19:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:53,113 INFO L225 Difference]: With dead ends: 4843 [2021-12-28 05:19:53,113 INFO L226 Difference]: Without dead ends: 2511 [2021-12-28 05:19:53,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:19:53,124 INFO L933 BasicCegarLoop]: 1264 mSDtfsCounter, 382 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3523 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:53,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 3523 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-28 05:19:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2021-12-28 05:19:53,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2380. [2021-12-28 05:19:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 1644 states have (on average 1.1922141119221412) internal successors, (1960), 1708 states have internal predecessors, (1960), 516 states have call successors, (516), 198 states have call predecessors, (516), 199 states have return successors, (538), 507 states have call predecessors, (538), 514 states have call successors, (538) [2021-12-28 05:19:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3014 transitions. [2021-12-28 05:19:53,221 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3014 transitions. Word has length 153 [2021-12-28 05:19:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:53,222 INFO L470 AbstractCegarLoop]: Abstraction has 2380 states and 3014 transitions. [2021-12-28 05:19:53,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-28 05:19:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3014 transitions. [2021-12-28 05:19:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-28 05:19:53,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:53,224 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:53,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:19:53,224 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash 122768070, now seen corresponding path program 1 times [2021-12-28 05:19:53,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:53,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034906161] [2021-12-28 05:19:53,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:53,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:19:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:19:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:19:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:19:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:19:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:19:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:19:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:19:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:19:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:19:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:19:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:19:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:19:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:19:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:19:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:19:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-28 05:19:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:19:53,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:53,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034906161] [2021-12-28 05:19:53,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034906161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:53,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:53,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:53,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353713095] [2021-12-28 05:19:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:53,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:53,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:53,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:53,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:53,412 INFO L87 Difference]: Start difference. First operand 2380 states and 3014 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, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-28 05:19:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:54,767 INFO L93 Difference]: Finished difference Result 2380 states and 3014 transitions. [2021-12-28 05:19:54,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:54,767 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, (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 124 [2021-12-28 05:19:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:54,774 INFO L225 Difference]: With dead ends: 2380 [2021-12-28 05:19:54,774 INFO L226 Difference]: Without dead ends: 2378 [2021-12-28 05:19:54,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:19:54,775 INFO L933 BasicCegarLoop]: 1231 mSDtfsCounter, 1937 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:54,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2069 Valid, 2491 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:19:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2021-12-28 05:19:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2378. [2021-12-28 05:19:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 1643 states have (on average 1.1911138161898964) internal successors, (1957), 1706 states have internal predecessors, (1957), 516 states have call successors, (516), 198 states have call predecessors, (516), 199 states have return successors, (538), 507 states have call predecessors, (538), 514 states have call successors, (538) [2021-12-28 05:19:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3011 transitions. [2021-12-28 05:19:54,866 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3011 transitions. Word has length 124 [2021-12-28 05:19:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:54,866 INFO L470 AbstractCegarLoop]: Abstraction has 2378 states and 3011 transitions. [2021-12-28 05:19:54,866 INFO L471 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, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-28 05:19:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3011 transitions. [2021-12-28 05:19:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-28 05:19:54,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:54,868 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:54,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:19:54,869 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:54,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1434092064, now seen corresponding path program 1 times [2021-12-28 05:19:54,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:54,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083034069] [2021-12-28 05:19:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:54,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:19:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 05:19:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:19:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:19:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 05:19:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:19:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:19:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 05:19:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 05:19:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-28 05:19:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-12-28 05:19:55,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:55,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083034069] [2021-12-28 05:19:55,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083034069] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:55,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:55,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:19:55,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937874795] [2021-12-28 05:19:55,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:55,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:19:55,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:19:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:19:55,117 INFO L87 Difference]: Start difference. First operand 2378 states and 3011 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:19:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:56,459 INFO L93 Difference]: Finished difference Result 4861 states and 6208 transitions. [2021-12-28 05:19:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:19:56,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2021-12-28 05:19:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:56,468 INFO L225 Difference]: With dead ends: 4861 [2021-12-28 05:19:56,469 INFO L226 Difference]: Without dead ends: 2509 [2021-12-28 05:19:56,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:19:56,476 INFO L933 BasicCegarLoop]: 1278 mSDtfsCounter, 1453 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:56,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1607 Valid, 4155 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:19:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2021-12-28 05:19:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2378. [2021-12-28 05:19:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 1643 states have (on average 1.1898965307364577) internal successors, (1955), 1706 states have internal predecessors, (1955), 516 states have call successors, (516), 198 states have call predecessors, (516), 199 states have return successors, (538), 507 states have call predecessors, (538), 514 states have call successors, (538) [2021-12-28 05:19:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3009 transitions. [2021-12-28 05:19:56,576 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3009 transitions. Word has length 154 [2021-12-28 05:19:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:56,577 INFO L470 AbstractCegarLoop]: Abstraction has 2378 states and 3009 transitions. [2021-12-28 05:19:56,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:19:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3009 transitions. [2021-12-28 05:19:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-28 05:19:56,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:56,579 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:56,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:19:56,579 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1434151646, now seen corresponding path program 1 times [2021-12-28 05:19:56,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433015169] [2021-12-28 05:19:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:56,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:19:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 05:19:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:19:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:19:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 05:19:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:19:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:19:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 05:19:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 05:19:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-28 05:19:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-12-28 05:19:56,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:56,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433015169] [2021-12-28 05:19:56,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433015169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:56,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:56,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:56,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231389408] [2021-12-28 05:19:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:56,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:56,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:56,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:56,836 INFO L87 Difference]: Start difference. First operand 2378 states and 3009 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-28 05:19:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:19:58,633 INFO L93 Difference]: Finished difference Result 5760 states and 7567 transitions. [2021-12-28 05:19:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:19:58,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 154 [2021-12-28 05:19:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:19:58,664 INFO L225 Difference]: With dead ends: 5760 [2021-12-28 05:19:58,664 INFO L226 Difference]: Without dead ends: 3408 [2021-12-28 05:19:58,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:19:58,672 INFO L933 BasicCegarLoop]: 1683 mSDtfsCounter, 698 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 5752 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:19:58,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [884 Valid, 5752 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 05:19:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2021-12-28 05:19:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 2376. [2021-12-28 05:19:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 1642 states have (on average 1.1875761266747868) internal successors, (1950), 1704 states have internal predecessors, (1950), 516 states have call successors, (516), 198 states have call predecessors, (516), 199 states have return successors, (538), 507 states have call predecessors, (538), 514 states have call successors, (538) [2021-12-28 05:19:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 3004 transitions. [2021-12-28 05:19:58,841 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 3004 transitions. Word has length 154 [2021-12-28 05:19:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:19:58,842 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 3004 transitions. [2021-12-28 05:19:58,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-28 05:19:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 3004 transitions. [2021-12-28 05:19:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-28 05:19:58,845 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:19:58,845 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:19:58,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:19:58,845 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:19:58,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:19:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash 947038902, now seen corresponding path program 1 times [2021-12-28 05:19:58,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:19:58,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755389224] [2021-12-28 05:19:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:19:58,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:19:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:19:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:19:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 05:19:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:19:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:19:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 05:19:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:19:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:19:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:19:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:19:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 05:19:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:19:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-28 05:19:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 05:19:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-28 05:19:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:19:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2021-12-28 05:19:59,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:19:59,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755389224] [2021-12-28 05:19:59,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755389224] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:19:59,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:19:59,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:19:59,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71520388] [2021-12-28 05:19:59,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:19:59,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:19:59,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:19:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:19:59,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:19:59,116 INFO L87 Difference]: Start difference. First operand 2376 states and 3004 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, (19), 4 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 05:20:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:00,373 INFO L93 Difference]: Finished difference Result 2565 states and 3267 transitions. [2021-12-28 05:20:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:20:00,373 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, (19), 4 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 163 [2021-12-28 05:20:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:00,383 INFO L225 Difference]: With dead ends: 2565 [2021-12-28 05:20:00,383 INFO L226 Difference]: Without dead ends: 2563 [2021-12-28 05:20:00,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:20:00,387 INFO L933 BasicCegarLoop]: 1284 mSDtfsCounter, 1401 mSDsluCounter, 2342 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:00,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1545 Valid, 3626 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:20:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2021-12-28 05:20:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2428. [2021-12-28 05:20:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 1675 states have (on average 1.1838805970149253) internal successors, (1983), 1736 states have internal predecessors, (1983), 524 states have call successors, (524), 210 states have call predecessors, (524), 211 states have return successors, (546), 515 states have call predecessors, (546), 522 states have call successors, (546) [2021-12-28 05:20:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3053 transitions. [2021-12-28 05:20:00,502 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3053 transitions. Word has length 163 [2021-12-28 05:20:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:00,502 INFO L470 AbstractCegarLoop]: Abstraction has 2428 states and 3053 transitions. [2021-12-28 05:20:00,502 INFO L471 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, (19), 4 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 05:20:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3053 transitions. [2021-12-28 05:20:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-28 05:20:00,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:00,505 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:00,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 05:20:00,506 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:20:00,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1214853457, now seen corresponding path program 1 times [2021-12-28 05:20:00,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:00,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962864880] [2021-12-28 05:20:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:00,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:20:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:20:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:20:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:20:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:20:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:20:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:20:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:20:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:20:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:20:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:20:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:20:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:20:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:20:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:20:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-28 05:20:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 05:20:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:20:00,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:00,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962864880] [2021-12-28 05:20:00,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962864880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:00,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:00,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:20:00,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012809778] [2021-12-28 05:20:00,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:00,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:20:00,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:00,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:20:00,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:20:00,706 INFO L87 Difference]: Start difference. First operand 2428 states and 3053 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, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-28 05:20:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:01,980 INFO L93 Difference]: Finished difference Result 2428 states and 3053 transitions. [2021-12-28 05:20:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:20:01,981 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, (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 130 [2021-12-28 05:20:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:01,989 INFO L225 Difference]: With dead ends: 2428 [2021-12-28 05:20:01,990 INFO L226 Difference]: Without dead ends: 2426 [2021-12-28 05:20:01,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:20:01,992 INFO L933 BasicCegarLoop]: 1224 mSDtfsCounter, 1916 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:01,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2047 Valid, 2484 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:20:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2021-12-28 05:20:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2426. [2021-12-28 05:20:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 1674 states have (on average 1.1827956989247312) internal successors, (1980), 1734 states have internal predecessors, (1980), 524 states have call successors, (524), 210 states have call predecessors, (524), 211 states have return successors, (546), 515 states have call predecessors, (546), 522 states have call successors, (546) [2021-12-28 05:20:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3050 transitions. [2021-12-28 05:20:02,111 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3050 transitions. Word has length 130 [2021-12-28 05:20:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:02,111 INFO L470 AbstractCegarLoop]: Abstraction has 2426 states and 3050 transitions. [2021-12-28 05:20:02,112 INFO L471 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, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-28 05:20:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3050 transitions. [2021-12-28 05:20:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-28 05:20:02,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:02,114 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:02,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 05:20:02,114 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:20:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash 170865828, now seen corresponding path program 1 times [2021-12-28 05:20:02,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:02,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568450963] [2021-12-28 05:20:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:02,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:20:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 05:20:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:20:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 05:20:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:20:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:20:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 05:20:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-28 05:20:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-28 05:20:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-12-28 05:20:02,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:02,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568450963] [2021-12-28 05:20:02,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568450963] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:02,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:02,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:20:02,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065391708] [2021-12-28 05:20:02,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:02,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:20:02,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:02,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:20:02,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:20:02,347 INFO L87 Difference]: Start difference. First operand 2426 states and 3050 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:20:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:02,977 INFO L93 Difference]: Finished difference Result 4955 states and 6281 transitions. [2021-12-28 05:20:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:20:02,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2021-12-28 05:20:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:02,986 INFO L225 Difference]: With dead ends: 4955 [2021-12-28 05:20:02,986 INFO L226 Difference]: Without dead ends: 2555 [2021-12-28 05:20:02,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:20:02,993 INFO L933 BasicCegarLoop]: 1264 mSDtfsCounter, 1416 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:02,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1570 Valid, 1811 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:20:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2021-12-28 05:20:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2420. [2021-12-28 05:20:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 1669 states have (on average 1.1809466746554824) internal successors, (1971), 1728 states have internal predecessors, (1971), 524 states have call successors, (524), 210 states have call predecessors, (524), 211 states have return successors, (546), 515 states have call predecessors, (546), 522 states have call successors, (546) [2021-12-28 05:20:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3041 transitions. [2021-12-28 05:20:03,114 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3041 transitions. Word has length 158 [2021-12-28 05:20:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:03,114 INFO L470 AbstractCegarLoop]: Abstraction has 2420 states and 3041 transitions. [2021-12-28 05:20:03,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:20:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3041 transitions. [2021-12-28 05:20:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-28 05:20:03,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:03,117 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:03,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 05:20:03,117 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_assert_linux_block_request__double_getErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:20:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:03,117 INFO L85 PathProgramCache]: Analyzing trace with hash 540967133, now seen corresponding path program 1 times [2021-12-28 05:20:03,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:03,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282805834] [2021-12-28 05:20:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:03,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:20:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:20:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:20:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:20:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:20:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 05:20:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-28 05:20:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:20:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:20:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 05:20:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-28 05:20:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-28 05:20:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:20:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-28 05:20:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-12-28 05:20:03,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:03,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282805834] [2021-12-28 05:20:03,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282805834] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:03,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:03,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:20:03,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654985816] [2021-12-28 05:20:03,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:03,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:20:03,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:03,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:20:03,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:20:03,347 INFO L87 Difference]: Start difference. First operand 2420 states and 3041 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-28 05:20:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:05,771 INFO L93 Difference]: Finished difference Result 2582 states and 3272 transitions. [2021-12-28 05:20:05,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 05:20:05,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (22), 5 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 162 [2021-12-28 05:20:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:05,781 INFO L225 Difference]: With dead ends: 2582 [2021-12-28 05:20:05,781 INFO L226 Difference]: Without dead ends: 2580 [2021-12-28 05:20:05,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-12-28 05:20:05,782 INFO L933 BasicCegarLoop]: 1262 mSDtfsCounter, 2869 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 1450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3016 SdHoareTripleChecker+Valid, 3563 SdHoareTripleChecker+Invalid, 4421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1450 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:05,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3016 Valid, 3563 Invalid, 4421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1450 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 05:20:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2021-12-28 05:20:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2420. [2021-12-28 05:20:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 1669 states have (on average 1.1797483523067704) internal successors, (1969), 1728 states have internal predecessors, (1969), 524 states have call successors, (524), 210 states have call predecessors, (524), 211 states have return successors, (546), 515 states have call predecessors, (546), 522 states have call successors, (546) [2021-12-28 05:20:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3039 transitions. [2021-12-28 05:20:05,897 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3039 transitions. Word has length 162 [2021-12-28 05:20:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:05,898 INFO L470 AbstractCegarLoop]: Abstraction has 2420 states and 3039 transitions. [2021-12-28 05:20:05,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-28 05:20:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3039 transitions. [2021-12-28 05:20:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-12-28 05:20:05,900 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:05,900 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:05,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 05:20:05,900 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_block_genhd_del_gendiskErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:20:05,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:05,901 INFO L85 PathProgramCache]: Analyzing trace with hash -176985302, now seen corresponding path program 1 times [2021-12-28 05:20:05,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:05,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845491804] [2021-12-28 05:20:05,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:05,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:20:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 05:20:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:20:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 05:20:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:20:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:20:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 05:20:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-28 05:20:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 05:20:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-28 05:20:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 05:20:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2021-12-28 05:20:06,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:06,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845491804] [2021-12-28 05:20:06,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845491804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:06,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:06,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:20:06,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599549114] [2021-12-28 05:20:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:06,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:20:06,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:20:06,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:20:06,229 INFO L87 Difference]: Start difference. First operand 2420 states and 3039 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-28 05:20:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:09,617 INFO L93 Difference]: Finished difference Result 5768 states and 7502 transitions. [2021-12-28 05:20:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:20:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 165 [2021-12-28 05:20:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:09,629 INFO L225 Difference]: With dead ends: 5768 [2021-12-28 05:20:09,629 INFO L226 Difference]: Without dead ends: 3372 [2021-12-28 05:20:09,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2021-12-28 05:20:09,637 INFO L933 BasicCegarLoop]: 1792 mSDtfsCounter, 1419 mSDsluCounter, 12853 mSDsCounter, 0 mSdLazyCounter, 5470 mSolverCounterSat, 840 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 14645 SdHoareTripleChecker+Invalid, 6310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 840 IncrementalHoareTripleChecker+Valid, 5470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:09,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1452 Valid, 14645 Invalid, 6310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [840 Valid, 5470 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-28 05:20:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2021-12-28 05:20:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 2436. [2021-12-28 05:20:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 1681 states have (on average 1.1784651992861392) internal successors, (1981), 1740 states have internal predecessors, (1981), 528 states have call successors, (528), 210 states have call predecessors, (528), 211 states have return successors, (550), 519 states have call predecessors, (550), 526 states have call successors, (550) [2021-12-28 05:20:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3059 transitions. [2021-12-28 05:20:09,833 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3059 transitions. Word has length 165 [2021-12-28 05:20:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:09,833 INFO L470 AbstractCegarLoop]: Abstraction has 2436 states and 3059 transitions. [2021-12-28 05:20:09,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 5 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-28 05:20:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3059 transitions. [2021-12-28 05:20:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-28 05:20:09,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:09,836 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:09,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 05:20:09,836 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:20:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -162594809, now seen corresponding path program 1 times [2021-12-28 05:20:09,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778073197] [2021-12-28 05:20:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:09,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:20:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:20:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:20:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:20:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:20:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:20:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:20:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:20:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:20:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:20:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:20:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:20:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:20:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:20:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:20:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-28 05:20:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 05:20:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-28 05:20:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:20:09,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:09,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778073197] [2021-12-28 05:20:09,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778073197] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:09,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:09,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:20:09,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031423942] [2021-12-28 05:20:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:09,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:20:09,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:09,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:20:09,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:20:09,998 INFO L87 Difference]: Start difference. First operand 2436 states and 3059 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, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-28 05:20:11,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:11,375 INFO L93 Difference]: Finished difference Result 2436 states and 3059 transitions. [2021-12-28 05:20:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:20:11,376 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, (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 136 [2021-12-28 05:20:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:11,381 INFO L225 Difference]: With dead ends: 2436 [2021-12-28 05:20:11,382 INFO L226 Difference]: Without dead ends: 2434 [2021-12-28 05:20:11,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:20:11,383 INFO L933 BasicCegarLoop]: 1217 mSDtfsCounter, 1895 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:11,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2025 Valid, 2477 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:20:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2021-12-28 05:20:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2021-12-28 05:20:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1680 states have (on average 1.1773809523809524) internal successors, (1978), 1738 states have internal predecessors, (1978), 528 states have call successors, (528), 210 states have call predecessors, (528), 211 states have return successors, (550), 519 states have call predecessors, (550), 526 states have call successors, (550) [2021-12-28 05:20:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3056 transitions. [2021-12-28 05:20:11,535 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3056 transitions. Word has length 136 [2021-12-28 05:20:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:11,536 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 3056 transitions. [2021-12-28 05:20:11,536 INFO L471 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, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-28 05:20:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3056 transitions. [2021-12-28 05:20:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-28 05:20:11,538 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:11,538 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:11,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-28 05:20:11,538 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_block_genhd_del_gendiskErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:20:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1746067437, now seen corresponding path program 1 times [2021-12-28 05:20:11,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:11,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906579351] [2021-12-28 05:20:11,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:11,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 05:20:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 05:20:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:20:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 05:20:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:20:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:20:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-12-28 05:20:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:20:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:20:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:20:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 05:20:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-28 05:20:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2021-12-28 05:20:11,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:11,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906579351] [2021-12-28 05:20:11,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906579351] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:20:11,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499248939] [2021-12-28 05:20:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:11,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:20:11,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:20:11,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:20:11,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 05:20:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:12,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-28 05:20:12,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:20:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2021-12-28 05:20:12,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:20:12,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499248939] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:12,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 05:20:12,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2021-12-28 05:20:12,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815935028] [2021-12-28 05:20:12,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:12,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:20:12,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:20:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:20:12,692 INFO L87 Difference]: Start difference. First operand 2434 states and 3056 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-28 05:20:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:13,996 INFO L93 Difference]: Finished difference Result 6150 states and 8054 transitions. [2021-12-28 05:20:13,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 05:20:13,996 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 171 [2021-12-28 05:20:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:14,006 INFO L225 Difference]: With dead ends: 6150 [2021-12-28 05:20:14,007 INFO L226 Difference]: Without dead ends: 3740 [2021-12-28 05:20:14,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2021-12-28 05:20:14,013 INFO L933 BasicCegarLoop]: 1998 mSDtfsCounter, 1482 mSDsluCounter, 19474 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1086 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 21472 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1086 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:14,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 21472 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1086 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 05:20:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2021-12-28 05:20:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 2455. [2021-12-28 05:20:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2455 states, 1690 states have (on average 1.1763313609467456) internal successors, (1988), 1747 states have internal predecessors, (1988), 539 states have call successors, (539), 210 states have call predecessors, (539), 211 states have return successors, (566), 530 states have call predecessors, (566), 537 states have call successors, (566) [2021-12-28 05:20:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 3093 transitions. [2021-12-28 05:20:14,192 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 3093 transitions. Word has length 171 [2021-12-28 05:20:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:14,193 INFO L470 AbstractCegarLoop]: Abstraction has 2455 states and 3093 transitions. [2021-12-28 05:20:14,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 5 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-28 05:20:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3093 transitions. [2021-12-28 05:20:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-28 05:20:14,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:14,195 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:14,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 05:20:14,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-28 05:20:14,416 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_block_queue_blk_cleanup_queueErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2021-12-28 05:20:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash 510271567, now seen corresponding path program 1 times [2021-12-28 05:20:14,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:14,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608655693] [2021-12-28 05:20:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:14,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:20:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-28 05:20:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 05:20:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:20:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 05:20:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:20:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 05:20:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-28 05:20:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 05:20:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 05:20:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-28 05:20:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 05:20:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:20:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 05:20:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:20:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-28 05:20:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 05:20:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-28 05:20:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-28 05:20:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 05:20:14,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:14,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608655693] [2021-12-28 05:20:14,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608655693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:14,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:14,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:20:14,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064471961] [2021-12-28 05:20:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:14,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:20:14,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:20:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:20:14,614 INFO L87 Difference]: Start difference. First operand 2455 states and 3093 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, (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)