./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc --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 6b2cae6d498f7aa4576ffcfd28b3f955c7840001d7c2abb7c90b6970c97881d1 --- 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-5e519f3 [2022-11-02 20:42:08,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:42:08,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:42:08,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:42:08,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:42:08,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:42:08,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:42:08,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:42:08,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:42:08,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:42:08,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:42:08,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:42:08,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:42:08,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:42:08,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:42:08,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:42:08,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:42:08,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:42:08,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:42:08,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:42:08,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:42:08,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:42:08,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:42:08,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:42:08,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:42:08,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:42:08,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:42:08,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:42:08,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:42:08,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:42:08,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:42:08,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:42:08,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:42:08,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:42:08,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:42:08,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:42:08,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:42:08,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:42:08,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:42:08,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:42:08,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:42:08,482 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:42:08,504 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:42:08,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:42:08,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:42:08,505 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:42:08,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:42:08,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:42:08,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:42:08,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:42:08,507 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:42:08,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:42:08,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:42:08,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:42:08,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:42:08,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:42:08,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:42:08,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:42:08,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:42:08,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:42:08,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:42:08,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:42:08,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:42:08,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:42:08,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:42:08,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:42:08,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:42:08,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:42:08,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:42:08,512 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:42:08,512 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:42:08,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:42:08,512 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/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_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc 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 -> 6b2cae6d498f7aa4576ffcfd28b3f955c7840001d7c2abb7c90b6970c97881d1 [2022-11-02 20:42:08,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:42:08,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:42:08,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:42:08,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:42:08,806 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:42:08,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i [2022-11-02 20:42:08,884 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/data/4702341bf/01e444b3567849249310c543a97c5be3/FLAG76b2ce145 [2022-11-02 20:42:09,888 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:42:09,888 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i [2022-11-02 20:42:09,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/data/4702341bf/01e444b3567849249310c543a97c5be3/FLAG76b2ce145 [2022-11-02 20:42:10,310 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/data/4702341bf/01e444b3567849249310c543a97c5be3 [2022-11-02 20:42:10,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:42:10,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:42:10,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:10,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:42:10,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:42:10,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:10" (1/1) ... [2022-11-02 20:42:10,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bce3ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:10, skipping insertion in model container [2022-11-02 20:42:10,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:10" (1/1) ... [2022-11-02 20:42:10,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:42:10,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:42:13,330 WARN L230 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[314801,314814] [2022-11-02 20:42:13,335 WARN L230 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[314970,314983] [2022-11-02 20:42:13,335 WARN L230 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[315137,315150] [2022-11-02 20:42:13,336 WARN L230 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[315305,315318] [2022-11-02 20:42:13,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:13,422 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:42:13,826 WARN L230 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[314801,314814] [2022-11-02 20:42:13,827 WARN L230 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[314970,314983] [2022-11-02 20:42:13,828 WARN L230 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[315137,315150] [2022-11-02 20:42:13,828 WARN L230 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_4698d039-00f2-45ac-8eea-40f20e7dabcd/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i[315305,315318] [2022-11-02 20:42:13,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:14,023 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:42:14,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14 WrapperNode [2022-11-02 20:42:14,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:14,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:14,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:42:14,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:42:14,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,269 INFO L138 Inliner]: procedures = 391, calls = 1784, calls flagged for inlining = 177, calls inlined = 156, statements flattened = 4172 [2022-11-02 20:42:14,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:14,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:42:14,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:42:14,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:42:14,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:42:14,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:42:14,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:42:14,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:42:14,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (1/1) ... [2022-11-02 20:42:14,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:42:14,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:14,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:14,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4698d039-00f2-45ac-8eea-40f20e7dabcd/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:42:14,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:42:14,664 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:42:14,664 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2022-11-02 20:42:14,664 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2022-11-02 20:42:14,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:42:14,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:42:14,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 20:42:14,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-02 20:42:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-11-02 20:42:14,665 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-11-02 20:42:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_66 [2022-11-02 20:42:14,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_66 [2022-11-02 20:42:14,665 INFO L130 BoogieDeclarations]: Found specification of procedure dev_trans_start [2022-11-02 20:42:14,666 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_trans_start [2022-11-02 20:42:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_open [2022-11-02 20:42:14,666 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_open [2022-11-02 20:42:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_load_eeprom [2022-11-02 20:42:14,666 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_load_eeprom [2022-11-02 20:42:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 20:42:14,666 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_sense_lan [2022-11-02 20:42:14,667 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_sense_lan [2022-11-02 20:42:14,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-02 20:42:14,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-02 20:42:14,667 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-11-02 20:42:14,667 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-11-02 20:42:14,667 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-11-02 20:42:14,668 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-11-02 20:42:14,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-02 20:42:14,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-02 20:42:14,668 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-11-02 20:42:14,668 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-11-02 20:42:14,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:42:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-11-02 20:42:14,669 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-11-02 20:42:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_word [2022-11-02 20:42:14,669 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_word [2022-11-02 20:42:14,669 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-02 20:42:14,669 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-02 20:42:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_cascade_reset [2022-11-02 20:42:14,670 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_cascade_reset [2022-11-02 20:42:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:42:14,670 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-11-02 20:42:14,670 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-11-02 20:42:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:42:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-02 20:42:14,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-02 20:42:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:42:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-11-02 20:42:14,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-11-02 20:42:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:42:14,672 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:42:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_rx_bm [2022-11-02 20:42:14,675 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_rx_bm [2022-11-02 20:42:14,675 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_BM_shutdown [2022-11-02 20:42:14,676 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_BM_shutdown [2022-11-02 20:42:14,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-11-02 20:42:14,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-11-02 20:42:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-11-02 20:42:14,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-11-02 20:42:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure wait [2022-11-02 20:42:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure wait [2022-11-02 20:42:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-11-02 20:42:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-11-02 20:42:14,679 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_hwinit [2022-11-02 20:42:14,679 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_hwinit [2022-11-02 20:42:14,680 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-11-02 20:42:14,680 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-11-02 20:42:14,680 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_whatever [2022-11-02 20:42:14,680 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_whatever [2022-11-02 20:42:14,680 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_close [2022-11-02 20:42:14,680 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_close [2022-11-02 20:42:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-11-02 20:42:14,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-11-02 20:42:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:42:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_stop_interface [2022-11-02 20:42:14,681 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_stop_interface [2022-11-02 20:42:14,681 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_check_lan [2022-11-02 20:42:14,682 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_check_lan [2022-11-02 20:42:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-11-02 20:42:14,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-11-02 20:42:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:42:14,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:42:14,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:42:14,683 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-02 20:42:14,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-02 20:42:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:42:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-02 20:42:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:42:14,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:42:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:42:14,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 20:42:14,685 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-11-02 20:42:14,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-11-02 20:42:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_rxfill [2022-11-02 20:42:14,686 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_rxfill [2022-11-02 20:42:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 20:42:14,686 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 20:42:14,686 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-02 20:42:14,686 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-02 20:42:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-11-02 20:42:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-11-02 20:42:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:42:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:42:14,687 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_update_stats [2022-11-02 20:42:14,688 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_update_stats [2022-11-02 20:42:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:42:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:42:14,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:42:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:42:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 20:42:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-02 20:42:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-11-02 20:42:14,690 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-11-02 20:42:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:42:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:42:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-11-02 20:42:14,695 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-11-02 20:42:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:42:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:42:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:42:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-11-02 20:42:14,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-11-02 20:42:14,703 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-11-02 20:42:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-11-02 20:42:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-02 20:42:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-02 20:42:14,704 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-11-02 20:42:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-11-02 20:42:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-02 20:42:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-02 20:42:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-11-02 20:42:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-11-02 20:42:14,709 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_pci_remove [2022-11-02 20:42:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_pci_remove [2022-11-02 20:42:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_build_rx_pdl [2022-11-02 20:42:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_build_rx_pdl [2022-11-02 20:42:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-11-02 20:42:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-11-02 20:42:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-02 20:42:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-02 20:42:14,710 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-11-02 20:42:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-11-02 20:42:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_hp100_private [2022-11-02 20:42:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_hp100_private [2022-11-02 20:42:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:42:14,711 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2022-11-02 20:42:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2022-11-02 20:42:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:42:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:42:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_hp100_private [2022-11-02 20:42:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_hp100_private [2022-11-02 20:42:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_80 [2022-11-02 20:42:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_80 [2022-11-02 20:42:14,712 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2022-11-02 20:42:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2022-11-02 20:42:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-11-02 20:42:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-11-02 20:42:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-02 20:42:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-02 20:42:14,713 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_set_multicast_list [2022-11-02 20:42:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_set_multicast_list [2022-11-02 20:42:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_start_interface [2022-11-02 20:42:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_start_interface [2022-11-02 20:42:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-11-02 20:42:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-11-02 20:42:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_clean_txring [2022-11-02 20:42:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_clean_txring [2022-11-02 20:42:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-11-02 20:42:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-11-02 20:42:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:42:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure inw [2022-11-02 20:42:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure inw [2022-11-02 20:42:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-11-02 20:42:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-11-02 20:42:14,715 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_login_to_vg_hub [2022-11-02 20:42:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_login_to_vg_hub [2022-11-02 20:42:14,716 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-11-02 20:42:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-11-02 20:42:15,542 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:42:15,547 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:42:15,897 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:42:18,954 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-11-02 20:42:18,955 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:42:19,200 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563: SUMMARY for call #t~ret679#1 := schedule_timeout_interruptible(1); srcloc: null [2022-11-02 20:42:19,200 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563-1: assume -9223372036854775808 <= #t~ret679#1 && #t~ret679#1 <= 9223372036854775807;havoc #t~ret679#1; [2022-11-02 20:42:19,200 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume 0 == (if 0 == ~tmp___4~7#1 then 0 else (if 1 == ~tmp___4~7#1 then 0 else ~bitwiseAnd(~tmp___4~7#1, 2096896))) % 18446744073709551616; [2022-11-02 20:42:19,200 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !(0 == (if 0 == ~tmp___4~7#1 then 0 else (if 1 == ~tmp___4~7#1 then 0 else ~bitwiseAnd(~tmp___4~7#1, 2096896))) % 18446744073709551616); [2022-11-02 20:42:19,201 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L8567: assume (if (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 else (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616) < 0; [2022-11-02 20:42:19,201 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L8567: assume !((if (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 else (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616) < 0); [2022-11-02 20:42:19,397 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:42:19,426 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:42:19,427 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:42:19,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:19 BoogieIcfgContainer [2022-11-02 20:42:19,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:42:19,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:42:19,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:42:19,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:42:19,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:42:10" (1/3) ... [2022-11-02 20:42:19,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4401423f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:42:19, skipping insertion in model container [2022-11-02 20:42:19,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:14" (2/3) ... [2022-11-02 20:42:19,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4401423f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:42:19, skipping insertion in model container [2022-11-02 20:42:19,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:19" (3/3) ... [2022-11-02 20:42:19,447 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i [2022-11-02 20:42:19,469 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:42:19,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-02 20:42:19,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:42:19,593 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;@2c584070, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:42:19,594 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-02 20:42:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 1742 states, 1093 states have (on average 1.2909423604757548) internal successors, (1411), 1143 states have internal predecessors, (1411), 568 states have call successors, (568), 80 states have call predecessors, (568), 79 states have return successors, (563), 547 states have call predecessors, (563), 563 states have call successors, (563) [2022-11-02 20:42:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:42:19,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:19,625 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:19,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:42:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1862336508, now seen corresponding path program 1 times [2022-11-02 20:42:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:19,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610785498] [2022-11-02 20:42:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:42:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:42:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:42:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:42:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:42:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:42:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:20,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610785498] [2022-11-02 20:42:20,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610785498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:20,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:20,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:20,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938884805] [2022-11-02 20:42:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:20,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:42:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:20,581 INFO L87 Difference]: Start difference. First operand has 1742 states, 1093 states have (on average 1.2909423604757548) internal successors, (1411), 1143 states have internal predecessors, (1411), 568 states have call successors, (568), 80 states have call predecessors, (568), 79 states have return successors, (563), 547 states have call predecessors, (563), 563 states have call successors, (563) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:42:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:28,309 INFO L93 Difference]: Finished difference Result 5271 states and 7907 transitions. [2022-11-02 20:42:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:42:28,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2022-11-02 20:42:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:28,357 INFO L225 Difference]: With dead ends: 5271 [2022-11-02 20:42:28,357 INFO L226 Difference]: Without dead ends: 3532 [2022-11-02 20:42:28,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:28,381 INFO L413 NwaCegarLoop]: 2450 mSDtfsCounter, 3111 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3654 SdHoareTripleChecker+Valid, 4270 SdHoareTripleChecker+Invalid, 4720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:28,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3654 Valid, 4270 Invalid, 4720 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2123 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-02 20:42:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2022-11-02 20:42:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 3370. [2022-11-02 20:42:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 2117 states have (on average 1.2824752007557865) internal successors, (2715), 2213 states have internal predecessors, (2715), 1095 states have call successors, (1095), 156 states have call predecessors, (1095), 155 states have return successors, (1092), 1060 states have call predecessors, (1092), 1092 states have call successors, (1092) [2022-11-02 20:42:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4902 transitions. [2022-11-02 20:42:28,844 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4902 transitions. Word has length 68 [2022-11-02 20:42:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:28,845 INFO L495 AbstractCegarLoop]: Abstraction has 3370 states and 4902 transitions. [2022-11-02 20:42:28,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:42:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4902 transitions. [2022-11-02 20:42:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 20:42:28,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:28,851 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:28,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:42:28,851 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:42:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 323210058, now seen corresponding path program 1 times [2022-11-02 20:42:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:28,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688787299] [2022-11-02 20:42:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:42:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:42:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:42:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:42:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:42:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:42:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:29,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688787299] [2022-11-02 20:42:29,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688787299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:29,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:29,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:29,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056168241] [2022-11-02 20:42:29,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:29,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:42:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:29,201 INFO L87 Difference]: Start difference. First operand 3370 states and 4902 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:42:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:35,887 INFO L93 Difference]: Finished difference Result 9908 states and 14506 transitions. [2022-11-02 20:42:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:42:35,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 73 [2022-11-02 20:42:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:35,937 INFO L225 Difference]: With dead ends: 9908 [2022-11-02 20:42:35,937 INFO L226 Difference]: Without dead ends: 6551 [2022-11-02 20:42:35,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:35,955 INFO L413 NwaCegarLoop]: 2713 mSDtfsCounter, 2649 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 1959 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3147 SdHoareTripleChecker+Valid, 4620 SdHoareTripleChecker+Invalid, 4477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1959 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:35,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3147 Valid, 4620 Invalid, 4477 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1959 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 20:42:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6551 states. [2022-11-02 20:42:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6551 to 6268. [2022-11-02 20:42:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 3912 states have (on average 1.2845092024539877) internal successors, (5025), 4098 states have internal predecessors, (5025), 2060 states have call successors, (2060), 294 states have call predecessors, (2060), 293 states have return successors, (2079), 1983 states have call predecessors, (2079), 2057 states have call successors, (2079) [2022-11-02 20:42:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 9164 transitions. [2022-11-02 20:42:36,593 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 9164 transitions. Word has length 73 [2022-11-02 20:42:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:36,594 INFO L495 AbstractCegarLoop]: Abstraction has 6268 states and 9164 transitions. [2022-11-02 20:42:36,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:42:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 9164 transitions. [2022-11-02 20:42:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:42:36,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:36,598 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:36,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:42:36,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:42:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash -697907898, now seen corresponding path program 1 times [2022-11-02 20:42:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:36,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306737414] [2022-11-02 20:42:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:42:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:42:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:42:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:42:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:42:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:42:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:36,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306737414] [2022-11-02 20:42:36,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306737414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:36,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:36,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604964396] [2022-11-02 20:42:36,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:36,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:42:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:36,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:36,867 INFO L87 Difference]: Start difference. First operand 6268 states and 9164 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:42:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:43,478 INFO L93 Difference]: Finished difference Result 18620 states and 27306 transitions. [2022-11-02 20:42:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:42:43,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-11-02 20:42:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:43,563 INFO L225 Difference]: With dead ends: 18620 [2022-11-02 20:42:43,564 INFO L226 Difference]: Without dead ends: 12365 [2022-11-02 20:42:43,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:43,597 INFO L413 NwaCegarLoop]: 2401 mSDtfsCounter, 2918 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 2116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3425 SdHoareTripleChecker+Valid, 4204 SdHoareTripleChecker+Invalid, 4682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2116 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:43,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3425 Valid, 4204 Invalid, 4682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2116 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-02 20:42:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12365 states. [2022-11-02 20:42:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12365 to 11844. [2022-11-02 20:42:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11844 states, 7366 states have (on average 1.281971219114852) internal successors, (9443), 7722 states have internal predecessors, (9443), 3906 states have call successors, (3906), 572 states have call predecessors, (3906), 569 states have return successors, (3949), 3753 states have call predecessors, (3949), 3903 states have call successors, (3949) [2022-11-02 20:42:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 17298 transitions. [2022-11-02 20:42:44,587 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 17298 transitions. Word has length 76 [2022-11-02 20:42:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:44,588 INFO L495 AbstractCegarLoop]: Abstraction has 11844 states and 17298 transitions. [2022-11-02 20:42:44,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:42:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 17298 transitions. [2022-11-02 20:42:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-02 20:42:44,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:44,594 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:44,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:42:44,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:42:44,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:44,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1005586591, now seen corresponding path program 1 times [2022-11-02 20:42:44,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:44,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124453563] [2022-11-02 20:42:44,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:44,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:42:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:42:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:42:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:42:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:42:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:42:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:45,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124453563] [2022-11-02 20:42:45,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124453563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:45,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:45,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:42:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510659057] [2022-11-02 20:42:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:45,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:42:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:42:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:42:45,340 INFO L87 Difference]: Start difference. First operand 11844 states and 17298 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:42:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:56,163 INFO L93 Difference]: Finished difference Result 24202 states and 35207 transitions. [2022-11-02 20:42:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:42:56,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 79 [2022-11-02 20:42:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:56,233 INFO L225 Difference]: With dead ends: 24202 [2022-11-02 20:42:56,233 INFO L226 Difference]: Without dead ends: 12371 [2022-11-02 20:42:56,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:42:56,282 INFO L413 NwaCegarLoop]: 3296 mSDtfsCounter, 6206 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 5433 mSolverCounterSat, 4769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6872 SdHoareTripleChecker+Valid, 5984 SdHoareTripleChecker+Invalid, 10202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4769 IncrementalHoareTripleChecker+Valid, 5433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:56,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6872 Valid, 5984 Invalid, 10202 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4769 Valid, 5433 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-11-02 20:42:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12371 states. [2022-11-02 20:42:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12371 to 11707. [2022-11-02 20:42:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11707 states, 7347 states have (on average 1.2709949639308562) internal successors, (9338), 7701 states have internal predecessors, (9338), 3722 states have call successors, (3722), 642 states have call predecessors, (3722), 635 states have return successors, (3742), 3572 states have call predecessors, (3742), 3719 states have call successors, (3742) [2022-11-02 20:42:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11707 states to 11707 states and 16802 transitions. [2022-11-02 20:42:57,169 INFO L78 Accepts]: Start accepts. Automaton has 11707 states and 16802 transitions. Word has length 79 [2022-11-02 20:42:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:57,169 INFO L495 AbstractCegarLoop]: Abstraction has 11707 states and 16802 transitions. [2022-11-02 20:42:57,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:42:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 11707 states and 16802 transitions. [2022-11-02 20:42:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 20:42:57,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:57,177 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-11-02 20:42:57,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:42:57,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:42:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash -39043552, now seen corresponding path program 1 times [2022-11-02 20:42:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:57,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436858924] [2022-11-02 20:42:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:42:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:42:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:42:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:42:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:42:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:42:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:42:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:42:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:42:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:42:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:42:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-02 20:42:57,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:57,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436858924] [2022-11-02 20:42:57,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436858924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:57,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:57,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083290840] [2022-11-02 20:42:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:57,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:42:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:57,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:57,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:57,425 INFO L87 Difference]: Start difference. First operand 11707 states and 16802 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 20:43:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:01,640 INFO L93 Difference]: Finished difference Result 23960 states and 34498 transitions. [2022-11-02 20:43:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:43:01,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2022-11-02 20:43:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:01,713 INFO L225 Difference]: With dead ends: 23960 [2022-11-02 20:43:01,713 INFO L226 Difference]: Without dead ends: 12307 [2022-11-02 20:43:01,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:01,759 INFO L413 NwaCegarLoop]: 2205 mSDtfsCounter, 727 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 4034 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:01,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 4034 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 20:43:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12307 states. [2022-11-02 20:43:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12307 to 11707. [2022-11-02 20:43:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11707 states, 7347 states have (on average 1.2693616442085205) internal successors, (9326), 7701 states have internal predecessors, (9326), 3722 states have call successors, (3722), 642 states have call predecessors, (3722), 635 states have return successors, (3742), 3572 states have call predecessors, (3742), 3719 states have call successors, (3742) [2022-11-02 20:43:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11707 states to 11707 states and 16790 transitions. [2022-11-02 20:43:02,739 INFO L78 Accepts]: Start accepts. Automaton has 11707 states and 16790 transitions. Word has length 107 [2022-11-02 20:43:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:02,740 INFO L495 AbstractCegarLoop]: Abstraction has 11707 states and 16790 transitions. [2022-11-02 20:43:02,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 20:43:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 11707 states and 16790 transitions. [2022-11-02 20:43:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-02 20:43:02,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:02,743 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:43:02,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:43:02,743 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:43:02,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash 54654507, now seen corresponding path program 1 times [2022-11-02 20:43:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:02,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652363928] [2022-11-02 20:43:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:43:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:43:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:43:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:43:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:43:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:02,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:43:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:43:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-02 20:43:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:03,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652363928] [2022-11-02 20:43:03,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652363928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:03,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:03,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:43:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462407672] [2022-11-02 20:43:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:03,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:43:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:43:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:43:03,012 INFO L87 Difference]: Start difference. First operand 11707 states and 16790 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-02 20:43:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:09,798 INFO L93 Difference]: Finished difference Result 35664 states and 51437 transitions. [2022-11-02 20:43:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:43:09,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2022-11-02 20:43:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:09,962 INFO L225 Difference]: With dead ends: 35664 [2022-11-02 20:43:09,962 INFO L226 Difference]: Without dead ends: 24011 [2022-11-02 20:43:10,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:10,029 INFO L413 NwaCegarLoop]: 2601 mSDtfsCounter, 3072 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 2109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3609 SdHoareTripleChecker+Valid, 4549 SdHoareTripleChecker+Invalid, 4707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2109 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:10,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3609 Valid, 4549 Invalid, 4707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2109 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-02 20:43:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24011 states. [2022-11-02 20:43:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24011 to 22789. [2022-11-02 20:43:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22789 states, 14272 states have (on average 1.2720011210762332) internal successors, (18154), 14946 states have internal predecessors, (18154), 7281 states have call successors, (7281), 1246 states have call predecessors, (7281), 1233 states have return successors, (7324), 7014 states have call predecessors, (7324), 7278 states have call successors, (7324) [2022-11-02 20:43:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22789 states to 22789 states and 32759 transitions. [2022-11-02 20:43:11,897 INFO L78 Accepts]: Start accepts. Automaton has 22789 states and 32759 transitions. Word has length 123 [2022-11-02 20:43:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:11,899 INFO L495 AbstractCegarLoop]: Abstraction has 22789 states and 32759 transitions. [2022-11-02 20:43:11,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-02 20:43:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22789 states and 32759 transitions. [2022-11-02 20:43:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-02 20:43:11,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:11,902 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:43:11,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:43:11,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:43:11,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash 477356333, now seen corresponding path program 1 times [2022-11-02 20:43:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:11,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105292679] [2022-11-02 20:43:11,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:43:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:43:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:43:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:43:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:43:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:43:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:43:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-02 20:43:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:12,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105292679] [2022-11-02 20:43:12,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105292679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:12,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:12,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093373733] [2022-11-02 20:43:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:12,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:12,423 INFO L87 Difference]: Start difference. First operand 22789 states and 32759 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 20:43:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:18,966 INFO L93 Difference]: Finished difference Result 23995 states and 34672 transitions. [2022-11-02 20:43:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:18,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2022-11-02 20:43:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:19,100 INFO L225 Difference]: With dead ends: 23995 [2022-11-02 20:43:19,100 INFO L226 Difference]: Without dead ends: 23993 [2022-11-02 20:43:19,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:19,114 INFO L413 NwaCegarLoop]: 2199 mSDtfsCounter, 2404 mSDsluCounter, 2968 mSDsCounter, 0 mSdLazyCounter, 3464 mSolverCounterSat, 1580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2617 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 5044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1580 IncrementalHoareTripleChecker+Valid, 3464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:19,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2617 Valid, 5167 Invalid, 5044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1580 Valid, 3464 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-02 20:43:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23993 states. [2022-11-02 20:43:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23993 to 22793. [2022-11-02 20:43:21,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22793 states, 14275 states have (on average 1.2719439579684764) internal successors, (18157), 14949 states have internal predecessors, (18157), 7281 states have call successors, (7281), 1247 states have call predecessors, (7281), 1234 states have return successors, (7324), 7014 states have call predecessors, (7324), 7278 states have call successors, (7324) [2022-11-02 20:43:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22793 states to 22793 states and 32762 transitions. [2022-11-02 20:43:21,180 INFO L78 Accepts]: Start accepts. Automaton has 22793 states and 32762 transitions. Word has length 123 [2022-11-02 20:43:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:21,181 INFO L495 AbstractCegarLoop]: Abstraction has 22793 states and 32762 transitions. [2022-11-02 20:43:21,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 20:43:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 22793 states and 32762 transitions. [2022-11-02 20:43:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 20:43:21,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:21,184 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 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] [2022-11-02 20:43:21,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:43:21,185 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:43:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1319786659, now seen corresponding path program 1 times [2022-11-02 20:43:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:21,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616375841] [2022-11-02 20:43:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:43:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:43:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:43:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:43:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:43:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:43:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:43:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:43:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-02 20:43:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616375841] [2022-11-02 20:43:21,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616375841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:21,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:21,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:21,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234409826] [2022-11-02 20:43:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:21,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:21,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:21,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:21,692 INFO L87 Difference]: Start difference. First operand 22793 states and 32762 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 20:43:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:28,227 INFO L93 Difference]: Finished difference Result 23999 states and 34675 transitions. [2022-11-02 20:43:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:28,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2022-11-02 20:43:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:28,368 INFO L225 Difference]: With dead ends: 23999 [2022-11-02 20:43:28,369 INFO L226 Difference]: Without dead ends: 23997 [2022-11-02 20:43:28,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:28,384 INFO L413 NwaCegarLoop]: 2198 mSDtfsCounter, 2399 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 3464 mSolverCounterSat, 1581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 5158 SdHoareTripleChecker+Invalid, 5045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1581 IncrementalHoareTripleChecker+Valid, 3464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:28,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 5158 Invalid, 5045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1581 Valid, 3464 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-02 20:43:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23997 states. [2022-11-02 20:43:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23997 to 22797. [2022-11-02 20:43:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22797 states, 14278 states have (on average 1.2718868188821963) internal successors, (18160), 14952 states have internal predecessors, (18160), 7281 states have call successors, (7281), 1248 states have call predecessors, (7281), 1235 states have return successors, (7324), 7014 states have call predecessors, (7324), 7278 states have call successors, (7324) [2022-11-02 20:43:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22797 states to 22797 states and 32765 transitions. [2022-11-02 20:43:30,127 INFO L78 Accepts]: Start accepts. Automaton has 22797 states and 32765 transitions. Word has length 128 [2022-11-02 20:43:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:30,128 INFO L495 AbstractCegarLoop]: Abstraction has 22797 states and 32765 transitions. [2022-11-02 20:43:30,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 20:43:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 22797 states and 32765 transitions. [2022-11-02 20:43:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 20:43:30,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:30,133 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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-02 20:43:30,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:43:30,133 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:43:30,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 849696493, now seen corresponding path program 1 times [2022-11-02 20:43:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:30,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516991998] [2022-11-02 20:43:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:43:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:43:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:43:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:43:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:43:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:43:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:43:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:43:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:43:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-02 20:43:30,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:30,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516991998] [2022-11-02 20:43:30,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516991998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:30,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:30,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935335386] [2022-11-02 20:43:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:30,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:30,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:30,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:30,830 INFO L87 Difference]: Start difference. First operand 22797 states and 32765 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:43:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:37,599 INFO L93 Difference]: Finished difference Result 24003 states and 34678 transitions. [2022-11-02 20:43:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:37,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2022-11-02 20:43:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:37,697 INFO L225 Difference]: With dead ends: 24003 [2022-11-02 20:43:37,698 INFO L226 Difference]: Without dead ends: 24001 [2022-11-02 20:43:37,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:37,711 INFO L413 NwaCegarLoop]: 2195 mSDtfsCounter, 2400 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 3464 mSolverCounterSat, 1582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2614 SdHoareTripleChecker+Valid, 5148 SdHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1582 IncrementalHoareTripleChecker+Valid, 3464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:37,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2614 Valid, 5148 Invalid, 5046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1582 Valid, 3464 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-02 20:43:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24001 states. [2022-11-02 20:43:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24001 to 22801. [2022-11-02 20:43:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22801 states, 14281 states have (on average 1.2718297038022548) internal successors, (18163), 14955 states have internal predecessors, (18163), 7281 states have call successors, (7281), 1249 states have call predecessors, (7281), 1236 states have return successors, (7324), 7014 states have call predecessors, (7324), 7278 states have call successors, (7324) [2022-11-02 20:43:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22801 states to 22801 states and 32768 transitions. [2022-11-02 20:43:39,526 INFO L78 Accepts]: Start accepts. Automaton has 22801 states and 32768 transitions. Word has length 133 [2022-11-02 20:43:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:39,527 INFO L495 AbstractCegarLoop]: Abstraction has 22801 states and 32768 transitions. [2022-11-02 20:43:39,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:43:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 22801 states and 32768 transitions. [2022-11-02 20:43:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-02 20:43:39,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:39,537 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-11-02 20:43:39,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:43:39,538 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:43:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1063126755, now seen corresponding path program 1 times [2022-11-02 20:43:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902410871] [2022-11-02 20:43:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:43:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:43:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:43:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:43:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:43:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:43:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:43:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:43:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:43:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:43:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-02 20:43:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:40,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902410871] [2022-11-02 20:43:40,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902410871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:40,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:40,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414585861] [2022-11-02 20:43:40,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:40,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:40,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:40,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:40,027 INFO L87 Difference]: Start difference. First operand 22801 states and 32768 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:43:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:46,389 INFO L93 Difference]: Finished difference Result 24007 states and 34681 transitions. [2022-11-02 20:43:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2022-11-02 20:43:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:46,496 INFO L225 Difference]: With dead ends: 24007 [2022-11-02 20:43:46,496 INFO L226 Difference]: Without dead ends: 24005 [2022-11-02 20:43:46,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:46,513 INFO L413 NwaCegarLoop]: 2203 mSDtfsCounter, 2396 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 3464 mSolverCounterSat, 1577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2608 SdHoareTripleChecker+Valid, 5174 SdHoareTripleChecker+Invalid, 5041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1577 IncrementalHoareTripleChecker+Valid, 3464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:46,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2608 Valid, 5174 Invalid, 5041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1577 Valid, 3464 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-02 20:43:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24005 states. [2022-11-02 20:43:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24005 to 22805. [2022-11-02 20:43:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22805 states, 14284 states have (on average 1.2717726127135256) internal successors, (18166), 14958 states have internal predecessors, (18166), 7281 states have call successors, (7281), 1250 states have call predecessors, (7281), 1237 states have return successors, (7324), 7014 states have call predecessors, (7324), 7278 states have call successors, (7324) [2022-11-02 20:43:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22805 states to 22805 states and 32771 transitions. [2022-11-02 20:43:48,110 INFO L78 Accepts]: Start accepts. Automaton has 22805 states and 32771 transitions. Word has length 138 [2022-11-02 20:43:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:48,110 INFO L495 AbstractCegarLoop]: Abstraction has 22805 states and 32771 transitions. [2022-11-02 20:43:48,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:43:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 22805 states and 32771 transitions. [2022-11-02 20:43:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-02 20:43:48,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:48,119 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:43:48,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:43:48,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:43:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1396722861, now seen corresponding path program 1 times [2022-11-02 20:43:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:48,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974310036] [2022-11-02 20:43:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:43:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:43:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:43:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:43:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:43:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:43:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:43:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:43:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:43:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:43:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 20:43:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-02 20:43:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:48,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974310036] [2022-11-02 20:43:48,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974310036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:48,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:48,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:48,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451523048] [2022-11-02 20:43:48,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:48,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:48,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:48,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:48,574 INFO L87 Difference]: Start difference. First operand 22805 states and 32771 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:43:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:55,649 INFO L93 Difference]: Finished difference Result 24011 states and 34684 transitions. [2022-11-02 20:43:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2022-11-02 20:43:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:43:55,722 INFO L225 Difference]: With dead ends: 24011 [2022-11-02 20:43:55,722 INFO L226 Difference]: Without dead ends: 24009 [2022-11-02 20:43:55,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:55,732 INFO L413 NwaCegarLoop]: 2197 mSDtfsCounter, 2400 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 3464 mSolverCounterSat, 1580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2612 SdHoareTripleChecker+Valid, 5156 SdHoareTripleChecker+Invalid, 5044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1580 IncrementalHoareTripleChecker+Valid, 3464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:43:55,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2612 Valid, 5156 Invalid, 5044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1580 Valid, 3464 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-02 20:43:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24009 states. [2022-11-02 20:43:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24009 to 22809. [2022-11-02 20:43:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22809 states, 14287 states have (on average 1.271715545600896) internal successors, (18169), 14961 states have internal predecessors, (18169), 7281 states have call successors, (7281), 1251 states have call predecessors, (7281), 1238 states have return successors, (7324), 7014 states have call predecessors, (7324), 7278 states have call successors, (7324) [2022-11-02 20:43:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22809 states to 22809 states and 32774 transitions. [2022-11-02 20:43:57,259 INFO L78 Accepts]: Start accepts. Automaton has 22809 states and 32774 transitions. Word has length 143 [2022-11-02 20:43:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:43:57,260 INFO L495 AbstractCegarLoop]: Abstraction has 22809 states and 32774 transitions. [2022-11-02 20:43:57,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:43:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 22809 states and 32774 transitions. [2022-11-02 20:43:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-02 20:43:57,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:43:57,264 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-02 20:43:57,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:43:57,264 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:43:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1265945309, now seen corresponding path program 1 times [2022-11-02 20:43:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:57,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446178700] [2022-11-02 20:43:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:43:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:43:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:43:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:43:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:43:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:43:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:43:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:43:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:43:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:43:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:43:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:43:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:43:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:43:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:43:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:43:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 20:43:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-02 20:43:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-02 20:43:57,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:57,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446178700] [2022-11-02 20:43:57,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446178700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:57,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:57,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:57,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994476032] [2022-11-02 20:43:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:57,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:43:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:57,729 INFO L87 Difference]: Start difference. First operand 22809 states and 32774 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:44:04,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:44:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:06,761 INFO L93 Difference]: Finished difference Result 24015 states and 34687 transitions. [2022-11-02 20:44:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:44:06,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2022-11-02 20:44:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:06,849 INFO L225 Difference]: With dead ends: 24015 [2022-11-02 20:44:06,849 INFO L226 Difference]: Without dead ends: 24013 [2022-11-02 20:44:06,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:06,860 INFO L413 NwaCegarLoop]: 2196 mSDtfsCounter, 2400 mSDsluCounter, 2956 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 1579 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 5152 SdHoareTripleChecker+Invalid, 5043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1579 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:06,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2613 Valid, 5152 Invalid, 5043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1579 Valid, 3463 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-11-02 20:44:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24013 states. [2022-11-02 20:44:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24013 to 22813. [2022-11-02 20:44:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22813 states, 14290 states have (on average 1.2716585024492653) internal successors, (18172), 14964 states have internal predecessors, (18172), 7281 states have call successors, (7281), 1252 states have call predecessors, (7281), 1239 states have return successors, (7324), 7014 states have call predecessors, (7324), 7278 states have call successors, (7324) [2022-11-02 20:44:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22813 states to 22813 states and 32777 transitions. [2022-11-02 20:44:08,744 INFO L78 Accepts]: Start accepts. Automaton has 22813 states and 32777 transitions. Word has length 148 [2022-11-02 20:44:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:08,745 INFO L495 AbstractCegarLoop]: Abstraction has 22813 states and 32777 transitions. [2022-11-02 20:44:08,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:44:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 22813 states and 32777 transitions. [2022-11-02 20:44:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-02 20:44:08,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:08,748 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-02 20:44:08,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:44:08,749 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:44:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1469791635, now seen corresponding path program 1 times [2022-11-02 20:44:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:08,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928217782] [2022-11-02 20:44:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:44:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:44:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:44:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:44:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:44:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:44:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:44:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:44:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:44:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:44:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:44:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:44:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:44:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:44:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:44:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 20:44:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-02 20:44:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:44:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-02 20:44:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:09,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928217782] [2022-11-02 20:44:09,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928217782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:09,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:09,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864137364] [2022-11-02 20:44:09,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:09,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:09,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:09,226 INFO L87 Difference]: Start difference. First operand 22813 states and 32777 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:44:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:18,757 INFO L93 Difference]: Finished difference Result 28861 states and 41640 transitions. [2022-11-02 20:44:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:44:18,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2022-11-02 20:44:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:18,850 INFO L225 Difference]: With dead ends: 28861 [2022-11-02 20:44:18,851 INFO L226 Difference]: Without dead ends: 28859 [2022-11-02 20:44:18,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:18,862 INFO L413 NwaCegarLoop]: 2234 mSDtfsCounter, 2165 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 4336 mSolverCounterSat, 1513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 5574 SdHoareTripleChecker+Invalid, 5849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1513 IncrementalHoareTripleChecker+Valid, 4336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:18,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 5574 Invalid, 5849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1513 Valid, 4336 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-11-02 20:44:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28859 states. [2022-11-02 20:44:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28859 to 27643. [2022-11-02 20:44:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27643 states, 17255 states have (on average 1.277600695450594) internal successors, (22045), 18069 states have internal predecessors, (22045), 8817 states have call successors, (8817), 1581 states have call predecessors, (8817), 1568 states have return successors, (8860), 8530 states have call predecessors, (8860), 8814 states have call successors, (8860) [2022-11-02 20:44:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27643 states to 27643 states and 39722 transitions. [2022-11-02 20:44:20,640 INFO L78 Accepts]: Start accepts. Automaton has 27643 states and 39722 transitions. Word has length 153 [2022-11-02 20:44:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:20,641 INFO L495 AbstractCegarLoop]: Abstraction has 27643 states and 39722 transitions. [2022-11-02 20:44:20,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:44:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 27643 states and 39722 transitions. [2022-11-02 20:44:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-02 20:44:20,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:20,645 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:44:20,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:44:20,646 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:44:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash -158533390, now seen corresponding path program 1 times [2022-11-02 20:44:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:20,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877332439] [2022-11-02 20:44:20,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:44:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:44:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:44:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:44:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:44:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:44:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:44:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:44:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:44:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:44:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:44:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-02 20:44:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:44:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:44:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:44:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:44:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:44:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:44:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:44:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-02 20:44:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:44:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2022-11-02 20:44:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:21,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877332439] [2022-11-02 20:44:21,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877332439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:21,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:21,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168563817] [2022-11-02 20:44:21,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:21,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:21,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:21,364 INFO L87 Difference]: Start difference. First operand 27643 states and 39722 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:44:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:29,782 INFO L93 Difference]: Finished difference Result 28865 states and 41643 transitions. [2022-11-02 20:44:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:44:29,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 176 [2022-11-02 20:44:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:29,874 INFO L225 Difference]: With dead ends: 28865 [2022-11-02 20:44:29,874 INFO L226 Difference]: Without dead ends: 28863 [2022-11-02 20:44:29,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:29,886 INFO L413 NwaCegarLoop]: 2199 mSDtfsCounter, 2390 mSDsluCounter, 2963 mSDsCounter, 0 mSdLazyCounter, 3464 mSolverCounterSat, 1575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2600 SdHoareTripleChecker+Valid, 5162 SdHoareTripleChecker+Invalid, 5039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1575 IncrementalHoareTripleChecker+Valid, 3464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:29,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2600 Valid, 5162 Invalid, 5039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1575 Valid, 3464 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-02 20:44:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28863 states. [2022-11-02 20:44:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28863 to 27647. [2022-11-02 20:44:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27647 states, 17258 states have (on average 1.2775524394483717) internal successors, (22048), 18072 states have internal predecessors, (22048), 8817 states have call successors, (8817), 1582 states have call predecessors, (8817), 1569 states have return successors, (8860), 8530 states have call predecessors, (8860), 8814 states have call successors, (8860) [2022-11-02 20:44:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27647 states to 27647 states and 39725 transitions. [2022-11-02 20:44:31,823 INFO L78 Accepts]: Start accepts. Automaton has 27647 states and 39725 transitions. Word has length 176 [2022-11-02 20:44:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:31,824 INFO L495 AbstractCegarLoop]: Abstraction has 27647 states and 39725 transitions. [2022-11-02 20:44:31,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:44:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27647 states and 39725 transitions. [2022-11-02 20:44:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-02 20:44:31,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:31,827 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:44:31,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:44:31,828 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:44:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:31,828 INFO L85 PathProgramCache]: Analyzing trace with hash 875739181, now seen corresponding path program 1 times [2022-11-02 20:44:31,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:31,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47142982] [2022-11-02 20:44:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:31,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:44:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:44:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:44:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:44:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:44:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:44:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:44:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:44:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:44:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:44:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:44:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:44:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:44:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:44:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:44:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 20:44:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-02 20:44:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:44:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 20:44:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:44:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2022-11-02 20:44:32,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:32,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47142982] [2022-11-02 20:44:32,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47142982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:32,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:32,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:32,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406069763] [2022-11-02 20:44:32,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:32,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:32,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:32,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:32,350 INFO L87 Difference]: Start difference. First operand 27647 states and 39725 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:44:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:40,615 INFO L93 Difference]: Finished difference Result 28869 states and 41646 transitions. [2022-11-02 20:44:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:44:40,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2022-11-02 20:44:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:40,697 INFO L225 Difference]: With dead ends: 28869 [2022-11-02 20:44:40,697 INFO L226 Difference]: Without dead ends: 28867 [2022-11-02 20:44:40,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:40,706 INFO L413 NwaCegarLoop]: 2185 mSDtfsCounter, 2409 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 1583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2622 SdHoareTripleChecker+Valid, 5119 SdHoareTripleChecker+Invalid, 5038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1583 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:40,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2622 Valid, 5119 Invalid, 5038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1583 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-02 20:44:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28867 states. [2022-11-02 20:44:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28867 to 27651. [2022-11-02 20:44:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27651 states, 17261 states have (on average 1.2775042002201495) internal successors, (22051), 18075 states have internal predecessors, (22051), 8817 states have call successors, (8817), 1583 states have call predecessors, (8817), 1570 states have return successors, (8860), 8530 states have call predecessors, (8860), 8814 states have call successors, (8860) [2022-11-02 20:44:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27651 states to 27651 states and 39728 transitions. [2022-11-02 20:44:42,900 INFO L78 Accepts]: Start accepts. Automaton has 27651 states and 39728 transitions. Word has length 163 [2022-11-02 20:44:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:42,900 INFO L495 AbstractCegarLoop]: Abstraction has 27651 states and 39728 transitions. [2022-11-02 20:44:42,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:44:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27651 states and 39728 transitions. [2022-11-02 20:44:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-02 20:44:42,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:42,905 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:44:42,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:44:42,905 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:44:42,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:42,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1557270947, now seen corresponding path program 1 times [2022-11-02 20:44:42,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:42,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089547711] [2022-11-02 20:44:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:42,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:44:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:44:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:44:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:44:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:44:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:44:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:44:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:44:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:44:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:44:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:44:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:44:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:44:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:44:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:44:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 20:44:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-02 20:44:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:44:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 20:44:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:44:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:44:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-11-02 20:44:43,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:43,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089547711] [2022-11-02 20:44:43,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089547711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:43,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:43,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610420583] [2022-11-02 20:44:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:43,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:43,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:43,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:43,440 INFO L87 Difference]: Start difference. First operand 27651 states and 39728 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:44:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:51,954 INFO L93 Difference]: Finished difference Result 28873 states and 41649 transitions. [2022-11-02 20:44:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:44:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 168 [2022-11-02 20:44:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:44:52,038 INFO L225 Difference]: With dead ends: 28873 [2022-11-02 20:44:52,039 INFO L226 Difference]: Without dead ends: 28871 [2022-11-02 20:44:52,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:44:52,052 INFO L413 NwaCegarLoop]: 2185 mSDtfsCounter, 2411 mSDsluCounter, 2936 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 1582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2622 SdHoareTripleChecker+Valid, 5121 SdHoareTripleChecker+Invalid, 5037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1582 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:44:52,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2622 Valid, 5121 Invalid, 5037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1582 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 20:44:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28871 states. [2022-11-02 20:44:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28871 to 27655. [2022-11-02 20:44:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27655 states, 17264 states have (on average 1.2774559777571826) internal successors, (22054), 18078 states have internal predecessors, (22054), 8817 states have call successors, (8817), 1584 states have call predecessors, (8817), 1571 states have return successors, (8860), 8530 states have call predecessors, (8860), 8814 states have call successors, (8860) [2022-11-02 20:44:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27655 states to 27655 states and 39731 transitions. [2022-11-02 20:44:54,626 INFO L78 Accepts]: Start accepts. Automaton has 27655 states and 39731 transitions. Word has length 168 [2022-11-02 20:44:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:44:54,626 INFO L495 AbstractCegarLoop]: Abstraction has 27655 states and 39731 transitions. [2022-11-02 20:44:54,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:44:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 27655 states and 39731 transitions. [2022-11-02 20:44:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-11-02 20:44:54,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:44:54,631 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:44:54,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:44:54,631 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:44:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1102676744, now seen corresponding path program 1 times [2022-11-02 20:44:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:54,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888902847] [2022-11-02 20:44:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:54,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:44:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:44:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:44:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:44:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:54,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:44:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:44:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:44:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:44:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:44:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:44:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:44:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:44:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-02 20:44:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:44:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:44:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:44:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:44:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:44:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:44:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:44:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-02 20:44:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:44:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-02 20:44:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 20:44:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:44:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-11-02 20:44:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:55,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888902847] [2022-11-02 20:44:55,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888902847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:55,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:55,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:44:55,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146592287] [2022-11-02 20:44:55,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:55,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:44:55,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:55,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:44:55,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:44:55,297 INFO L87 Difference]: Start difference. First operand 27655 states and 39731 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-02 20:45:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:03,503 INFO L93 Difference]: Finished difference Result 28877 states and 41652 transitions. [2022-11-02 20:45:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:45:03,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 191 [2022-11-02 20:45:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:03,583 INFO L225 Difference]: With dead ends: 28877 [2022-11-02 20:45:03,584 INFO L226 Difference]: Without dead ends: 28873 [2022-11-02 20:45:03,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:45:03,596 INFO L413 NwaCegarLoop]: 2183 mSDtfsCounter, 2402 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 1581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 5113 SdHoareTripleChecker+Invalid, 5036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1581 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:03,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2613 Valid, 5113 Invalid, 5036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1581 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-02 20:45:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28873 states. [2022-11-02 20:45:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28873 to 27657. [2022-11-02 20:45:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27657 states, 17266 states have (on average 1.2773659214641493) internal successors, (22055), 18079 states have internal predecessors, (22055), 8817 states have call successors, (8817), 1585 states have call predecessors, (8817), 1571 states have return successors, (8860), 8530 states have call predecessors, (8860), 8814 states have call successors, (8860) [2022-11-02 20:45:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27657 states to 27657 states and 39732 transitions. [2022-11-02 20:45:05,642 INFO L78 Accepts]: Start accepts. Automaton has 27657 states and 39732 transitions. Word has length 191 [2022-11-02 20:45:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:05,643 INFO L495 AbstractCegarLoop]: Abstraction has 27657 states and 39732 transitions. [2022-11-02 20:45:05,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-02 20:45:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 27657 states and 39732 transitions. [2022-11-02 20:45:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-02 20:45:05,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:05,647 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-11-02 20:45:05,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:45:05,648 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:45:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 602637191, now seen corresponding path program 1 times [2022-11-02 20:45:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:05,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012281963] [2022-11-02 20:45:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:05,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:45:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:45:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:45:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:45:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:45:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:45:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:45:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:45:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:45:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-02 20:45:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:45:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-02 20:45:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:45:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-11-02 20:45:05,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:05,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012281963] [2022-11-02 20:45:05,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012281963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:05,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:05,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:45:05,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677145294] [2022-11-02 20:45:05,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:05,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:45:05,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:05,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:45:05,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:45:05,936 INFO L87 Difference]: Start difference. First operand 27657 states and 39732 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-02 20:45:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:15,446 INFO L93 Difference]: Finished difference Result 62396 states and 89753 transitions. [2022-11-02 20:45:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:45:15,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 169 [2022-11-02 20:45:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:15,571 INFO L225 Difference]: With dead ends: 62396 [2022-11-02 20:45:15,571 INFO L226 Difference]: Without dead ends: 34793 [2022-11-02 20:45:15,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:45:15,633 INFO L413 NwaCegarLoop]: 3438 mSDtfsCounter, 1714 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 5587 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:15,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 5587 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 20:45:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34793 states. [2022-11-02 20:45:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34793 to 33149. [2022-11-02 20:45:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33149 states, 20754 states have (on average 1.27488676881565) internal successors, (26459), 21721 states have internal predecessors, (26459), 10465 states have call successors, (10465), 1941 states have call predecessors, (10465), 1927 states have return successors, (10508), 10130 states have call predecessors, (10508), 10462 states have call successors, (10508) [2022-11-02 20:45:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33149 states to 33149 states and 47432 transitions. [2022-11-02 20:45:18,187 INFO L78 Accepts]: Start accepts. Automaton has 33149 states and 47432 transitions. Word has length 169 [2022-11-02 20:45:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:18,188 INFO L495 AbstractCegarLoop]: Abstraction has 33149 states and 47432 transitions. [2022-11-02 20:45:18,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-02 20:45:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 33149 states and 47432 transitions. [2022-11-02 20:45:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-11-02 20:45:18,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:18,190 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:45:18,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:45:18,191 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:45:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1031184370, now seen corresponding path program 1 times [2022-11-02 20:45:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:18,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641110326] [2022-11-02 20:45:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:45:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:45:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:45:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:45:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:45:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:45:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:45:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:45:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:45:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-02 20:45:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:45:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:45:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:45:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:45:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:45:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:45:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:45:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-02 20:45:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:45:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-02 20:45:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 20:45:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:45:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:45:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-11-02 20:45:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:18,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641110326] [2022-11-02 20:45:18,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641110326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:18,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:18,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:45:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105637546] [2022-11-02 20:45:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:18,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:45:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:45:18,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:45:18,670 INFO L87 Difference]: Start difference. First operand 33149 states and 47432 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 20:45:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:27,895 INFO L93 Difference]: Finished difference Result 34723 states and 49904 transitions. [2022-11-02 20:45:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:45:27,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 196 [2022-11-02 20:45:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:28,038 INFO L225 Difference]: With dead ends: 34723 [2022-11-02 20:45:28,038 INFO L226 Difference]: Without dead ends: 34467 [2022-11-02 20:45:28,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:45:28,054 INFO L413 NwaCegarLoop]: 2186 mSDtfsCounter, 2392 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 3450 mSolverCounterSat, 1576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2603 SdHoareTripleChecker+Valid, 5128 SdHoareTripleChecker+Invalid, 5026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1576 IncrementalHoareTripleChecker+Valid, 3450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:28,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2603 Valid, 5128 Invalid, 5026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1576 Valid, 3450 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-02 20:45:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34467 states. [2022-11-02 20:45:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34467 to 32893. [2022-11-02 20:45:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32893 states, 20596 states have (on average 1.274179452320839) internal successors, (26243), 21531 states have internal predecessors, (26243), 10382 states have call successors, (10382), 1925 states have call predecessors, (10382), 1913 states have return successors, (10428), 10080 states have call predecessors, (10428), 10382 states have call successors, (10428) [2022-11-02 20:45:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32893 states to 32893 states and 47053 transitions. [2022-11-02 20:45:31,081 INFO L78 Accepts]: Start accepts. Automaton has 32893 states and 47053 transitions. Word has length 196 [2022-11-02 20:45:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:31,081 INFO L495 AbstractCegarLoop]: Abstraction has 32893 states and 47053 transitions. [2022-11-02 20:45:31,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 20:45:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 32893 states and 47053 transitions. [2022-11-02 20:45:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-11-02 20:45:31,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:31,085 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:31,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:45:31,086 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-02 20:45:31,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash 46698448, now seen corresponding path program 1 times [2022-11-02 20:45:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:31,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134343706] [2022-11-02 20:45:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:45:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:45:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:45:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:45:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:45:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:45:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:45:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:45:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:45:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:45:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-02 20:45:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:45:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:45:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-02 20:45:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:45:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:45:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-02 20:45:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-02 20:45:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-02 20:45:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:45:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-02 20:45:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-02 20:45:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2022-11-02 20:45:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:31,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134343706] [2022-11-02 20:45:31,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134343706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:31,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:31,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:45:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020023620] [2022-11-02 20:45:31,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:31,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:45:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:45:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:45:31,416 INFO L87 Difference]: Start difference. First operand 32893 states and 47053 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)