./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--usb--host--u132-hcd.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8 --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 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:22:57,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:22:57,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:22:57,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:22:57,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:22:57,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:22:57,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:22:57,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:22:57,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:22:57,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:22:57,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:22:57,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:22:57,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:22:57,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:22:57,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:22:57,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:22:57,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:22:57,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:22:57,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:22:57,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:22:57,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:22:57,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:22:57,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:22:57,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:22:57,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:22:57,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:22:57,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:22:57,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:22:57,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:22:57,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:22:57,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:22:57,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:22:57,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:22:57,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:22:57,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:22:57,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:22:57,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:22:57,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:22:57,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:22:57,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:22:57,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:22:57,510 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:22:57,556 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:22:57,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:22:57,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:22:57,557 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:22:57,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:22:57,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:22:57,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:22:57,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:22:57,560 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:22:57,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:22:57,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:22:57,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:22:57,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:22:57,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:22:57,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:22:57,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:22:57,562 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:22:57,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:22:57,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:22:57,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:22:57,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:22:57,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:22:57,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:22:57,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:22:57,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:22:57,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:22:57,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:22:57,565 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:22:57,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:22:57,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:22:57,566 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8 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 -> 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b [2022-11-16 12:22:57,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:22:57,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:22:57,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:22:57,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:22:57,861 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:22:57,862 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2022-11-16 12:22:57,958 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/data/f04cea34b/a8d5b3de9e5f4bf98728291fc6f2ce1d/FLAG2924c5de2 [2022-11-16 12:22:59,071 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:22:59,071 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2022-11-16 12:22:59,146 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/data/f04cea34b/a8d5b3de9e5f4bf98728291fc6f2ce1d/FLAG2924c5de2 [2022-11-16 12:22:59,443 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/data/f04cea34b/a8d5b3de9e5f4bf98728291fc6f2ce1d [2022-11-16 12:22:59,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:22:59,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:22:59,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:22:59,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:22:59,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:22:59,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:59" (1/1) ... [2022-11-16 12:22:59,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be4f2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:59, skipping insertion in model container [2022-11-16 12:22:59,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:59" (1/1) ... [2022-11-16 12:22:59,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:22:59,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:23:04,758 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2022-11-16 12:23:04,762 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2022-11-16 12:23:04,762 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2022-11-16 12:23:04,763 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2022-11-16 12:23:04,764 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2022-11-16 12:23:04,764 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2022-11-16 12:23:04,766 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2022-11-16 12:23:04,767 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2022-11-16 12:23:04,768 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2022-11-16 12:23:04,769 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2022-11-16 12:23:04,769 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2022-11-16 12:23:04,770 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2022-11-16 12:23:04,771 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2022-11-16 12:23:04,772 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2022-11-16 12:23:04,772 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2022-11-16 12:23:04,773 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2022-11-16 12:23:04,780 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2022-11-16 12:23:04,784 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2022-11-16 12:23:04,785 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2022-11-16 12:23:04,786 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2022-11-16 12:23:04,787 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2022-11-16 12:23:04,788 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2022-11-16 12:23:04,788 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2022-11-16 12:23:04,789 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2022-11-16 12:23:04,789 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2022-11-16 12:23:04,790 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2022-11-16 12:23:04,791 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2022-11-16 12:23:04,791 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2022-11-16 12:23:04,792 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2022-11-16 12:23:04,792 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2022-11-16 12:23:04,793 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2022-11-16 12:23:04,793 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2022-11-16 12:23:04,794 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2022-11-16 12:23:04,794 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2022-11-16 12:23:04,795 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2022-11-16 12:23:04,795 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2022-11-16 12:23:04,796 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2022-11-16 12:23:04,797 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2022-11-16 12:23:04,797 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2022-11-16 12:23:04,798 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2022-11-16 12:23:04,798 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2022-11-16 12:23:04,799 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2022-11-16 12:23:04,799 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2022-11-16 12:23:04,800 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2022-11-16 12:23:04,800 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2022-11-16 12:23:04,801 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2022-11-16 12:23:04,801 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2022-11-16 12:23:04,802 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2022-11-16 12:23:04,802 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2022-11-16 12:23:04,803 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2022-11-16 12:23:04,803 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2022-11-16 12:23:04,804 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2022-11-16 12:23:04,805 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2022-11-16 12:23:04,805 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2022-11-16 12:23:04,806 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2022-11-16 12:23:04,806 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2022-11-16 12:23:04,807 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2022-11-16 12:23:04,807 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2022-11-16 12:23:04,808 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2022-11-16 12:23:04,808 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2022-11-16 12:23:04,809 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2022-11-16 12:23:04,809 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2022-11-16 12:23:04,810 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2022-11-16 12:23:04,810 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2022-11-16 12:23:04,811 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2022-11-16 12:23:04,811 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2022-11-16 12:23:04,812 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2022-11-16 12:23:04,812 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2022-11-16 12:23:04,813 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2022-11-16 12:23:04,813 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2022-11-16 12:23:04,814 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2022-11-16 12:23:04,815 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2022-11-16 12:23:04,815 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2022-11-16 12:23:04,816 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2022-11-16 12:23:04,816 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2022-11-16 12:23:04,817 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2022-11-16 12:23:04,817 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2022-11-16 12:23:04,818 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2022-11-16 12:23:04,818 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2022-11-16 12:23:04,819 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2022-11-16 12:23:04,820 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2022-11-16 12:23:04,820 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2022-11-16 12:23:04,821 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2022-11-16 12:23:04,821 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2022-11-16 12:23:04,822 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2022-11-16 12:23:04,822 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2022-11-16 12:23:04,823 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2022-11-16 12:23:04,823 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2022-11-16 12:23:04,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:23:04,878 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:23:05,501 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2022-11-16 12:23:05,501 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2022-11-16 12:23:05,502 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2022-11-16 12:23:05,502 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2022-11-16 12:23:05,503 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2022-11-16 12:23:05,503 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2022-11-16 12:23:05,504 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2022-11-16 12:23:05,504 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2022-11-16 12:23:05,505 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2022-11-16 12:23:05,505 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2022-11-16 12:23:05,506 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2022-11-16 12:23:05,507 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2022-11-16 12:23:05,507 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2022-11-16 12:23:05,508 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2022-11-16 12:23:05,508 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2022-11-16 12:23:05,508 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2022-11-16 12:23:05,509 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2022-11-16 12:23:05,509 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2022-11-16 12:23:05,510 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2022-11-16 12:23:05,510 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2022-11-16 12:23:05,511 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2022-11-16 12:23:05,511 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2022-11-16 12:23:05,512 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2022-11-16 12:23:05,512 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2022-11-16 12:23:05,513 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2022-11-16 12:23:05,513 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2022-11-16 12:23:05,514 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2022-11-16 12:23:05,514 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2022-11-16 12:23:05,520 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2022-11-16 12:23:05,521 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2022-11-16 12:23:05,521 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2022-11-16 12:23:05,522 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2022-11-16 12:23:05,522 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2022-11-16 12:23:05,522 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2022-11-16 12:23:05,523 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2022-11-16 12:23:05,523 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2022-11-16 12:23:05,523 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2022-11-16 12:23:05,524 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2022-11-16 12:23:05,524 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2022-11-16 12:23:05,524 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2022-11-16 12:23:05,525 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2022-11-16 12:23:05,525 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2022-11-16 12:23:05,526 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2022-11-16 12:23:05,526 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2022-11-16 12:23:05,526 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2022-11-16 12:23:05,527 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2022-11-16 12:23:05,527 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2022-11-16 12:23:05,527 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2022-11-16 12:23:05,527 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2022-11-16 12:23:05,528 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2022-11-16 12:23:05,528 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2022-11-16 12:23:05,528 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2022-11-16 12:23:05,529 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2022-11-16 12:23:05,529 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2022-11-16 12:23:05,530 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2022-11-16 12:23:05,530 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2022-11-16 12:23:05,531 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2022-11-16 12:23:05,531 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2022-11-16 12:23:05,531 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2022-11-16 12:23:05,532 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2022-11-16 12:23:05,532 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2022-11-16 12:23:05,532 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2022-11-16 12:23:05,533 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2022-11-16 12:23:05,533 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2022-11-16 12:23:05,534 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2022-11-16 12:23:05,539 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2022-11-16 12:23:05,544 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2022-11-16 12:23:05,545 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2022-11-16 12:23:05,546 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2022-11-16 12:23:05,547 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2022-11-16 12:23:05,549 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2022-11-16 12:23:05,549 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2022-11-16 12:23:05,550 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2022-11-16 12:23:05,556 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2022-11-16 12:23:05,557 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2022-11-16 12:23:05,557 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2022-11-16 12:23:05,558 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2022-11-16 12:23:05,558 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2022-11-16 12:23:05,560 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2022-11-16 12:23:05,561 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2022-11-16 12:23:05,562 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2022-11-16 12:23:05,562 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2022-11-16 12:23:05,563 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2022-11-16 12:23:05,563 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2022-11-16 12:23:05,563 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2022-11-16 12:23:05,564 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2022-11-16 12:23:05,564 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2022-11-16 12:23:05,565 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2022-11-16 12:23:05,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:23:05,854 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:23:05,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05 WrapperNode [2022-11-16 12:23:05,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:23:05,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:23:05,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:23:05,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:23:05,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:05,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,187 INFO L138 Inliner]: procedures = 749, calls = 3433, calls flagged for inlining = 401, calls inlined = 237, statements flattened = 6855 [2022-11-16 12:23:06,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:23:06,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:23:06,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:23:06,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:23:06,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,521 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:23:06,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:23:06,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:23:06,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:23:06,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (1/1) ... [2022-11-16 12:23:06,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:23:06,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:23:06,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:23:06,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:23:06,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-11-16 12:23:06,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-11-16 12:23:06,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:23:06,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:23:06,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-16 12:23:06,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-16 12:23:06,659 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work [2022-11-16 12:23:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work [2022-11-16 12:23:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure u132_disable [2022-11-16 12:23:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_disable [2022-11-16 12:23:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-16 12:23:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-16 12:23:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure u132_remove [2022-11-16 12:23:06,661 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_remove [2022-11-16 12:23:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_init_kref [2022-11-16 12:23:06,662 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_init_kref [2022-11-16 12:23:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-11-16 12:23:06,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-11-16 12:23:06,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-11-16 12:23:06,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-11-16 12:23:06,664 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-16 12:23:06,664 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-16 12:23:06,664 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_put_kref [2022-11-16 12:23:06,664 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_put_kref [2022-11-16 12:23:06,665 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_read_pcimem [2022-11-16 12:23:06,665 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_read_pcimem [2022-11-16 12:23:06,665 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_requeue_work [2022-11-16 12:23:06,665 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_requeue_work [2022-11-16 12:23:06,665 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_suspend [2022-11-16 12:23:06,665 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_suspend [2022-11-16 12:23:06,666 INFO L130 BoogieDeclarations]: Found specification of procedure u132_get_frame [2022-11-16 12:23:06,666 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_get_frame [2022-11-16 12:23:06,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-16 12:23:06,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-16 12:23:06,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-16 12:23:06,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-16 12:23:06,667 INFO L130 BoogieDeclarations]: Found specification of procedure edset_output [2022-11-16 12:23:06,667 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_output [2022-11-16 12:23:06,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-11-16 12:23:06,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-11-16 12:23:06,667 INFO L130 BoogieDeclarations]: Found specification of procedure read_roothub_info [2022-11-16 12:23:06,667 INFO L138 BoogieDeclarations]: Found implementation of procedure read_roothub_info [2022-11-16 12:23:06,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2022-11-16 12:23:06,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2022-11-16 12:23:06,668 INFO L130 BoogieDeclarations]: Found specification of procedure edset_single [2022-11-16 12:23:06,668 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_single [2022-11-16 12:23:06,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:23:06,668 INFO L130 BoogieDeclarations]: Found specification of procedure edset_setup [2022-11-16 12:23:06,669 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_setup [2022-11-16 12:23:06,669 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-11-16 12:23:06,670 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-11-16 12:23:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-16 12:23:06,670 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-16 12:23:06,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-11-16 12:23:06,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-11-16 12:23:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure u132_resume [2022-11-16 12:23:06,671 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_resume [2022-11-16 12:23:06,671 INFO L130 BoogieDeclarations]: Found specification of procedure ftdi_elan_gone_away [2022-11-16 12:23:06,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ftdi_elan_gone_away [2022-11-16 12:23:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-16 12:23:06,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-16 12:23:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-11-16 12:23:06,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-11-16 12:23:06,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-16 12:23:06,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-16 12:23:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_cancel_work [2022-11-16 12:23:06,673 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_cancel_work [2022-11-16 12:23:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-11-16 12:23:06,673 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-11-16 12:23:06,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-16 12:23:06,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-16 12:23:06,674 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_unlink_urb_from_ep [2022-11-16 12:23:06,674 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_unlink_urb_from_ep [2022-11-16 12:23:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:23:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_ring_work_scheduler [2022-11-16 12:23:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_ring_work_scheduler [2022-11-16 12:23:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-11-16 12:23:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-11-16 12:23:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-11-16 12:23:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-11-16 12:23:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-11-16 12:23:06,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-11-16 12:23:06,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-16 12:23:06,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-16 12:23:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure u132_u132_put_kref [2022-11-16 12:23:06,682 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_u132_put_kref [2022-11-16 12:23:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-11-16 12:23:06,682 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-11-16 12:23:06,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-11-16 12:23:06,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-11-16 12:23:06,683 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_endp_work_scheduler [2022-11-16 12:23:06,683 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_endp_work_scheduler [2022-11-16 12:23:06,683 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-11-16 12:23:06,683 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-11-16 12:23:06,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-16 12:23:06,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-16 12:23:06,684 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_monitor_work [2022-11-16 12:23:06,684 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_monitor_work [2022-11-16 12:23:06,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:23:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure u132_monitor_requeue_work [2022-11-16 12:23:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_monitor_requeue_work [2022-11-16 12:23:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_stop [2022-11-16 12:23:06,685 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_stop [2022-11-16 12:23:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:23:06,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-16 12:23:06,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-16 12:23:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:23:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_giveback_urb [2022-11-16 12:23:06,686 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_giveback_urb [2022-11-16 12:23:06,686 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 12:23:06,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 12:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_write_pcimem [2022-11-16 12:23:06,687 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_write_pcimem [2022-11-16 12:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-16 12:23:06,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-16 12:23:06,687 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_queue_work [2022-11-16 12:23:06,687 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_queue_work [2022-11-16 12:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2022-11-16 12:23:06,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2022-11-16 12:23:06,688 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_queue_work [2022-11-16 12:23:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_queue_work [2022-11-16 12:23:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-11-16 12:23:06,689 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-11-16 12:23:06,689 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-11-16 12:23:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-11-16 12:23:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-16 12:23:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-16 12:23:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_start [2022-11-16 12:23:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_start [2022-11-16 12:23:06,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-11-16 12:23:06,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-11-16 12:23:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_edset_input [2022-11-16 12:23:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_edset_input [2022-11-16 12:23:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure u132_to_hcd [2022-11-16 12:23:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_to_hcd [2022-11-16 12:23:06,691 INFO L130 BoogieDeclarations]: Found specification of procedure u132_probe [2022-11-16 12:23:06,691 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_probe [2022-11-16 12:23:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2022-11-16 12:23:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2022-11-16 12:23:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work [2022-11-16 12:23:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work [2022-11-16 12:23:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:23:06,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:23:06,692 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_init_kref [2022-11-16 12:23:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_init_kref [2022-11-16 12:23:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2022-11-16 12:23:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2022-11-16 12:23:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-11-16 12:23:06,693 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-11-16 12:23:06,693 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-11-16 12:23:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-11-16 12:23:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-16 12:23:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-16 12:23:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_get_kref [2022-11-16 12:23:06,694 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_get_kref [2022-11-16 12:23:06,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-16 12:23:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-16 12:23:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_u132 [2022-11-16 12:23:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_u132 [2022-11-16 12:23:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-11-16 12:23:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-11-16 12:23:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_giveback_urb [2022-11-16 12:23:06,695 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_giveback_urb [2022-11-16 12:23:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_resume [2022-11-16 12:23:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_resume [2022-11-16 12:23:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2022-11-16 12:23:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2022-11-16 12:23:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-11-16 12:23:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-11-16 12:23:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_delete [2022-11-16 12:23:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_delete [2022-11-16 12:23:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:23:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2022-11-16 12:23:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2022-11-16 12:23:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-16 12:23:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-16 12:23:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-16 12:23:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-16 12:23:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_put_kref [2022-11-16 12:23:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_put_kref [2022-11-16 12:23:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:23:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_100 [2022-11-16 12:23:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_100 [2022-11-16 12:23:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:23:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_put_kref [2022-11-16 12:23:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_put_kref [2022-11-16 12:23:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-11-16 12:23:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-11-16 12:23:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_urb_dequeue [2022-11-16 12:23:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_urb_dequeue [2022-11-16 12:23:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-16 12:23:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-16 12:23:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-16 12:23:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-16 12:23:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-11-16 12:23:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-11-16 12:23:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_reset [2022-11-16 12:23:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_reset [2022-11-16 12:23:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-11-16 12:23:06,702 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-11-16 12:23:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-16 12:23:06,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-16 12:23:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-11-16 12:23:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-11-16 12:23:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-11-16 12:23:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-11-16 12:23:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure port_power [2022-11-16 12:23:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure port_power [2022-11-16 12:23:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-16 12:23:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-16 12:23:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-16 12:23:06,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-16 12:23:06,706 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 12:23:06,706 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 12:23:06,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-11-16 12:23:06,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-11-16 12:23:06,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:23:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-16 12:23:06,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-16 12:23:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_link_urb_to_ep [2022-11-16 12:23:06,707 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_link_urb_to_ep [2022-11-16 12:23:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 12:23:06,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 12:23:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-16 12:23:06,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-16 12:23:06,708 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2022-11-16 12:23:06,708 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2022-11-16 12:23:06,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2022-11-16 12:23:06,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2022-11-16 12:23:06,708 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_cancel_work [2022-11-16 12:23:06,708 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_cancel_work [2022-11-16 12:23:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-16 12:23:06,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-16 12:23:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-16 12:23:06,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-16 12:23:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-11-16 12:23:06,709 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-11-16 12:23:06,709 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-11-16 12:23:06,710 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-11-16 12:23:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-11-16 12:23:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2022-11-16 12:23:06,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2022-11-16 12:23:06,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:23:07,842 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:23:07,847 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:23:08,048 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-16 12:23:16,382 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:23:16,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:23:16,411 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:23:16,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:16 BoogieIcfgContainer [2022-11-16 12:23:16,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:23:16,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:23:16,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:23:16,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:23:16,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:22:59" (1/3) ... [2022-11-16 12:23:16,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab4c55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:23:16, skipping insertion in model container [2022-11-16 12:23:16,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:05" (2/3) ... [2022-11-16 12:23:16,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab4c55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:23:16, skipping insertion in model container [2022-11-16 12:23:16,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:16" (3/3) ... [2022-11-16 12:23:16,437 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2022-11-16 12:23:16,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:23:16,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-11-16 12:23:16,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:23:16,619 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3916e13a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:23:16,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-11-16 12:23:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 2149 states, 1440 states have (on average 1.3291666666666666) internal successors, (1914), 1532 states have internal predecessors, (1914), 565 states have call successors, (565), 115 states have call predecessors, (565), 114 states have return successors, (559), 527 states have call predecessors, (559), 559 states have call successors, (559) [2022-11-16 12:23:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 12:23:16,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:16,654 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:23:16,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:23:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash 849854823, now seen corresponding path program 1 times [2022-11-16 12:23:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:16,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031940463] [2022-11-16 12:23:16,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:17,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:17,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:23:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:17,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:23:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:17,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:23:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:23:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:23:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:23:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:18,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:23:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:23:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:23:18,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:18,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031940463] [2022-11-16 12:23:18,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031940463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:23:18,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:23:18,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:23:18,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787088078] [2022-11-16 12:23:18,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:23:18,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:23:18,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:23:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:23:18,098 INFO L87 Difference]: Start difference. First operand has 2149 states, 1440 states have (on average 1.3291666666666666) internal successors, (1914), 1532 states have internal predecessors, (1914), 565 states have call successors, (565), 115 states have call predecessors, (565), 114 states have return successors, (559), 527 states have call predecessors, (559), 559 states have call successors, (559) Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 12:23:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:30,608 INFO L93 Difference]: Finished difference Result 4344 states and 6406 transitions. [2022-11-16 12:23:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:23:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 5 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 61 [2022-11-16 12:23:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:30,648 INFO L225 Difference]: With dead ends: 4344 [2022-11-16 12:23:30,649 INFO L226 Difference]: Without dead ends: 2212 [2022-11-16 12:23:30,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:23:30,669 INFO L413 NwaCegarLoop]: 1336 mSDtfsCounter, 5009 mSDsluCounter, 3277 mSDsCounter, 0 mSdLazyCounter, 5424 mSolverCounterSat, 3145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5295 SdHoareTripleChecker+Valid, 4613 SdHoareTripleChecker+Invalid, 8569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3145 IncrementalHoareTripleChecker+Valid, 5424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:30,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5295 Valid, 4613 Invalid, 8569 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3145 Valid, 5424 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2022-11-16 12:23:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2022-11-16 12:23:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2129. [2022-11-16 12:23:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2129 states, 1429 states have (on average 1.3058082575227432) internal successors, (1866), 1516 states have internal predecessors, (1866), 559 states have call successors, (559), 114 states have call predecessors, (559), 113 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:23:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2982 transitions. [2022-11-16 12:23:31,033 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2982 transitions. Word has length 61 [2022-11-16 12:23:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:31,035 INFO L495 AbstractCegarLoop]: Abstraction has 2129 states and 2982 transitions. [2022-11-16 12:23:31,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 12:23:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2982 transitions. [2022-11-16 12:23:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 12:23:31,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:31,049 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:23:31,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:23:31,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:23:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:31,050 INFO L85 PathProgramCache]: Analyzing trace with hash -376827588, now seen corresponding path program 1 times [2022-11-16 12:23:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:31,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049467718] [2022-11-16 12:23:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:23:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:23:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:23:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:23:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:23:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:23:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:23:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:23:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:23:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:23:31,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:31,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049467718] [2022-11-16 12:23:31,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049467718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:23:31,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:23:31,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:23:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556853019] [2022-11-16 12:23:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:23:31,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:23:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:23:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:23:31,767 INFO L87 Difference]: Start difference. First operand 2129 states and 2982 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:23:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:43,584 INFO L93 Difference]: Finished difference Result 2212 states and 3131 transitions. [2022-11-16 12:23:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:23:43,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 5 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 67 [2022-11-16 12:23:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:43,603 INFO L225 Difference]: With dead ends: 2212 [2022-11-16 12:23:43,603 INFO L226 Difference]: Without dead ends: 2210 [2022-11-16 12:23:43,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:23:43,607 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 4947 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 5417 mSolverCounterSat, 3115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5230 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 8532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3115 IncrementalHoareTripleChecker+Valid, 5417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:43,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5230 Valid, 4569 Invalid, 8532 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3115 Valid, 5417 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2022-11-16 12:23:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2022-11-16 12:23:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2127. [2022-11-16 12:23:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1428 states have (on average 1.3053221288515406) internal successors, (1864), 1514 states have internal predecessors, (1864), 559 states have call successors, (559), 114 states have call predecessors, (559), 113 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:23:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 2980 transitions. [2022-11-16 12:23:43,792 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 2980 transitions. Word has length 67 [2022-11-16 12:23:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:43,793 INFO L495 AbstractCegarLoop]: Abstraction has 2127 states and 2980 transitions. [2022-11-16 12:23:43,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:23:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2980 transitions. [2022-11-16 12:23:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 12:23:43,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:43,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:23:43,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:23:43,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:23:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash -63389453, now seen corresponding path program 1 times [2022-11-16 12:23:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:43,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694621860] [2022-11-16 12:23:43,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:43,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:23:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:23:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:23:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:23:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:23:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:23:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:23:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:23:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:23:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:23:44,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:44,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694621860] [2022-11-16 12:23:44,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694621860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:23:44,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:23:44,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:23:44,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875640186] [2022-11-16 12:23:44,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:23:44,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:23:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:44,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:23:44,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:23:44,651 INFO L87 Difference]: Start difference. First operand 2127 states and 2980 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:23:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:58,234 INFO L93 Difference]: Finished difference Result 2229 states and 3144 transitions. [2022-11-16 12:23:58,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:23:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2022-11-16 12:23:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:58,249 INFO L225 Difference]: With dead ends: 2229 [2022-11-16 12:23:58,249 INFO L226 Difference]: Without dead ends: 2227 [2022-11-16 12:23:58,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:23:58,252 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 4943 mSDsluCounter, 4310 mSDsCounter, 0 mSdLazyCounter, 7457 mSolverCounterSat, 3144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5177 SdHoareTripleChecker+Valid, 5632 SdHoareTripleChecker+Invalid, 10601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3144 IncrementalHoareTripleChecker+Valid, 7457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:58,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5177 Valid, 5632 Invalid, 10601 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3144 Valid, 7457 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2022-11-16 12:23:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2022-11-16 12:23:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2142. [2022-11-16 12:23:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 1439 states have (on average 1.3036831132731064) internal successors, (1876), 1525 states have internal predecessors, (1876), 559 states have call successors, (559), 118 states have call predecessors, (559), 117 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:23:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2992 transitions. [2022-11-16 12:23:58,442 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2992 transitions. Word has length 69 [2022-11-16 12:23:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:58,443 INFO L495 AbstractCegarLoop]: Abstraction has 2142 states and 2992 transitions. [2022-11-16 12:23:58,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 12:23:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2992 transitions. [2022-11-16 12:23:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 12:23:58,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:58,445 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:23:58,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:23:58,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:23:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2131399428, now seen corresponding path program 1 times [2022-11-16 12:23:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:58,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059319253] [2022-11-16 12:23:58,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:23:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:23:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:23:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:23:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:23:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:23:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:23:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:23:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:23:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:23:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:23:58,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:58,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059319253] [2022-11-16 12:23:58,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059319253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:23:58,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:23:58,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:23:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051815640] [2022-11-16 12:23:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:23:58,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:23:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:23:58,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:23:58,908 INFO L87 Difference]: Start difference. First operand 2142 states and 2992 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:24:08,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:24:09,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:24:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:24:10,425 INFO L93 Difference]: Finished difference Result 2225 states and 3141 transitions. [2022-11-16 12:24:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:24:10,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 5 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 73 [2022-11-16 12:24:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:24:10,438 INFO L225 Difference]: With dead ends: 2225 [2022-11-16 12:24:10,439 INFO L226 Difference]: Without dead ends: 2223 [2022-11-16 12:24:10,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:24:10,441 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 4942 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 5409 mSolverCounterSat, 3124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5224 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 8533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3124 IncrementalHoareTripleChecker+Valid, 5409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:24:10,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5224 Valid, 4569 Invalid, 8533 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3124 Valid, 5409 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-11-16 12:24:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2022-11-16 12:24:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2140. [2022-11-16 12:24:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 1438 states have (on average 1.3031988873435327) internal successors, (1874), 1523 states have internal predecessors, (1874), 559 states have call successors, (559), 118 states have call predecessors, (559), 117 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:24:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2990 transitions. [2022-11-16 12:24:10,654 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2990 transitions. Word has length 73 [2022-11-16 12:24:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:24:10,658 INFO L495 AbstractCegarLoop]: Abstraction has 2140 states and 2990 transitions. [2022-11-16 12:24:10,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-16 12:24:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2990 transitions. [2022-11-16 12:24:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-16 12:24:10,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:24:10,660 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:10,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:24:10,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:24:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2113389796, now seen corresponding path program 1 times [2022-11-16 12:24:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:10,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500057264] [2022-11-16 12:24:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:10,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:24:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:24:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:24:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:24:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:24:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:24:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:24:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:24:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:24:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:24:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:24:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:24:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:24:11,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:11,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500057264] [2022-11-16 12:24:11,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500057264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:11,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:11,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:24:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079145583] [2022-11-16 12:24:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:11,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:24:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:24:11,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:24:11,286 INFO L87 Difference]: Start difference. First operand 2140 states and 2990 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-16 12:24:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:24:25,727 INFO L93 Difference]: Finished difference Result 2322 states and 3334 transitions. [2022-11-16 12:24:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:24:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2022-11-16 12:24:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:24:25,742 INFO L225 Difference]: With dead ends: 2322 [2022-11-16 12:24:25,743 INFO L226 Difference]: Without dead ends: 2320 [2022-11-16 12:24:25,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:24:25,745 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 3996 mSDsluCounter, 6166 mSDsCounter, 0 mSdLazyCounter, 9932 mSolverCounterSat, 3604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 7488 SdHoareTripleChecker+Invalid, 13536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3604 IncrementalHoareTripleChecker+Valid, 9932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:24:25,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 7488 Invalid, 13536 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3604 Valid, 9932 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2022-11-16 12:24:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2022-11-16 12:24:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2140. [2022-11-16 12:24:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 1438 states have (on average 1.3025034770514603) internal successors, (1873), 1523 states have internal predecessors, (1873), 559 states have call successors, (559), 118 states have call predecessors, (559), 117 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:24:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2989 transitions. [2022-11-16 12:24:25,936 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2989 transitions. Word has length 80 [2022-11-16 12:24:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:24:25,937 INFO L495 AbstractCegarLoop]: Abstraction has 2140 states and 2989 transitions. [2022-11-16 12:24:25,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-16 12:24:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2989 transitions. [2022-11-16 12:24:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-16 12:24:25,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:24:25,939 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:24:25,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:24:25,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:24:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1651058353, now seen corresponding path program 1 times [2022-11-16 12:24:25,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:25,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360642151] [2022-11-16 12:24:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:25,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:24:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:24:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:24:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:24:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:24:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:24:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:24:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:24:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:24:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:24:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:24:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:24:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:24:26,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:26,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360642151] [2022-11-16 12:24:26,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360642151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:26,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:26,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:24:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56295942] [2022-11-16 12:24:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:26,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:24:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:24:26,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:24:26,437 INFO L87 Difference]: Start difference. First operand 2140 states and 2989 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:24:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:24:36,818 INFO L93 Difference]: Finished difference Result 2223 states and 3138 transitions. [2022-11-16 12:24:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:24:36,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 5 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 79 [2022-11-16 12:24:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:24:36,832 INFO L225 Difference]: With dead ends: 2223 [2022-11-16 12:24:36,832 INFO L226 Difference]: Without dead ends: 2221 [2022-11-16 12:24:36,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:24:36,834 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 4934 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 5406 mSolverCounterSat, 3120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 8526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3120 IncrementalHoareTripleChecker+Valid, 5406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:24:36,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 4569 Invalid, 8526 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3120 Valid, 5406 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-11-16 12:24:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2022-11-16 12:24:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2138. [2022-11-16 12:24:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1437 states have (on average 1.302018093249826) internal successors, (1871), 1521 states have internal predecessors, (1871), 559 states have call successors, (559), 118 states have call predecessors, (559), 117 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:24:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2987 transitions. [2022-11-16 12:24:37,017 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2987 transitions. Word has length 79 [2022-11-16 12:24:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:24:37,018 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 2987 transitions. [2022-11-16 12:24:37,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:24:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2987 transitions. [2022-11-16 12:24:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-16 12:24:37,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:24:37,020 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:24:37,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:24:37,021 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:24:37,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1185079187, now seen corresponding path program 1 times [2022-11-16 12:24:37,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:37,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018485160] [2022-11-16 12:24:37,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:37,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:24:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:24:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:24:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:24:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:24:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:24:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:24:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:24:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:24:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:24:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:24:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:24:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:24:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:24:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:37,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018485160] [2022-11-16 12:24:37,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018485160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:37,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:37,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:24:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496089023] [2022-11-16 12:24:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:37,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:24:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:24:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:24:37,494 INFO L87 Difference]: Start difference. First operand 2138 states and 2987 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-16 12:24:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:24:48,222 INFO L93 Difference]: Finished difference Result 2221 states and 3136 transitions. [2022-11-16 12:24:48,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:24:48,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 5 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 85 [2022-11-16 12:24:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:24:48,232 INFO L225 Difference]: With dead ends: 2221 [2022-11-16 12:24:48,233 INFO L226 Difference]: Without dead ends: 2219 [2022-11-16 12:24:48,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:24:48,235 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 4917 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 5415 mSolverCounterSat, 3104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5197 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 8519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3104 IncrementalHoareTripleChecker+Valid, 5415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:24:48,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5197 Valid, 4569 Invalid, 8519 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3104 Valid, 5415 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2022-11-16 12:24:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2022-11-16 12:24:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2136. [2022-11-16 12:24:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 1436 states have (on average 1.301532033426184) internal successors, (1869), 1519 states have internal predecessors, (1869), 559 states have call successors, (559), 118 states have call predecessors, (559), 117 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:24:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2985 transitions. [2022-11-16 12:24:48,441 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2985 transitions. Word has length 85 [2022-11-16 12:24:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:24:48,441 INFO L495 AbstractCegarLoop]: Abstraction has 2136 states and 2985 transitions. [2022-11-16 12:24:48,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-16 12:24:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2985 transitions. [2022-11-16 12:24:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-16 12:24:48,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:24:48,444 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:24:48,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:24:48,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:24:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1892041848, now seen corresponding path program 1 times [2022-11-16 12:24:48,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:48,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789907113] [2022-11-16 12:24:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:24:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:24:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:24:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:24:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:24:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:24:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:24:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:24:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:24:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:24:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:24:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:24:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:24:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:24:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:24:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:48,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789907113] [2022-11-16 12:24:48,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789907113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:24:48,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:24:48,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:24:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108080861] [2022-11-16 12:24:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:24:48,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:24:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:48,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:24:48,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:24:48,964 INFO L87 Difference]: Start difference. First operand 2136 states and 2985 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:25:00,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:25:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:01,048 INFO L93 Difference]: Finished difference Result 2219 states and 3134 transitions. [2022-11-16 12:25:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:25:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 5 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 91 [2022-11-16 12:25:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:01,062 INFO L225 Difference]: With dead ends: 2219 [2022-11-16 12:25:01,062 INFO L226 Difference]: Without dead ends: 2217 [2022-11-16 12:25:01,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:25:01,064 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 4930 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 5387 mSolverCounterSat, 3124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5209 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 8511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3124 IncrementalHoareTripleChecker+Valid, 5387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:01,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5209 Valid, 4569 Invalid, 8511 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3124 Valid, 5387 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2022-11-16 12:25:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2022-11-16 12:25:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2134. [2022-11-16 12:25:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 1435 states have (on average 1.3010452961672474) internal successors, (1867), 1517 states have internal predecessors, (1867), 559 states have call successors, (559), 118 states have call predecessors, (559), 117 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:25:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2983 transitions. [2022-11-16 12:25:01,309 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 2983 transitions. Word has length 91 [2022-11-16 12:25:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:01,309 INFO L495 AbstractCegarLoop]: Abstraction has 2134 states and 2983 transitions. [2022-11-16 12:25:01,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:25:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2983 transitions. [2022-11-16 12:25:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-16 12:25:01,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:01,312 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:25:01,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:25:01,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:25:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1176852775, now seen corresponding path program 1 times [2022-11-16 12:25:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:01,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484602383] [2022-11-16 12:25:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:25:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:25:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:25:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:25:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:25:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:25:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:25:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:25:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:25:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:25:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:25:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:25:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:25:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:25:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:25:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:01,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484602383] [2022-11-16 12:25:01,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484602383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:01,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:01,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:25:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434860729] [2022-11-16 12:25:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:01,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:25:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:25:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:25:01,914 INFO L87 Difference]: Start difference. First operand 2134 states and 2983 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:25:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:13,489 INFO L93 Difference]: Finished difference Result 2217 states and 3132 transitions. [2022-11-16 12:25:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:25:13,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 5 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 97 [2022-11-16 12:25:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:13,507 INFO L225 Difference]: With dead ends: 2217 [2022-11-16 12:25:13,507 INFO L226 Difference]: Without dead ends: 2215 [2022-11-16 12:25:13,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:25:13,512 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 4922 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 5386 mSolverCounterSat, 3120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5200 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 8506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3120 IncrementalHoareTripleChecker+Valid, 5386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:13,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5200 Valid, 4569 Invalid, 8506 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3120 Valid, 5386 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-11-16 12:25:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2022-11-16 12:25:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2132. [2022-11-16 12:25:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 1434 states have (on average 1.300557880055788) internal successors, (1865), 1515 states have internal predecessors, (1865), 559 states have call successors, (559), 118 states have call predecessors, (559), 117 states have return successors, (557), 525 states have call predecessors, (557), 557 states have call successors, (557) [2022-11-16 12:25:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2981 transitions. [2022-11-16 12:25:13,786 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2981 transitions. Word has length 97 [2022-11-16 12:25:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:13,787 INFO L495 AbstractCegarLoop]: Abstraction has 2132 states and 2981 transitions. [2022-11-16 12:25:13,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:25:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2981 transitions. [2022-11-16 12:25:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-16 12:25:13,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:13,794 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:13,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:25:13,794 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:25:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1688820612, now seen corresponding path program 1 times [2022-11-16 12:25:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:13,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473325161] [2022-11-16 12:25:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:25:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:25:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:25:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:25:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:25:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:25:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:25:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:25:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:25:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:25:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:25:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:25:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:25:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:25:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:25:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-16 12:25:14,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473325161] [2022-11-16 12:25:14,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473325161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:14,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:14,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:25:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394831967] [2022-11-16 12:25:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:14,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:25:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:14,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:25:14,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:25:14,358 INFO L87 Difference]: Start difference. First operand 2132 states and 2981 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:25:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:29,082 INFO L93 Difference]: Finished difference Result 4573 states and 6439 transitions. [2022-11-16 12:25:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:25:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2022-11-16 12:25:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:29,095 INFO L225 Difference]: With dead ends: 4573 [2022-11-16 12:25:29,096 INFO L226 Difference]: Without dead ends: 2466 [2022-11-16 12:25:29,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:25:29,106 INFO L413 NwaCegarLoop]: 1347 mSDtfsCounter, 6364 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 7677 mSolverCounterSat, 4173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6656 SdHoareTripleChecker+Valid, 5068 SdHoareTripleChecker+Invalid, 11850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4173 IncrementalHoareTripleChecker+Valid, 7677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:29,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6656 Valid, 5068 Invalid, 11850 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4173 Valid, 7677 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2022-11-16 12:25:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2022-11-16 12:25:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2241. [2022-11-16 12:25:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1520 states have (on average 1.2914473684210526) internal successors, (1963), 1601 states have internal predecessors, (1963), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:25:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3081 transitions. [2022-11-16 12:25:29,399 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3081 transitions. Word has length 108 [2022-11-16 12:25:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:29,400 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 3081 transitions. [2022-11-16 12:25:29,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:25:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3081 transitions. [2022-11-16 12:25:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-16 12:25:29,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:29,403 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:25:29,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:25:29,403 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:25:29,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash -916519770, now seen corresponding path program 1 times [2022-11-16 12:25:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:29,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057312877] [2022-11-16 12:25:29,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:25:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:25:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:25:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:25:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:25:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:25:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:25:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:25:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:25:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:25:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:25:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:25:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:25:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:25:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:25:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:25:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:29,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057312877] [2022-11-16 12:25:29,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057312877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:29,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:29,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:25:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004093106] [2022-11-16 12:25:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:29,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:25:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:25:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:25:29,914 INFO L87 Difference]: Start difference. First operand 2241 states and 3081 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:25:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:40,966 INFO L93 Difference]: Finished difference Result 2324 states and 3230 transitions. [2022-11-16 12:25:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:25:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 5 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 103 [2022-11-16 12:25:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:40,980 INFO L225 Difference]: With dead ends: 2324 [2022-11-16 12:25:40,981 INFO L226 Difference]: Without dead ends: 2322 [2022-11-16 12:25:40,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:25:40,983 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 4921 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 5388 mSolverCounterSat, 3129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5193 SdHoareTripleChecker+Valid, 4574 SdHoareTripleChecker+Invalid, 8517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3129 IncrementalHoareTripleChecker+Valid, 5388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:40,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5193 Valid, 4574 Invalid, 8517 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3129 Valid, 5388 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-16 12:25:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2022-11-16 12:25:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2239. [2022-11-16 12:25:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 1519 states have (on average 1.2903225806451613) internal successors, (1960), 1599 states have internal predecessors, (1960), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:25:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3078 transitions. [2022-11-16 12:25:41,215 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3078 transitions. Word has length 103 [2022-11-16 12:25:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:41,216 INFO L495 AbstractCegarLoop]: Abstraction has 2239 states and 3078 transitions. [2022-11-16 12:25:41,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:25:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3078 transitions. [2022-11-16 12:25:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-16 12:25:41,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:41,219 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:41,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:25:41,219 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:25:41,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1660826784, now seen corresponding path program 1 times [2022-11-16 12:25:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:41,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489678626] [2022-11-16 12:25:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:25:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:25:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:25:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:25:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:25:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:25:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:25:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:25:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:25:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:25:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:25:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:25:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:25:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:25:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:25:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:25:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-16 12:25:41,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:41,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489678626] [2022-11-16 12:25:41,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489678626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:41,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:41,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:25:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664887522] [2022-11-16 12:25:41,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:41,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:25:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:25:41,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:25:41,699 INFO L87 Difference]: Start difference. First operand 2239 states and 3078 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:25:55,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:25:57,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:25:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:58,224 INFO L93 Difference]: Finished difference Result 4644 states and 6488 transitions. [2022-11-16 12:25:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:25:58,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 114 [2022-11-16 12:25:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:58,238 INFO L225 Difference]: With dead ends: 4644 [2022-11-16 12:25:58,238 INFO L226 Difference]: Without dead ends: 2430 [2022-11-16 12:25:58,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:25:58,247 INFO L413 NwaCegarLoop]: 1055 mSDtfsCounter, 6228 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 5020 mSolverCounterSat, 4872 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6523 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 9892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4872 IncrementalHoareTripleChecker+Valid, 5020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:58,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6523 Valid, 3960 Invalid, 9892 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4872 Valid, 5020 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2022-11-16 12:25:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2022-11-16 12:25:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2235. [2022-11-16 12:25:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2235 states, 1516 states have (on average 1.2895778364116095) internal successors, (1955), 1595 states have internal predecessors, (1955), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:25:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3073 transitions. [2022-11-16 12:25:58,480 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3073 transitions. Word has length 114 [2022-11-16 12:25:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:58,481 INFO L495 AbstractCegarLoop]: Abstraction has 2235 states and 3073 transitions. [2022-11-16 12:25:58,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:25:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3073 transitions. [2022-11-16 12:25:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-16 12:25:58,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:58,483 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:25:58,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:25:58,484 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:25:58,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash -307066903, now seen corresponding path program 1 times [2022-11-16 12:25:58,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:58,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082843679] [2022-11-16 12:25:58,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:58,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:25:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:25:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:25:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:25:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:25:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:25:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:25:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:25:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:25:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:25:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:25:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:25:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:25:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:25:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:25:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:25:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:25:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:59,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082843679] [2022-11-16 12:25:59,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082843679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:25:59,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:25:59,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:25:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181738895] [2022-11-16 12:25:59,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:25:59,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:25:59,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:25:59,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:25:59,010 INFO L87 Difference]: Start difference. First operand 2235 states and 3073 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:26:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:10,369 INFO L93 Difference]: Finished difference Result 2318 states and 3222 transitions. [2022-11-16 12:26:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:26:10,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 5 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 105 [2022-11-16 12:26:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:10,384 INFO L225 Difference]: With dead ends: 2318 [2022-11-16 12:26:10,385 INFO L226 Difference]: Without dead ends: 2316 [2022-11-16 12:26:10,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:26:10,386 INFO L413 NwaCegarLoop]: 1322 mSDtfsCounter, 4878 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 5409 mSolverCounterSat, 3117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5150 SdHoareTripleChecker+Valid, 4550 SdHoareTripleChecker+Invalid, 8526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3117 IncrementalHoareTripleChecker+Valid, 5409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:10,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5150 Valid, 4550 Invalid, 8526 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3117 Valid, 5409 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-11-16 12:26:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2022-11-16 12:26:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2233. [2022-11-16 12:26:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1515 states have (on average 1.2884488448844884) internal successors, (1952), 1593 states have internal predecessors, (1952), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:26:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3070 transitions. [2022-11-16 12:26:10,756 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3070 transitions. Word has length 105 [2022-11-16 12:26:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:10,757 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3070 transitions. [2022-11-16 12:26:10,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:26:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3070 transitions. [2022-11-16 12:26:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-16 12:26:10,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:10,760 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:26:10,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:26:10,761 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:26:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash 210008591, now seen corresponding path program 1 times [2022-11-16 12:26:10,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:26:10,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525575589] [2022-11-16 12:26:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:26:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:26:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:26:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:26:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:26:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:26:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:26:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:26:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:26:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:26:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:26:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:26:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:26:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:26:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:26:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:26:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:26:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:26:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:26:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:26:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 12:26:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-16 12:26:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:26:11,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525575589] [2022-11-16 12:26:11,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525575589] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:26:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735777931] [2022-11-16 12:26:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:11,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:26:11,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:26:11,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:26:11,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:26:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:12,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:26:12,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-16 12:26:12,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:12,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735777931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:12,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:26:12,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2022-11-16 12:26:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198547068] [2022-11-16 12:26:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:12,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:26:12,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:26:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:26:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:26:12,558 INFO L87 Difference]: Start difference. First operand 2233 states and 3070 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 12:26:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:12,967 INFO L93 Difference]: Finished difference Result 4437 states and 6099 transitions. [2022-11-16 12:26:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:26:12,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 120 [2022-11-16 12:26:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:12,978 INFO L225 Difference]: With dead ends: 4437 [2022-11-16 12:26:12,981 INFO L226 Difference]: Without dead ends: 2229 [2022-11-16 12:26:12,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:26:12,990 INFO L413 NwaCegarLoop]: 2954 mSDtfsCounter, 2925 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2925 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:12,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2925 Valid, 2954 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:26:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2229 states. [2022-11-16 12:26:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2229 to 2229. [2022-11-16 12:26:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 1512 states have (on average 1.2876984126984128) internal successors, (1947), 1589 states have internal predecessors, (1947), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:26:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 3065 transitions. [2022-11-16 12:26:13,339 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 3065 transitions. Word has length 120 [2022-11-16 12:26:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:13,340 INFO L495 AbstractCegarLoop]: Abstraction has 2229 states and 3065 transitions. [2022-11-16 12:26:13,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 12:26:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 3065 transitions. [2022-11-16 12:26:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-16 12:26:13,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:13,343 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:26:13,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:26:13,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6394954-6e0d-43fa-be5c-8272d34a9ca6/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:26:13,556 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:26:13,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:13,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1503826506, now seen corresponding path program 1 times [2022-11-16 12:26:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:26:13,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338615038] [2022-11-16 12:26:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:26:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:26:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:26:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:26:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:26:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:26:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:26:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:26:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:26:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:26:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:26:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:26:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:26:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:26:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:26:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:26:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:26:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:26:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:26:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:26:14,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338615038] [2022-11-16 12:26:14,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338615038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:14,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:14,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:26:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552037138] [2022-11-16 12:26:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:14,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:26:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:26:14,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:26:14,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:26:14,084 INFO L87 Difference]: Start difference. First operand 2229 states and 3065 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 12:26:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:24,521 INFO L93 Difference]: Finished difference Result 2312 states and 3214 transitions. [2022-11-16 12:26:24,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:26:24,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 5 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 111 [2022-11-16 12:26:24,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:24,531 INFO L225 Difference]: With dead ends: 2312 [2022-11-16 12:26:24,531 INFO L226 Difference]: Without dead ends: 2310 [2022-11-16 12:26:24,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:26:24,533 INFO L413 NwaCegarLoop]: 1317 mSDtfsCounter, 4894 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5383 mSolverCounterSat, 3121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5165 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 8504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3121 IncrementalHoareTripleChecker+Valid, 5383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:24,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5165 Valid, 4526 Invalid, 8504 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3121 Valid, 5383 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2022-11-16 12:26:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2022-11-16 12:26:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2227. [2022-11-16 12:26:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 1511 states have (on average 1.2865651886168101) internal successors, (1944), 1587 states have internal predecessors, (1944), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:26:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 3062 transitions. [2022-11-16 12:26:24,921 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 3062 transitions. Word has length 111 [2022-11-16 12:26:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:24,922 INFO L495 AbstractCegarLoop]: Abstraction has 2227 states and 3062 transitions. [2022-11-16 12:26:24,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 12:26:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 3062 transitions. [2022-11-16 12:26:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-16 12:26:24,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:24,925 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:26:24,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:26:24,925 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:26:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1148675118, now seen corresponding path program 1 times [2022-11-16 12:26:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:26:24,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048050347] [2022-11-16 12:26:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:26:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:26:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:26:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:26:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:26:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:26:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:26:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:26:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:26:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:26:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:26:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:26:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:26:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:26:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:26:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:26:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:26:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:26:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:26:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:26:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:26:25,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048050347] [2022-11-16 12:26:25,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048050347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:25,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:25,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:26:25,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089652053] [2022-11-16 12:26:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:25,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:26:25,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:26:25,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:26:25,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:26:25,421 INFO L87 Difference]: Start difference. First operand 2227 states and 3062 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 12:26:36,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:37,103 INFO L93 Difference]: Finished difference Result 2310 states and 3211 transitions. [2022-11-16 12:26:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:26:37,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 5 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 117 [2022-11-16 12:26:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:37,112 INFO L225 Difference]: With dead ends: 2310 [2022-11-16 12:26:37,113 INFO L226 Difference]: Without dead ends: 2308 [2022-11-16 12:26:37,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:26:37,115 INFO L413 NwaCegarLoop]: 1317 mSDtfsCounter, 4868 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5393 mSolverCounterSat, 3121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5138 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 8514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3121 IncrementalHoareTripleChecker+Valid, 5393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:37,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5138 Valid, 4526 Invalid, 8514 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3121 Valid, 5393 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-11-16 12:26:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2022-11-16 12:26:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2225. [2022-11-16 12:26:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 1510 states have (on average 1.2854304635761589) internal successors, (1941), 1585 states have internal predecessors, (1941), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:26:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3059 transitions. [2022-11-16 12:26:37,397 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3059 transitions. Word has length 117 [2022-11-16 12:26:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:37,397 INFO L495 AbstractCegarLoop]: Abstraction has 2225 states and 3059 transitions. [2022-11-16 12:26:37,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 12:26:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3059 transitions. [2022-11-16 12:26:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-16 12:26:37,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:37,401 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:26:37,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:26:37,401 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:26:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:37,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1536776830, now seen corresponding path program 1 times [2022-11-16 12:26:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:26:37,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694295659] [2022-11-16 12:26:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:26:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:26:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:26:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:26:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:26:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:26:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:26:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:26:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:26:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:26:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:26:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:26:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:26:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:26:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:26:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:26:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:26:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:26:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:26:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:26:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:26:37,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:26:37,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694295659] [2022-11-16 12:26:37,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694295659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:37,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:37,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:26:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470894932] [2022-11-16 12:26:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:37,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:26:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:26:37,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:26:37,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:26:37,870 INFO L87 Difference]: Start difference. First operand 2225 states and 3059 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 12:26:49,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:49,460 INFO L93 Difference]: Finished difference Result 2308 states and 3208 transitions. [2022-11-16 12:26:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:26:49,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 5 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 123 [2022-11-16 12:26:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:49,468 INFO L225 Difference]: With dead ends: 2308 [2022-11-16 12:26:49,468 INFO L226 Difference]: Without dead ends: 2306 [2022-11-16 12:26:49,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:26:49,470 INFO L413 NwaCegarLoop]: 1317 mSDtfsCounter, 4872 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5379 mSolverCounterSat, 3121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5141 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 8500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3121 IncrementalHoareTripleChecker+Valid, 5379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:49,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5141 Valid, 4526 Invalid, 8500 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3121 Valid, 5379 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-11-16 12:26:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-11-16 12:26:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2223. [2022-11-16 12:26:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 1509 states have (on average 1.2842942345924453) internal successors, (1938), 1583 states have internal predecessors, (1938), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:26:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3056 transitions. [2022-11-16 12:26:49,785 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3056 transitions. Word has length 123 [2022-11-16 12:26:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:49,785 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 3056 transitions. [2022-11-16 12:26:49,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-16 12:26:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3056 transitions. [2022-11-16 12:26:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-16 12:26:49,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:49,789 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:26:49,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:26:49,790 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:26:49,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:49,790 INFO L85 PathProgramCache]: Analyzing trace with hash 118168116, now seen corresponding path program 1 times [2022-11-16 12:26:49,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:26:49,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875046076] [2022-11-16 12:26:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:26:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:26:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:26:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:26:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:26:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:26:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:26:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:26:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:26:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:26:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:26:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:26:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:26:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:26:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:26:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:26:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:26:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:26:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:26:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:26:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:26:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:26:50,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:26:50,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875046076] [2022-11-16 12:26:50,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875046076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:50,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:50,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:26:50,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183558279] [2022-11-16 12:26:50,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:50,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:26:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:26:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:26:50,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:26:50,283 INFO L87 Difference]: Start difference. First operand 2223 states and 3056 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-16 12:27:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:01,506 INFO L93 Difference]: Finished difference Result 2306 states and 3205 transitions. [2022-11-16 12:27:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:27:01,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 5 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 129 [2022-11-16 12:27:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:01,516 INFO L225 Difference]: With dead ends: 2306 [2022-11-16 12:27:01,516 INFO L226 Difference]: Without dead ends: 2304 [2022-11-16 12:27:01,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:27:01,518 INFO L413 NwaCegarLoop]: 1317 mSDtfsCounter, 4870 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5369 mSolverCounterSat, 3129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5138 SdHoareTripleChecker+Valid, 4526 SdHoareTripleChecker+Invalid, 8498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3129 IncrementalHoareTripleChecker+Valid, 5369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:01,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5138 Valid, 4526 Invalid, 8498 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3129 Valid, 5369 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-11-16 12:27:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2022-11-16 12:27:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2221. [2022-11-16 12:27:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 1508 states have (on average 1.28315649867374) internal successors, (1935), 1581 states have internal predecessors, (1935), 560 states have call successors, (560), 140 states have call predecessors, (560), 139 states have return successors, (558), 526 states have call predecessors, (558), 558 states have call successors, (558) [2022-11-16 12:27:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3053 transitions. [2022-11-16 12:27:01,980 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3053 transitions. Word has length 129 [2022-11-16 12:27:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:01,981 INFO L495 AbstractCegarLoop]: Abstraction has 2221 states and 3053 transitions. [2022-11-16 12:27:01,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-16 12:27:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3053 transitions. [2022-11-16 12:27:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-16 12:27:01,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:01,985 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:01,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:27:01,986 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:27:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:01,987 INFO L85 PathProgramCache]: Analyzing trace with hash 60088064, now seen corresponding path program 1 times [2022-11-16 12:27:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:01,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712206750] [2022-11-16 12:27:01,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:01,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:27:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:27:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:27:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:27:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:27:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:27:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:27:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:27:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:27:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:27:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:27:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:27:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:27:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:27:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:27:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:27:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:27:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-16 12:27:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:27:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:27:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-11-16 12:27:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:03,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712206750] [2022-11-16 12:27:03,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712206750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:03,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:03,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:27:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853027249] [2022-11-16 12:27:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:03,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:27:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:03,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:27:03,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:27:03,013 INFO L87 Difference]: Start difference. First operand 2221 states and 3053 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-16 12:27:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:22,507 INFO L93 Difference]: Finished difference Result 2999 states and 4333 transitions. [2022-11-16 12:27:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:27:22,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2022-11-16 12:27:22,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:22,525 INFO L225 Difference]: With dead ends: 2999 [2022-11-16 12:27:22,526 INFO L226 Difference]: Without dead ends: 2997 [2022-11-16 12:27:22,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:27:22,529 INFO L413 NwaCegarLoop]: 1342 mSDtfsCounter, 6467 mSDsluCounter, 5174 mSDsCounter, 0 mSdLazyCounter, 11164 mSolverCounterSat, 5332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6681 SdHoareTripleChecker+Valid, 6516 SdHoareTripleChecker+Invalid, 16496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5332 IncrementalHoareTripleChecker+Valid, 11164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:22,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6681 Valid, 6516 Invalid, 16496 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5332 Valid, 11164 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2022-11-16 12:27:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2022-11-16 12:27:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2705. [2022-11-16 12:27:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 1802 states have (on average 1.2735849056603774) internal successors, (2295), 1915 states have internal predecessors, (2295), 688 states have call successors, (688), 199 states have call predecessors, (688), 201 states have return successors, (744), 627 states have call predecessors, (744), 686 states have call successors, (744) [2022-11-16 12:27:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3727 transitions. [2022-11-16 12:27:23,111 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3727 transitions. Word has length 178 [2022-11-16 12:27:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:23,112 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 3727 transitions. [2022-11-16 12:27:23,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 7 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-16 12:27:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3727 transitions. [2022-11-16 12:27:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 12:27:23,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:23,116 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:27:23,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:27:23,118 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:27:23,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1131181445, now seen corresponding path program 1 times [2022-11-16 12:27:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:23,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815484700] [2022-11-16 12:27:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:27:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:27:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:27:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:27:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:27:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:27:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:27:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:27:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:27:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:27:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:27:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:27:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:27:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:27:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:27:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:27:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:27:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:27:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:27:23,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:23,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815484700] [2022-11-16 12:27:23,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815484700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:23,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:23,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:27:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130112089] [2022-11-16 12:27:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:23,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:27:23,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:23,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:27:23,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:23,738 INFO L87 Difference]: Start difference. First operand 2705 states and 3727 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 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) [2022-11-16 12:27:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:34,873 INFO L93 Difference]: Finished difference Result 2797 states and 3894 transitions. [2022-11-16 12:27:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:27:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 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 135 [2022-11-16 12:27:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:34,886 INFO L225 Difference]: With dead ends: 2797 [2022-11-16 12:27:34,886 INFO L226 Difference]: Without dead ends: 2795 [2022-11-16 12:27:34,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:27:34,888 INFO L413 NwaCegarLoop]: 1315 mSDtfsCounter, 4865 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5352 mSolverCounterSat, 3128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 8480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3128 IncrementalHoareTripleChecker+Valid, 5352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:34,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 4524 Invalid, 8480 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3128 Valid, 5352 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2022-11-16 12:27:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2022-11-16 12:27:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2703. [2022-11-16 12:27:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 1801 states have (on average 1.2726263187118267) internal successors, (2292), 1913 states have internal predecessors, (2292), 688 states have call successors, (688), 199 states have call predecessors, (688), 201 states have return successors, (744), 627 states have call predecessors, (744), 686 states have call successors, (744) [2022-11-16 12:27:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3724 transitions. [2022-11-16 12:27:35,492 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3724 transitions. Word has length 135 [2022-11-16 12:27:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:35,493 INFO L495 AbstractCegarLoop]: Abstraction has 2703 states and 3724 transitions. [2022-11-16 12:27:35,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 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) [2022-11-16 12:27:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3724 transitions. [2022-11-16 12:27:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-16 12:27:35,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:35,497 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:27:35,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:27:35,497 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:27:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1404667751, now seen corresponding path program 1 times [2022-11-16 12:27:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:35,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845838288] [2022-11-16 12:27:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:27:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:27:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:27:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:27:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:27:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:27:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:27:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:27:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:27:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:27:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:27:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:27:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:27:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:27:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:27:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:27:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:27:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:27:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:27:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:27:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:36,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845838288] [2022-11-16 12:27:36,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845838288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:36,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:36,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:27:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878343556] [2022-11-16 12:27:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:36,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:27:36,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:36,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:27:36,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:36,130 INFO L87 Difference]: Start difference. First operand 2703 states and 3724 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 12:27:48,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:49,024 INFO L93 Difference]: Finished difference Result 2795 states and 3891 transitions. [2022-11-16 12:27:49,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:27:49,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2022-11-16 12:27:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:49,036 INFO L225 Difference]: With dead ends: 2795 [2022-11-16 12:27:49,037 INFO L226 Difference]: Without dead ends: 2793 [2022-11-16 12:27:49,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:27:49,039 INFO L413 NwaCegarLoop]: 1315 mSDtfsCounter, 4851 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5352 mSolverCounterSat, 3132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5119 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 8484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3132 IncrementalHoareTripleChecker+Valid, 5352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:49,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5119 Valid, 4524 Invalid, 8484 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3132 Valid, 5352 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-11-16 12:27:49,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2022-11-16 12:27:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2701. [2022-11-16 12:27:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 1800 states have (on average 1.2716666666666667) internal successors, (2289), 1911 states have internal predecessors, (2289), 688 states have call successors, (688), 199 states have call predecessors, (688), 201 states have return successors, (744), 627 states have call predecessors, (744), 686 states have call successors, (744) [2022-11-16 12:27:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3721 transitions. [2022-11-16 12:27:49,678 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3721 transitions. Word has length 141 [2022-11-16 12:27:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:49,679 INFO L495 AbstractCegarLoop]: Abstraction has 2701 states and 3721 transitions. [2022-11-16 12:27:49,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 12:27:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3721 transitions. [2022-11-16 12:27:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:27:49,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:49,683 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-16 12:27:49,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:27:49,684 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:27:49,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1524910104, now seen corresponding path program 1 times [2022-11-16 12:27:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:49,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137503065] [2022-11-16 12:27:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:27:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:27:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:27:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:27:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:27:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:27:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:27:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:27:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:27:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:27:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:27:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:27:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:27:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:27:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:27:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:27:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:27:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:27:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:27:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:27:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:27:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:27:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:27:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:27:50,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137503065] [2022-11-16 12:27:50,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137503065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:50,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:50,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:27:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610324860] [2022-11-16 12:27:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:50,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:27:50,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:27:50,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:50,673 INFO L87 Difference]: Start difference. First operand 2701 states and 3721 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-16 12:28:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:02,048 INFO L93 Difference]: Finished difference Result 2793 states and 3888 transitions. [2022-11-16 12:28:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:28:02,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2022-11-16 12:28:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:02,061 INFO L225 Difference]: With dead ends: 2793 [2022-11-16 12:28:02,062 INFO L226 Difference]: Without dead ends: 2791 [2022-11-16 12:28:02,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:28:02,064 INFO L413 NwaCegarLoop]: 1315 mSDtfsCounter, 4849 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5343 mSolverCounterSat, 3132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 8475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3132 IncrementalHoareTripleChecker+Valid, 5343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:02,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 4524 Invalid, 8475 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3132 Valid, 5343 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-16 12:28:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-11-16 12:28:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2699. [2022-11-16 12:28:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 1799 states have (on average 1.2707059477487492) internal successors, (2286), 1909 states have internal predecessors, (2286), 688 states have call successors, (688), 199 states have call predecessors, (688), 201 states have return successors, (744), 627 states have call predecessors, (744), 686 states have call successors, (744) [2022-11-16 12:28:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3718 transitions. [2022-11-16 12:28:02,616 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3718 transitions. Word has length 147 [2022-11-16 12:28:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:02,617 INFO L495 AbstractCegarLoop]: Abstraction has 2699 states and 3718 transitions. [2022-11-16 12:28:02,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-16 12:28:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3718 transitions. [2022-11-16 12:28:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-16 12:28:02,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:02,622 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:02,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 12:28:02,622 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:28:02,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash -645028174, now seen corresponding path program 1 times [2022-11-16 12:28:02,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:28:02,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644599467] [2022-11-16 12:28:02,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:02,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:28:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:28:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:02,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:28:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:28:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:28:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:28:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:28:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:28:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:28:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:28:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:28:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:28:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:28:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:28:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:28:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:28:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:28:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:28:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:28:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:28:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:28:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:28:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:28:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:28:03,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:28:03,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644599467] [2022-11-16 12:28:03,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644599467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:03,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:03,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:28:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662550955] [2022-11-16 12:28:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:03,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:28:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:28:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:28:03,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:28:03,207 INFO L87 Difference]: Start difference. First operand 2699 states and 3718 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-16 12:28:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:15,009 INFO L93 Difference]: Finished difference Result 2791 states and 3885 transitions. [2022-11-16 12:28:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:28:15,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2022-11-16 12:28:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:15,021 INFO L225 Difference]: With dead ends: 2791 [2022-11-16 12:28:15,021 INFO L226 Difference]: Without dead ends: 2789 [2022-11-16 12:28:15,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:28:15,023 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 4832 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5345 mSolverCounterSat, 3124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 4523 SdHoareTripleChecker+Invalid, 8469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3124 IncrementalHoareTripleChecker+Valid, 5345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:15,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 4523 Invalid, 8469 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3124 Valid, 5345 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-11-16 12:28:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2022-11-16 12:28:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2697. [2022-11-16 12:28:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 1798 states have (on average 1.2697441601779755) internal successors, (2283), 1907 states have internal predecessors, (2283), 688 states have call successors, (688), 199 states have call predecessors, (688), 201 states have return successors, (744), 627 states have call predecessors, (744), 686 states have call successors, (744) [2022-11-16 12:28:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3715 transitions. [2022-11-16 12:28:15,507 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3715 transitions. Word has length 153 [2022-11-16 12:28:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:15,508 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 3715 transitions. [2022-11-16 12:28:15,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-16 12:28:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3715 transitions. [2022-11-16 12:28:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-16 12:28:15,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:15,512 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:15,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 12:28:15,512 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:28:15,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash 305224212, now seen corresponding path program 1 times [2022-11-16 12:28:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:28:15,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666951867] [2022-11-16 12:28:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:28:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:28:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:28:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:28:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:28:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:28:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:28:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:28:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:28:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:28:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:28:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:28:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:28:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:28:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:28:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:28:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:28:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:28:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:28:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:28:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:28:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:28:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:16,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:28:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:16,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 12:28:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:28:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:28:16,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666951867] [2022-11-16 12:28:16,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666951867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:16,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:16,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:28:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832258002] [2022-11-16 12:28:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:28:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:28:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:28:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:28:16,033 INFO L87 Difference]: Start difference. First operand 2697 states and 3715 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-16 12:28:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:27,936 INFO L93 Difference]: Finished difference Result 2789 states and 3882 transitions. [2022-11-16 12:28:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:28:27,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 159 [2022-11-16 12:28:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:27,946 INFO L225 Difference]: With dead ends: 2789 [2022-11-16 12:28:27,946 INFO L226 Difference]: Without dead ends: 2787 [2022-11-16 12:28:27,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:28:27,948 INFO L413 NwaCegarLoop]: 1315 mSDtfsCounter, 4800 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5367 mSolverCounterSat, 3112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5065 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 8479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3112 IncrementalHoareTripleChecker+Valid, 5367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:27,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5065 Valid, 4524 Invalid, 8479 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3112 Valid, 5367 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-11-16 12:28:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2022-11-16 12:28:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2695. [2022-11-16 12:28:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 1797 states have (on average 1.2687813021702838) internal successors, (2280), 1905 states have internal predecessors, (2280), 688 states have call successors, (688), 199 states have call predecessors, (688), 201 states have return successors, (744), 627 states have call predecessors, (744), 686 states have call successors, (744) [2022-11-16 12:28:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3712 transitions. [2022-11-16 12:28:28,480 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3712 transitions. Word has length 159 [2022-11-16 12:28:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:28,481 INFO L495 AbstractCegarLoop]: Abstraction has 2695 states and 3712 transitions. [2022-11-16 12:28:28,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-16 12:28:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3712 transitions. [2022-11-16 12:28:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-16 12:28:28,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:28,486 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:28,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 12:28:28,487 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:28:28,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1809456609, now seen corresponding path program 1 times [2022-11-16 12:28:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:28:28,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298671434] [2022-11-16 12:28:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:28:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:28:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:28:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:28:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:28:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:28:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:28:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:28:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:28:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:28:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:28:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:28:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:28:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:28:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:28:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:28:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:28:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:28:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:28:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:28:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:28:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:28:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:28:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:29,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 12:28:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:29,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-16 12:28:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:28:29,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:28:29,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298671434] [2022-11-16 12:28:29,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298671434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:29,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:29,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:28:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757689940] [2022-11-16 12:28:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:29,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:28:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:28:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:28:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:28:29,035 INFO L87 Difference]: Start difference. First operand 2695 states and 3712 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-16 12:28:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:41,032 INFO L93 Difference]: Finished difference Result 2787 states and 3879 transitions. [2022-11-16 12:28:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:28:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2022-11-16 12:28:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:41,045 INFO L225 Difference]: With dead ends: 2787 [2022-11-16 12:28:41,046 INFO L226 Difference]: Without dead ends: 2785 [2022-11-16 12:28:41,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:28:41,048 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 4819 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5334 mSolverCounterSat, 3124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5084 SdHoareTripleChecker+Valid, 4523 SdHoareTripleChecker+Invalid, 8458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3124 IncrementalHoareTripleChecker+Valid, 5334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:41,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5084 Valid, 4523 Invalid, 8458 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3124 Valid, 5334 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-11-16 12:28:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2022-11-16 12:28:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2693. [2022-11-16 12:28:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 1796 states have (on average 1.267817371937639) internal successors, (2277), 1903 states have internal predecessors, (2277), 688 states have call successors, (688), 199 states have call predecessors, (688), 201 states have return successors, (744), 627 states have call predecessors, (744), 686 states have call successors, (744) [2022-11-16 12:28:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3709 transitions. [2022-11-16 12:28:41,791 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3709 transitions. Word has length 165 [2022-11-16 12:28:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:41,791 INFO L495 AbstractCegarLoop]: Abstraction has 2693 states and 3709 transitions. [2022-11-16 12:28:41,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-16 12:28:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3709 transitions. [2022-11-16 12:28:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-16 12:28:41,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:41,797 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:41,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 12:28:41,798 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:28:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1386251392, now seen corresponding path program 1 times [2022-11-16 12:28:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:28:41,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225102175] [2022-11-16 12:28:41,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:41,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:28:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:28:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:28:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:28:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:28:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:28:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:28:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:28:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:28:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:28:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:28:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:28:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:28:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:28:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:28:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:28:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:28:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:28:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:28:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:28:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:28:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-16 12:28:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:28:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-16 12:28:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 12:28:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:28:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-16 12:28:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-16 12:28:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:28:42,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225102175] [2022-11-16 12:28:42,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225102175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:42,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:42,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:28:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401036723] [2022-11-16 12:28:42,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:28:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:28:42,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:28:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:28:42,772 INFO L87 Difference]: Start difference. First operand 2693 states and 3709 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (28), 8 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-16 12:28:57,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:59,945 INFO L93 Difference]: Finished difference Result 3113 states and 4443 transitions. [2022-11-16 12:28:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:28:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (28), 8 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 213 [2022-11-16 12:28:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:59,960 INFO L225 Difference]: With dead ends: 3113 [2022-11-16 12:28:59,960 INFO L226 Difference]: Without dead ends: 3111 [2022-11-16 12:28:59,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:28:59,962 INFO L413 NwaCegarLoop]: 1336 mSDtfsCounter, 5740 mSDsluCounter, 5197 mSDsCounter, 0 mSdLazyCounter, 9310 mSolverCounterSat, 4315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5882 SdHoareTripleChecker+Valid, 6533 SdHoareTripleChecker+Invalid, 13625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4315 IncrementalHoareTripleChecker+Valid, 9310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:59,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5882 Valid, 6533 Invalid, 13625 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4315 Valid, 9310 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2022-11-16 12:28:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-11-16 12:29:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 2816. [2022-11-16 12:29:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 1878 states have (on average 1.2598509052183173) internal successors, (2366), 1987 states have internal predecessors, (2366), 703 states have call successors, (703), 224 states have call predecessors, (703), 228 states have return successors, (763), 643 states have call predecessors, (763), 701 states have call successors, (763) [2022-11-16 12:29:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 3832 transitions. [2022-11-16 12:29:00,630 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 3832 transitions. Word has length 213 [2022-11-16 12:29:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:00,630 INFO L495 AbstractCegarLoop]: Abstraction has 2816 states and 3832 transitions. [2022-11-16 12:29:00,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (28), 8 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-16 12:29:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 3832 transitions. [2022-11-16 12:29:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-16 12:29:00,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:00,635 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:00,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 12:29:00,636 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:29:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash 832458528, now seen corresponding path program 1 times [2022-11-16 12:29:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:00,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629368486] [2022-11-16 12:29:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:00,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:29:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:29:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:29:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:29:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:29:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:29:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:29:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:29:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:29:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:29:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:29:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:29:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:29:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:29:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:29:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:29:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:29:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:29:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:29:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:29:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:29:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:29:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 12:29:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-16 12:29:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-16 12:29:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:29:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:01,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629368486] [2022-11-16 12:29:01,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629368486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:01,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:01,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:29:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872473521] [2022-11-16 12:29:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:01,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:29:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:01,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:29:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:01,377 INFO L87 Difference]: Start difference. First operand 2816 states and 3832 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 12:29:13,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:14,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:14,917 INFO L93 Difference]: Finished difference Result 2910 states and 4000 transitions. [2022-11-16 12:29:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:29:14,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2022-11-16 12:29:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:14,926 INFO L225 Difference]: With dead ends: 2910 [2022-11-16 12:29:14,926 INFO L226 Difference]: Without dead ends: 2908 [2022-11-16 12:29:14,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:29:14,927 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 4818 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5308 mSolverCounterSat, 3140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 4523 SdHoareTripleChecker+Invalid, 8448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3140 IncrementalHoareTripleChecker+Valid, 5308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:14,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 4523 Invalid, 8448 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3140 Valid, 5308 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2022-11-16 12:29:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-11-16 12:29:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2814. [2022-11-16 12:29:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 1877 states have (on average 1.2589238145977624) internal successors, (2363), 1985 states have internal predecessors, (2363), 703 states have call successors, (703), 224 states have call predecessors, (703), 228 states have return successors, (763), 643 states have call predecessors, (763), 701 states have call successors, (763) [2022-11-16 12:29:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3829 transitions. [2022-11-16 12:29:15,637 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3829 transitions. Word has length 171 [2022-11-16 12:29:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:15,637 INFO L495 AbstractCegarLoop]: Abstraction has 2814 states and 3829 transitions. [2022-11-16 12:29:15,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 12:29:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3829 transitions. [2022-11-16 12:29:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-11-16 12:29:15,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:15,651 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:15,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 12:29:15,652 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:29:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash 439882328, now seen corresponding path program 1 times [2022-11-16 12:29:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:15,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817806175] [2022-11-16 12:29:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:29:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:29:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:29:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:29:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:29:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:29:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:29:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:29:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:29:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:29:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:29:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:29:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:29:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:29:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:29:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:29:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:29:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-16 12:29:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:29:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:29:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-16 12:29:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-16 12:29:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-16 12:29:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-16 12:29:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 12:29:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-16 12:29:16,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:16,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817806175] [2022-11-16 12:29:16,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817806175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:16,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:16,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:29:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172625398] [2022-11-16 12:29:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:16,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:29:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:29:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:29:16,761 INFO L87 Difference]: Start difference. First operand 2814 states and 3829 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-16 12:29:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:40,699 INFO L93 Difference]: Finished difference Result 3287 states and 4830 transitions. [2022-11-16 12:29:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:29:40,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 218 [2022-11-16 12:29:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:40,713 INFO L225 Difference]: With dead ends: 3287 [2022-11-16 12:29:40,713 INFO L226 Difference]: Without dead ends: 3285 [2022-11-16 12:29:40,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:29:40,716 INFO L413 NwaCegarLoop]: 1325 mSDtfsCounter, 5480 mSDsluCounter, 6648 mSDsCounter, 0 mSdLazyCounter, 13931 mSolverCounterSat, 6267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5494 SdHoareTripleChecker+Valid, 7973 SdHoareTripleChecker+Invalid, 20198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6267 IncrementalHoareTripleChecker+Valid, 13931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:40,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5494 Valid, 7973 Invalid, 20198 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6267 Valid, 13931 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2022-11-16 12:29:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2022-11-16 12:29:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2874. [2022-11-16 12:29:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 1911 states have (on average 1.2548403976975406) internal successors, (2398), 2017 states have internal predecessors, (2398), 716 states have call successors, (716), 225 states have call predecessors, (716), 241 states have return successors, (823), 672 states have call predecessors, (823), 714 states have call successors, (823) [2022-11-16 12:29:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 3937 transitions. [2022-11-16 12:29:41,453 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 3937 transitions. Word has length 218 [2022-11-16 12:29:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:41,453 INFO L495 AbstractCegarLoop]: Abstraction has 2874 states and 3937 transitions. [2022-11-16 12:29:41,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-16 12:29:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 3937 transitions. [2022-11-16 12:29:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-16 12:29:41,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:41,458 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:41,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 12:29:41,458 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:29:41,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2004917983, now seen corresponding path program 1 times [2022-11-16 12:29:41,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:41,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496550704] [2022-11-16 12:29:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:29:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:29:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:29:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:29:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:29:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:29:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:29:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:29:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:29:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 12:29:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 12:29:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 12:29:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:29:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 12:29:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:29:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:29:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:29:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:29:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:29:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:29:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:29:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 12:29:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 12:29:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-16 12:29:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-16 12:29:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:42,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:29:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:29:42,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:42,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496550704] [2022-11-16 12:29:42,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496550704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:42,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:42,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:29:42,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885387521] [2022-11-16 12:29:42,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:42,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:29:42,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:42,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:29:42,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:42,023 INFO L87 Difference]: Start difference. First operand 2874 states and 3937 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-16 12:29:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:53,594 INFO L93 Difference]: Finished difference Result 2981 states and 4127 transitions. [2022-11-16 12:29:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:29:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2022-11-16 12:29:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:53,604 INFO L225 Difference]: With dead ends: 2981 [2022-11-16 12:29:53,604 INFO L226 Difference]: Without dead ends: 2677 [2022-11-16 12:29:53,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:29:53,610 INFO L413 NwaCegarLoop]: 1315 mSDtfsCounter, 4801 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 5318 mSolverCounterSat, 3136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5063 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 8454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3136 IncrementalHoareTripleChecker+Valid, 5318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:53,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5063 Valid, 4524 Invalid, 8454 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3136 Valid, 5318 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-16 12:29:53,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-11-16 12:29:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2570. [2022-11-16 12:29:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 1700 states have (on average 1.281764705882353) internal successors, (2179), 1803 states have internal predecessors, (2179), 665 states have call successors, (665), 183 states have call predecessors, (665), 200 states have return successors, (774), 623 states have call predecessors, (774), 665 states have call successors, (774) [2022-11-16 12:29:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3618 transitions. [2022-11-16 12:29:54,424 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3618 transitions. Word has length 177 [2022-11-16 12:29:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:54,425 INFO L495 AbstractCegarLoop]: Abstraction has 2570 states and 3618 transitions. [2022-11-16 12:29:54,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-16 12:29:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3618 transitions. [2022-11-16 12:29:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-11-16 12:29:54,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:54,430 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:54,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 12:29:54,433 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:29:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1685087321, now seen corresponding path program 1 times [2022-11-16 12:29:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:54,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639197577] [2022-11-16 12:29:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:29:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:29:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:29:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:29:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:29:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:29:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:29:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:29:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:29:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:29:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:29:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:29:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:29:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:29:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:29:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:29:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:29:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:29:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:29:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:29:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-16 12:29:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:29:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-16 12:29:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 12:29:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:29:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-16 12:29:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-16 12:29:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-16 12:29:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-16 12:29:55,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639197577] [2022-11-16 12:29:55,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639197577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:55,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:55,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:29:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114409162] [2022-11-16 12:29:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:55,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:29:55,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:55,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:29:55,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:29:55,439 INFO L87 Difference]: Start difference. First operand 2570 states and 3618 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 12:30:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:11,977 INFO L93 Difference]: Finished difference Result 5026 states and 7366 transitions. [2022-11-16 12:30:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:30:11,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 232 [2022-11-16 12:30:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:11,992 INFO L225 Difference]: With dead ends: 5026 [2022-11-16 12:30:11,992 INFO L226 Difference]: Without dead ends: 2937 [2022-11-16 12:30:12,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:30:12,001 INFO L413 NwaCegarLoop]: 1187 mSDtfsCounter, 5567 mSDsluCounter, 5327 mSDsCounter, 0 mSdLazyCounter, 10109 mSolverCounterSat, 4619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5799 SdHoareTripleChecker+Valid, 6514 SdHoareTripleChecker+Invalid, 14728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4619 IncrementalHoareTripleChecker+Valid, 10109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:12,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5799 Valid, 6514 Invalid, 14728 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4619 Valid, 10109 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2022-11-16 12:30:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2022-11-16 12:30:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 2570. [2022-11-16 12:30:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 1700 states have (on average 1.2805882352941176) internal successors, (2177), 1803 states have internal predecessors, (2177), 665 states have call successors, (665), 183 states have call predecessors, (665), 200 states have return successors, (774), 623 states have call predecessors, (774), 665 states have call successors, (774) [2022-11-16 12:30:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3616 transitions. [2022-11-16 12:30:12,807 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3616 transitions. Word has length 232 [2022-11-16 12:30:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:12,808 INFO L495 AbstractCegarLoop]: Abstraction has 2570 states and 3616 transitions. [2022-11-16 12:30:12,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 12:30:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3616 transitions. [2022-11-16 12:30:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-11-16 12:30:12,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:12,813 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:12,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-16 12:30:12,814 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:30:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:12,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1685027739, now seen corresponding path program 1 times [2022-11-16 12:30:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:12,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798685583] [2022-11-16 12:30:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:30:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:30:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:30:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:30:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:30:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:30:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:30:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:30:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:30:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:30:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:30:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:30:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:30:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:30:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:30:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-16 12:30:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-16 12:30:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 12:30:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:30:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-16 12:30:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-16 12:30:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-16 12:30:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-16 12:30:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:13,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798685583] [2022-11-16 12:30:13,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798685583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:13,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:13,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:30:13,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610838225] [2022-11-16 12:30:13,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:13,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:30:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:13,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:30:13,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:30:13,566 INFO L87 Difference]: Start difference. First operand 2570 states and 3616 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-11-16 12:30:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:27,554 INFO L93 Difference]: Finished difference Result 2937 states and 4404 transitions. [2022-11-16 12:30:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:30:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 232 [2022-11-16 12:30:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:27,564 INFO L225 Difference]: With dead ends: 2937 [2022-11-16 12:30:27,564 INFO L226 Difference]: Without dead ends: 2935 [2022-11-16 12:30:27,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:30:27,566 INFO L413 NwaCegarLoop]: 1187 mSDtfsCounter, 3239 mSDsluCounter, 4589 mSDsCounter, 0 mSdLazyCounter, 8296 mSolverCounterSat, 3307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3239 SdHoareTripleChecker+Valid, 5776 SdHoareTripleChecker+Invalid, 11603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3307 IncrementalHoareTripleChecker+Valid, 8296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:27,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3239 Valid, 5776 Invalid, 11603 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3307 Valid, 8296 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2022-11-16 12:30:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2022-11-16 12:30:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2568. [2022-11-16 12:30:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 1699 states have (on average 1.279576221306651) internal successors, (2174), 1801 states have internal predecessors, (2174), 665 states have call successors, (665), 183 states have call predecessors, (665), 200 states have return successors, (774), 623 states have call predecessors, (774), 665 states have call successors, (774) [2022-11-16 12:30:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3613 transitions. [2022-11-16 12:30:28,256 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3613 transitions. Word has length 232 [2022-11-16 12:30:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:28,256 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 3613 transitions. [2022-11-16 12:30:28,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (29), 6 states have call predecessors, (29), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-11-16 12:30:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3613 transitions. [2022-11-16 12:30:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-11-16 12:30:28,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:28,262 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:28,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-16 12:30:28,263 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:30:28,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1526829397, now seen corresponding path program 1 times [2022-11-16 12:30:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:28,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129227182] [2022-11-16 12:30:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:30:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:30:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:30:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:30:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:30:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:30:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:30:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:30:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:30:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:30:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:30:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:30:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:30:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:30:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:30:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-16 12:30:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-16 12:30:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 12:30:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:30:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-16 12:30:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-16 12:30:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-16 12:30:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-16 12:30:28,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:28,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129227182] [2022-11-16 12:30:28,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129227182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:28,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:28,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:30:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746322383] [2022-11-16 12:30:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:28,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:30:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:28,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:30:28,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:30:28,955 INFO L87 Difference]: Start difference. First operand 2568 states and 3613 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 12:30:42,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:43,292 INFO L93 Difference]: Finished difference Result 5016 states and 7349 transitions. [2022-11-16 12:30:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:30:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 236 [2022-11-16 12:30:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:43,302 INFO L225 Difference]: With dead ends: 5016 [2022-11-16 12:30:43,302 INFO L226 Difference]: Without dead ends: 2929 [2022-11-16 12:30:43,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:30:43,311 INFO L413 NwaCegarLoop]: 1187 mSDtfsCounter, 5528 mSDsluCounter, 2691 mSDsCounter, 0 mSdLazyCounter, 4267 mSolverCounterSat, 4646 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5759 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 8914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4646 IncrementalHoareTripleChecker+Valid, 4267 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:43,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5759 Valid, 3878 Invalid, 8914 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4646 Valid, 4267 Invalid, 1 Unknown, 0 Unchecked, 13.1s Time] [2022-11-16 12:30:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2022-11-16 12:30:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2562. [2022-11-16 12:30:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 1694 states have (on average 1.2780401416765053) internal successors, (2165), 1795 states have internal predecessors, (2165), 665 states have call successors, (665), 183 states have call predecessors, (665), 200 states have return successors, (774), 623 states have call predecessors, (774), 665 states have call successors, (774) [2022-11-16 12:30:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3604 transitions. [2022-11-16 12:30:43,823 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3604 transitions. Word has length 236 [2022-11-16 12:30:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:43,824 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 3604 transitions. [2022-11-16 12:30:43,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 12:30:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3604 transitions. [2022-11-16 12:30:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-11-16 12:30:43,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:43,830 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:43,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-16 12:30:43,830 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:30:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1660584601, now seen corresponding path program 1 times [2022-11-16 12:30:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:43,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120706764] [2022-11-16 12:30:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:30:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:30:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:30:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:30:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:30:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:30:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:30:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:30:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:30:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:30:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:30:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:30:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:30:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:30:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:30:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:30:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:30:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-16 12:30:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:30:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-16 12:30:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 12:30:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:30:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-16 12:30:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-16 12:30:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:30:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 12:30:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-16 12:30:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-16 12:30:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-11-16 12:30:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:44,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120706764] [2022-11-16 12:30:44,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120706764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:44,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:44,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:30:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059688892] [2022-11-16 12:30:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:44,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:30:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:30:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:30:44,642 INFO L87 Difference]: Start difference. First operand 2562 states and 3604 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (33), 9 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) [2022-11-16 12:31:05,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:31:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:31:07,209 INFO L93 Difference]: Finished difference Result 3357 states and 5570 transitions. [2022-11-16 12:31:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:31:07,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (33), 9 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) Word has length 240 [2022-11-16 12:31:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:31:07,221 INFO L225 Difference]: With dead ends: 3357 [2022-11-16 12:31:07,221 INFO L226 Difference]: Without dead ends: 3355 [2022-11-16 12:31:07,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=533, Unknown=0, NotChecked=0, Total=756 [2022-11-16 12:31:07,224 INFO L413 NwaCegarLoop]: 1122 mSDtfsCounter, 4354 mSDsluCounter, 6554 mSDsCounter, 0 mSdLazyCounter, 12221 mSolverCounterSat, 4204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4424 SdHoareTripleChecker+Valid, 7676 SdHoareTripleChecker+Invalid, 16425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4204 IncrementalHoareTripleChecker+Valid, 12221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:31:07,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4424 Valid, 7676 Invalid, 16425 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4204 Valid, 12221 Invalid, 0 Unknown, 0 Unchecked, 20.8s Time] [2022-11-16 12:31:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2022-11-16 12:31:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2560. [2022-11-16 12:31:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1693 states have (on average 1.2770230360307147) internal successors, (2162), 1793 states have internal predecessors, (2162), 665 states have call successors, (665), 183 states have call predecessors, (665), 200 states have return successors, (774), 623 states have call predecessors, (774), 665 states have call successors, (774) [2022-11-16 12:31:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3601 transitions. [2022-11-16 12:31:07,903 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3601 transitions. Word has length 240 [2022-11-16 12:31:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:31:07,903 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3601 transitions. [2022-11-16 12:31:07,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (33), 9 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 3 states have call successors, (30) [2022-11-16 12:31:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3601 transitions. [2022-11-16 12:31:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-16 12:31:07,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:31:07,909 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:31:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-16 12:31:07,909 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:31:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:31:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1062121592, now seen corresponding path program 1 times [2022-11-16 12:31:07,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:31:07,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753516206] [2022-11-16 12:31:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:31:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:31:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:31:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:31:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:31:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:31:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:31:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:31:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:31:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:31:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:31:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:31:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:31:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:31:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:31:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:31:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:31:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-16 12:31:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-16 12:31:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 12:31:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:31:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-16 12:31:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-16 12:31:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-16 12:31:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-11-16 12:31:08,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:31:08,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753516206] [2022-11-16 12:31:08,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753516206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:31:08,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:31:08,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:31:08,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249601884] [2022-11-16 12:31:08,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:31:08,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:31:08,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:31:08,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:31:08,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:31:08,595 INFO L87 Difference]: Start difference. First operand 2560 states and 3601 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-11-16 12:31:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:31:25,093 INFO L93 Difference]: Finished difference Result 5476 states and 8255 transitions. [2022-11-16 12:31:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:31:25,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 241 [2022-11-16 12:31:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:31:25,106 INFO L225 Difference]: With dead ends: 5476 [2022-11-16 12:31:25,106 INFO L226 Difference]: Without dead ends: 2941 [2022-11-16 12:31:25,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:31:25,115 INFO L413 NwaCegarLoop]: 1187 mSDtfsCounter, 3614 mSDsluCounter, 5538 mSDsCounter, 0 mSdLazyCounter, 9778 mSolverCounterSat, 3949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3614 SdHoareTripleChecker+Valid, 6725 SdHoareTripleChecker+Invalid, 13727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3949 IncrementalHoareTripleChecker+Valid, 9778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:31:25,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3614 Valid, 6725 Invalid, 13727 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3949 Valid, 9778 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2022-11-16 12:31:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2022-11-16 12:31:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2566. [2022-11-16 12:31:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 1699 states have (on average 1.2760447321954091) internal successors, (2168), 1799 states have internal predecessors, (2168), 665 states have call successors, (665), 183 states have call predecessors, (665), 200 states have return successors, (774), 623 states have call predecessors, (774), 665 states have call successors, (774) [2022-11-16 12:31:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3607 transitions. [2022-11-16 12:31:25,756 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3607 transitions. Word has length 241 [2022-11-16 12:31:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:31:25,757 INFO L495 AbstractCegarLoop]: Abstraction has 2566 states and 3607 transitions. [2022-11-16 12:31:25,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (34), 7 states have call predecessors, (34), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-11-16 12:31:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3607 transitions. [2022-11-16 12:31:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-16 12:31:25,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:31:25,764 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:31:25,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-16 12:31:25,764 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:31:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:31:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash 41053238, now seen corresponding path program 1 times [2022-11-16 12:31:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:31:25,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7983716] [2022-11-16 12:31:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:31:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:31:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:31:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:31:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:31:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 12:31:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:31:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:31:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 12:31:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:31:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:31:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:31:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:31:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 12:31:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 12:31:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:31:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:31:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-16 12:31:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-16 12:31:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-16 12:31:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:31:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-16 12:31:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-16 12:31:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-16 12:31:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-11-16 12:31:26,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:31:26,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7983716] [2022-11-16 12:31:26,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7983716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:31:26,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:31:26,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:31:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799351053] [2022-11-16 12:31:26,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:31:26,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:31:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:31:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:31:26,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:31:26,651 INFO L87 Difference]: Start difference. First operand 2566 states and 3607 transitions. Second operand has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (34), 10 states have call predecessors, (34), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 12:31:44,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:31:48,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:31:50,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:31:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:31:51,537 INFO L93 Difference]: Finished difference Result 4975 states and 7184 transitions. [2022-11-16 12:31:51,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:31:51,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (34), 10 states have call predecessors, (34), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 241 [2022-11-16 12:31:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:31:51,550 INFO L225 Difference]: With dead ends: 4975 [2022-11-16 12:31:51,551 INFO L226 Difference]: Without dead ends: 1601 [2022-11-16 12:31:51,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:31:51,565 INFO L413 NwaCegarLoop]: 1184 mSDtfsCounter, 2887 mSDsluCounter, 7920 mSDsCounter, 0 mSdLazyCounter, 14869 mSolverCounterSat, 2714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2887 SdHoareTripleChecker+Valid, 9104 SdHoareTripleChecker+Invalid, 17583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 2714 IncrementalHoareTripleChecker+Valid, 14869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:31:51,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2887 Valid, 9104 Invalid, 17583 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [2714 Valid, 14869 Invalid, 0 Unknown, 0 Unchecked, 23.3s Time] [2022-11-16 12:31:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-11-16 12:31:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1411. [2022-11-16 12:31:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 949 states have (on average 1.2581664910432033) internal successors, (1194), 1001 states have internal predecessors, (1194), 342 states have call successors, (342), 118 states have call predecessors, (342), 118 states have return successors, (343), 315 states have call predecessors, (343), 342 states have call successors, (343) [2022-11-16 12:31:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1879 transitions. [2022-11-16 12:31:51,856 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1879 transitions. Word has length 241 [2022-11-16 12:31:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:31:51,857 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 1879 transitions. [2022-11-16 12:31:51,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.272727272727273) internal successors, (91), 5 states have internal predecessors, (91), 4 states have call successors, (34), 10 states have call predecessors, (34), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-16 12:31:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1879 transitions. [2022-11-16 12:31:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-16 12:31:51,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:31:51,861 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:31:51,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-16 12:31:51,862 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:31:51,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:31:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash 347861200, now seen corresponding path program 1 times [2022-11-16 12:31:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:31:51,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854403651] [2022-11-16 12:31:51,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:31:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:31:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:31:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:31:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:31:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:31:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:31:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:31:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:31:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:31:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:31:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:31:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:31:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 12:31:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 12:31:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 12:31:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 12:31:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 12:31:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:31:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 12:31:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:31:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:31:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:31:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:31:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:31:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-16 12:31:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-11-16 12:31:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:31:53,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854403651] [2022-11-16 12:31:53,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854403651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:31:53,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:31:53,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:31:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930515866] [2022-11-16 12:31:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:31:53,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:31:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:31:53,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:31:53,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:31:53,186 INFO L87 Difference]: Start difference. First operand 1411 states and 1879 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-11-16 12:32:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:05,196 INFO L93 Difference]: Finished difference Result 1748 states and 2380 transitions. [2022-11-16 12:32:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 12:32:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 220 [2022-11-16 12:32:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:05,202 INFO L225 Difference]: With dead ends: 1748 [2022-11-16 12:32:05,203 INFO L226 Difference]: Without dead ends: 1746 [2022-11-16 12:32:05,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=734, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 12:32:05,204 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 5040 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 7131 mSolverCounterSat, 3730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5050 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 10861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3730 IncrementalHoareTripleChecker+Valid, 7131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:05,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5050 Valid, 1724 Invalid, 10861 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3730 Valid, 7131 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-11-16 12:32:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2022-11-16 12:32:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1543. [2022-11-16 12:32:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1036 states have (on average 1.247104247104247) internal successors, (1292), 1094 states have internal predecessors, (1292), 369 states have call successors, (369), 137 states have call predecessors, (369), 137 states have return successors, (370), 340 states have call predecessors, (370), 369 states have call successors, (370) [2022-11-16 12:32:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2031 transitions. [2022-11-16 12:32:05,487 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2031 transitions. Word has length 220 [2022-11-16 12:32:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:05,488 INFO L495 AbstractCegarLoop]: Abstraction has 1543 states and 2031 transitions. [2022-11-16 12:32:05,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-11-16 12:32:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2031 transitions. [2022-11-16 12:32:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-11-16 12:32:05,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:05,491 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:05,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-16 12:32:05,492 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-11-16 12:32:05,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1017559470, now seen corresponding path program 1 times [2022-11-16 12:32:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:05,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598503789] [2022-11-16 12:32:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:32:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-16 12:32:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:32:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:32:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:32:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 12:32:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:32:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:32:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:32:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 12:32:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:32:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:32:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:32:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:32:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:32:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-16 12:32:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 12:32:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:32:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:32:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 12:32:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 12:32:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 12:32:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:32:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 12:32:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 12:32:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:32:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 12:32:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:32:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:32:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:32:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:32:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-16 12:32:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-16 12:32:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-16 12:32:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:32:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-11-16 12:32:06,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:06,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598503789] [2022-11-16 12:32:06,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598503789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:06,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:06,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:32:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719323482] [2022-11-16 12:32:06,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:06,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:32:06,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:32:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:32:06,373 INFO L87 Difference]: Start difference. First operand 1543 states and 2031 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (33), 9 states have call predecessors, (33), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2022-11-16 12:32:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:18,838 INFO L93 Difference]: Finished difference Result 1752 states and 2384 transitions. [2022-11-16 12:32:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:32:18,838 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (33), 9 states have call predecessors, (33), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) Word has length 232 [2022-11-16 12:32:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:18,839 INFO L225 Difference]: With dead ends: 1752 [2022-11-16 12:32:18,839 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 12:32:18,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=656, Unknown=0, NotChecked=0, Total=930 [2022-11-16 12:32:18,842 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 3764 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 8699 mSolverCounterSat, 3179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3764 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 11878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3179 IncrementalHoareTripleChecker+Valid, 8699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:18,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3764 Valid, 2062 Invalid, 11878 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3179 Valid, 8699 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2022-11-16 12:32:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 12:32:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 12:32:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 12:32:18,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2022-11-16 12:32:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:18,844 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 12:32:18,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (33), 9 states have call predecessors, (33), 2 states have return successors, (29), 2 states have call predecessors, (29), 1 states have call successors, (29) [2022-11-16 12:32:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 12:32:18,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 12:32:18,847 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2022-11-16 12:32:18,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2022-11-16 12:32:18,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2022-11-16 12:32:18,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2022-11-16 12:32:18,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2022-11-16 12:32:18,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2022-11-16 12:32:18,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2022-11-16 12:32:18,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2022-11-16 12:32:18,849 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2022-11-16 12:32:18,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2022-11-16 12:32:18,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2022-11-16 12:32:18,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2022-11-16 12:32:18,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2022-11-16 12:32:18,850 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2022-11-16 12:32:18,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2022-11-16 12:32:18,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2022-11-16 12:32:18,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2022-11-16 12:32:18,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2022-11-16 12:32:18,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2022-11-16 12:32:18,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2022-11-16 12:32:18,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2022-11-16 12:32:18,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2022-11-16 12:32:18,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2022-11-16 12:32:18,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2022-11-16 12:32:18,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2022-11-16 12:32:18,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2022-11-16 12:32:18,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2022-11-16 12:32:18,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2022-11-16 12:32:18,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2022-11-16 12:32:18,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-16 12:32:18,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.