./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP --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 23f9845edcf139ee9434428d040789a6781b16714bf615b854712f008daec6fd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:56:24,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:56:24,800 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 21:56:24,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:56:24,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:56:24,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:56:24,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:56:24,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:56:24,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:56:24,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:56:24,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:56:24,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:56:24,866 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:56:24,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:56:24,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:56:24,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:56:24,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:56:24,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:56:24,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:56:24,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:56:24,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:56:24,873 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:56:24,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:56:24,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:56:24,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:56:24,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:56:24,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:56:24,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:56:24,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:56:24,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:56:24,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:56:24,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:56:24,891 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:56:24,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:56:24,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:56:24,892 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:56:24,893 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/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_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP 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 -> 23f9845edcf139ee9434428d040789a6781b16714bf615b854712f008daec6fd [2023-11-06 21:56:25,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:56:25,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:56:25,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:56:25,250 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:56:25,251 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:56:25,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i [2023-11-06 21:56:28,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:56:29,187 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:56:29,188 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i [2023-11-06 21:56:29,248 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/data/b4be58c01/6c07f9f5ef60422b8c1bbbebc722c1ad/FLAGe02584e1f [2023-11-06 21:56:29,265 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/data/b4be58c01/6c07f9f5ef60422b8c1bbbebc722c1ad [2023-11-06 21:56:29,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:56:29,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:56:29,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:56:29,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:56:29,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:56:29,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:56:29" (1/1) ... [2023-11-06 21:56:29,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bac9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:29, skipping insertion in model container [2023-11-06 21:56:29,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:56:29" (1/1) ... [2023-11-06 21:56:29,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:56:33,268 WARN L240 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_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i[338234,338247] [2023-11-06 21:56:33,273 WARN L240 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_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i[338403,338416] [2023-11-06 21:56:33,273 WARN L240 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_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i[338570,338583] [2023-11-06 21:56:33,274 WARN L240 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_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i[338738,338751] [2023-11-06 21:56:33,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:56:33,374 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:56:33,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5347] [2023-11-06 21:56:33,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5354] [2023-11-06 21:56:33,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [5361] [2023-11-06 21:56:33,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/debian/klever-work/native-scheduler-work-dir/scheduler/jobs/7cdfae59d3ac602223400f61d8829e28/klever-core-work-dir/520b8de/linux-kernel-locking-spinlock/lkbce/arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [5407-5408] [2023-11-06 21:56:33,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [5413-5415] [2023-11-06 21:56:33,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "m" (__preempt_count)); [5475] [2023-11-06 21:56:33,557 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "m" (__preempt_count)); [5478] [2023-11-06 21:56:33,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "m" (__preempt_count)); [5481] [2023-11-06 21:56:33,558 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "m" (__preempt_count)); [5484] [2023-11-06 21:56:33,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [5582] [2023-11-06 21:56:33,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [5590] [2023-11-06 21:56:33,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outw %w0, %w1": : "a" (value), "Nd" (port)); [5620] [2023-11-06 21:56:33,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inw %w1, %w0": "=a" (value): "Nd" (port)); [5628] [2023-11-06 21:56:33,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outl %0, %w1": : "a" (value), "Nd" (port)); [5635] [2023-11-06 21:56:33,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inl %w1, %0": "=a" (value): "Nd" (port)); [5643] [2023-11-06 21:56:33,572 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (19), "i" (12UL)); [5711-5712] [2023-11-06 21:56:33,575 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/asm-generic/dma-mapping-common.h"), "i" (36), "i" (12UL)); [5745-5746] [2023-11-06 21:56:33,870 WARN L240 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_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i[338234,338247] [2023-11-06 21:56:33,870 WARN L240 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_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i[338403,338416] [2023-11-06 21:56:33,871 WARN L240 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_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i[338570,338583] [2023-11-06 21:56:33,872 WARN L240 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_c74a6ffc-5aad-484f-a089-637926314817/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i[338738,338751] [2023-11-06 21:56:33,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:56:34,176 WARN L672 CHandler]: The function __request_region is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:56:34,176 WARN L672 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:56:34,184 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:56:34,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34 WrapperNode [2023-11-06 21:56:34,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:56:34,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:56:34,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:56:34,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:56:34,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,616 INFO L138 Inliner]: procedures = 431, calls = 2338, calls flagged for inlining = 196, calls inlined = 180, statements flattened = 6108 [2023-11-06 21:56:34,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:56:34,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:56:34,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:56:34,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:56:34,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:34,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:35,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:56:35,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:56:35,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:56:35,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:56:35,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (1/1) ... [2023-11-06 21:56:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:56:35,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:56:35,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:56:35,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c74a6ffc-5aad-484f-a089-637926314817/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:56:35,160 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_resume [2023-11-06 21:56:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_resume [2023-11-06 21:56:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2023-11-06 21:56:35,161 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2023-11-06 21:56:35,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-06 21:56:35,162 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-06 21:56:35,163 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2023-11-06 21:56:35,163 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2023-11-06 21:56:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_mii_write_reg [2023-11-06 21:56:35,166 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_mii_write_reg [2023-11-06 21:56:35,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-06 21:56:35,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-06 21:56:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_timer_instance_3 [2023-11-06 21:56:35,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_timer_instance_3 [2023-11-06 21:56:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_read8 [2023-11-06 21:56:35,168 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_read8 [2023-11-06 21:56:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-06 21:56:35,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-06 21:56:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2023-11-06 21:56:35,168 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2023-11-06 21:56:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_63 [2023-11-06 21:56:35,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_63 [2023-11-06 21:56:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_tlan_priv [2023-11-06 21:56:35,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_tlan_priv [2023-11-06 21:56:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_read_and_clear_stats [2023-11-06 21:56:35,169 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_read_and_clear_stats [2023-11-06 21:56:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_mii_sync [2023-11-06 21:56:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_mii_sync [2023-11-06 21:56:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2023-11-06 21:56:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2023-11-06 21:56:35,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-06 21:56:35,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-06 21:56:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2023-11-06 21:56:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2023-11-06 21:56:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-06 21:56:35,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-06 21:56:35,171 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2023-11-06 21:56:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2023-11-06 21:56:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:56:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2023-11-06 21:56:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2023-11-06 21:56:35,172 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2023-11-06 21:56:35,172 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2023-11-06 21:56:35,173 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_reset_lists [2023-11-06 21:56:35,173 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_reset_lists [2023-11-06 21:56:35,174 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_close [2023-11-06 21:56:35,175 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_close [2023-11-06 21:56:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_65 [2023-11-06 21:56:35,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_65 [2023-11-06 21:56:35,175 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2023-11-06 21:56:35,176 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2023-11-06 21:56:35,176 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_print [2023-11-06 21:56:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_print [2023-11-06 21:56:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2023-11-06 21:56:35,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2023-11-06 21:56:35,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_tlan_priv [2023-11-06 21:56:35,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_tlan_priv [2023-11-06 21:56:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pci_unregister_driver [2023-11-06 21:56:35,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pci_unregister_driver [2023-11-06 21:56:35,178 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_probe1 [2023-11-06 21:56:35,179 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_probe1 [2023-11-06 21:56:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-06 21:56:35,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-06 21:56:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:56:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2023-11-06 21:56:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2023-11-06 21:56:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2023-11-06 21:56:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2023-11-06 21:56:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2023-11-06 21:56:35,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2023-11-06 21:56:35,181 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2023-11-06 21:56:35,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2023-11-06 21:56:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_set_timer [2023-11-06 21:56:35,182 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_set_timer [2023-11-06 21:56:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_timer [2023-11-06 21:56:35,182 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_timer [2023-11-06 21:56:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_instance_callback_3_2 [2023-11-06 21:56:35,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_instance_callback_3_2 [2023-11-06 21:56:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_stop [2023-11-06 21:56:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_stop [2023-11-06 21:56:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2023-11-06 21:56:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2023-11-06 21:56:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2023-11-06 21:56:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2023-11-06 21:56:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_remove_one [2023-11-06 21:56:35,184 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_remove_one [2023-11-06 21:56:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_get_skb [2023-11-06 21:56:35,184 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_get_skb [2023-11-06 21:56:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_ee_send_byte [2023-11-06 21:56:35,185 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_ee_send_byte [2023-11-06 21:56:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2023-11-06 21:56:35,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2023-11-06 21:56:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:56:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2023-11-06 21:56:35,186 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2023-11-06 21:56:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_poll [2023-11-06 21:56:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_poll [2023-11-06 21:56:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2023-11-06 21:56:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2023-11-06 21:56:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:56:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-06 21:56:35,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-06 21:56:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2023-11-06 21:56:35,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2023-11-06 21:56:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:56:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2023-11-06 21:56:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-06 21:56:35,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-06 21:56:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_free_lists [2023-11-06 21:56:35,190 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_free_lists [2023-11-06 21:56:35,190 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2023-11-06 21:56:35,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2023-11-06 21:56:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-06 21:56:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2023-11-06 21:56:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2023-11-06 21:56:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2023-11-06 21:56:35,191 INFO L130 BoogieDeclarations]: Found specification of procedure outb_p [2023-11-06 21:56:35,191 INFO L138 BoogieDeclarations]: Found implementation of procedure outb_p [2023-11-06 21:56:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2023-11-06 21:56:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2023-11-06 21:56:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_store_skb [2023-11-06 21:56:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_store_skb [2023-11-06 21:56:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_tx_timeout [2023-11-06 21:56:35,194 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_tx_timeout [2023-11-06 21:56:35,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:56:35,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:56:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unregister_driver [2023-11-06 21:56:35,195 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unregister_driver [2023-11-06 21:56:35,195 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_power_up [2023-11-06 21:56:35,196 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_power_up [2023-11-06 21:56:35,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-06 21:56:35,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-06 21:56:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-06 21:56:35,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-06 21:56:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2023-11-06 21:56:35,202 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2023-11-06 21:56:35,203 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2023-11-06 21:56:35,204 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2023-11-06 21:56:35,204 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_handle_interrupt [2023-11-06 21:56:35,204 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_handle_interrupt [2023-11-06 21:56:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_start [2023-11-06 21:56:35,211 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_start [2023-11-06 21:56:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2023-11-06 21:56:35,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2023-11-06 21:56:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_finish_auto_neg [2023-11-06 21:56:35,211 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_finish_auto_neg [2023-11-06 21:56:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2023-11-06 21:56:35,212 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2023-11-06 21:56:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2023-11-06 21:56:35,212 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2023-11-06 21:56:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb_ip_align [2023-11-06 21:56:35,212 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb_ip_align [2023-11-06 21:56:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_start_link [2023-11-06 21:56:35,213 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_start_link [2023-11-06 21:56:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:56:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_set_multicast_list [2023-11-06 21:56:35,213 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_set_multicast_list [2023-11-06 21:56:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2023-11-06 21:56:35,213 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2023-11-06 21:56:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:56:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2023-11-06 21:56:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2023-11-06 21:56:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_instance_register_8_2 [2023-11-06 21:56:35,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_instance_register_8_2 [2023-11-06 21:56:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 21:56:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-06 21:56:35,215 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-06 21:56:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_print_list [2023-11-06 21:56:35,215 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_print_list [2023-11-06 21:56:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_write16 [2023-11-06 21:56:35,216 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_write16 [2023-11-06 21:56:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2023-11-06 21:56:35,216 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2023-11-06 21:56:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2023-11-06 21:56:35,216 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2023-11-06 21:56:35,216 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2023-11-06 21:56:35,217 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2023-11-06 21:56:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-06 21:56:35,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-06 21:56:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2023-11-06 21:56:35,217 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2023-11-06 21:56:35,217 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_finish_reset [2023-11-06 21:56:35,218 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_finish_reset [2023-11-06 21:56:35,218 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_write32 [2023-11-06 21:56:35,218 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_write32 [2023-11-06 21:56:35,218 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2023-11-06 21:56:35,218 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2023-11-06 21:56:35,218 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2023-11-06 21:56:35,219 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2023-11-06 21:56:35,219 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_set_mac [2023-11-06 21:56:35,219 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_set_mac [2023-11-06 21:56:35,219 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2023-11-06 21:56:35,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2023-11-06 21:56:35,219 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_ee_send_start [2023-11-06 21:56:35,219 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_ee_send_start [2023-11-06 21:56:35,220 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_read32 [2023-11-06 21:56:35,220 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_read32 [2023-11-06 21:56:35,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:56:35,220 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_write8 [2023-11-06 21:56:35,220 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_write8 [2023-11-06 21:56:35,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-06 21:56:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-06 21:56:35,221 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_power_down [2023-11-06 21:56:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_power_down [2023-11-06 21:56:35,221 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2023-11-06 21:56:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2023-11-06 21:56:35,221 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_reset_adapter [2023-11-06 21:56:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_reset_adapter [2023-11-06 21:56:35,222 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_mii_send_data [2023-11-06 21:56:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_mii_send_data [2023-11-06 21:56:35,222 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_reset [2023-11-06 21:56:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_reset [2023-11-06 21:56:35,222 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_mii_read_reg [2023-11-06 21:56:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_mii_read_reg [2023-11-06 21:56:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-06 21:56:35,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-06 21:56:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_open [2023-11-06 21:56:35,223 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_open [2023-11-06 21:56:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_power_state [2023-11-06 21:56:35,223 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_power_state [2023-11-06 21:56:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2023-11-06 21:56:35,224 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2023-11-06 21:56:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2023-11-06 21:56:35,224 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2023-11-06 21:56:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:56:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2023-11-06 21:56:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure inw [2023-11-06 21:56:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure inw [2023-11-06 21:56:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2023-11-06 21:56:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2023-11-06 21:56:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2023-11-06 21:56:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2023-11-06 21:56:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2023-11-06 21:56:35,225 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2023-11-06 21:56:36,271 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:56:36,281 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:56:37,954 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-06 21:56:42,254 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6942: assume 0 == (tlan_eisa_probe_~tmp___1~5#1.base + tlan_eisa_probe_~tmp___1~5#1.offset) % 18446744073709551616; [2023-11-06 21:56:42,254 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6942: assume !(0 == (tlan_eisa_probe_~tmp___1~5#1.base + tlan_eisa_probe_~tmp___1~5#1.offset) % 18446744073709551616); [2023-11-06 21:56:42,254 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L7042: assume tlan_eisa_probe_~ioaddr~0#1 <= 36863; [2023-11-06 21:56:42,254 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L7042: assume !(tlan_eisa_probe_~ioaddr~0#1 <= 36863); [2023-11-06 21:56:42,255 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976-2: SUMMARY for call tlan_eisa_probe_#t~ret365#1 := inb((if (3264 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3264 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3264 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2023-11-06 21:56:42,255 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976: assume 16 == ~debug~0; [2023-11-06 21:56:42,255 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976: assume !(16 == ~debug~0); [2023-11-06 21:56:42,255 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6978: SUMMARY for call tlan_eisa_probe_#t~ret364#1 := printk(46, 0); srcloc: null [2023-11-06 21:56:42,256 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6978-1: assume -2147483648 <= tlan_eisa_probe_#t~ret364#1 && tlan_eisa_probe_#t~ret364#1 <= 2147483647;havoc tlan_eisa_probe_#t~ret364#1; [2023-11-06 21:56:42,256 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947-1: tlan_eisa_probe_~tmp___2~2#1 := tlan_eisa_probe_#t~ret361#1;havoc tlan_eisa_probe_#t~ret361#1; [2023-11-06 21:56:42,256 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: SUMMARY for call tlan_eisa_probe_#t~ret361#1 := inw((if (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2023-11-06 21:56:42,256 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6949: assume 4366 != tlan_eisa_probe_~tmp___2~2#1 % 65536 % 4294967296; [2023-11-06 21:56:42,256 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6949: assume !(4366 != tlan_eisa_probe_~tmp___2~2#1 % 65536 % 4294967296); [2023-11-06 21:56:42,257 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6983: tlan_eisa_probe_~tmp___4~0#1 := tlan_eisa_probe_#t~ret365#1;havoc tlan_eisa_probe_#t~ret365#1; [2023-11-06 21:56:42,257 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint tlan_eisa_probe_case_32#1: tlan_eisa_probe_~irq~0#1 := 9; [2023-11-06 21:56:42,257 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6951: SUMMARY for call __release_region(~#ioport_resource~0.base, ~#ioport_resource~0.offset, tlan_eisa_probe_~ioaddr~0#1, 16); srcloc: null [2023-11-06 21:56:42,257 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6918-3: assume 0 != tlan_eisa_probe_#t~nondet352#1;havoc tlan_eisa_probe_#t~nondet352#1; [2023-11-06 21:56:42,258 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6918-3: assume !(0 != tlan_eisa_probe_#t~nondet352#1);havoc tlan_eisa_probe_#t~nondet352#1; [2023-11-06 21:56:42,258 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6918-1: assume 16 == ~debug~0;tlan_eisa_probe_#t~nondet352#1 := ~debug~0; [2023-11-06 21:56:42,258 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6918-1: assume !(16 == ~debug~0);assume ~debug~0 < 0 || tlan_eisa_probe_#t~nondet352#1 <= ~debug~0;assume tlan_eisa_probe_#t~nondet352#1 <= 16;assume tlan_eisa_probe_#t~nondet352#1 >= 0;assume ~debug~0 >= 0 || tlan_eisa_probe_#t~nondet352#1 > 16 + ~debug~0;assume tlan_eisa_probe_#t~nondet352#1 >= -2147483648; [2023-11-06 21:56:42,259 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6918-5: assume 0 == ~debug~0;tlan_eisa_probe_#t~nondet355#1 := 0; [2023-11-06 21:56:42,264 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6918-5: assume !(0 == ~debug~0); [2023-11-06 21:56:42,264 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: assume 16 == (if tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 <= 2147483647 then tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 else tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 - 4294967296); [2023-11-06 21:56:42,264 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: assume !(16 == (if tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 <= 2147483647 then tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 else tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:56:42,264 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6920-1: tlan_eisa_probe_~tmp~35#1 := tlan_eisa_probe_#t~ret353#1;havoc tlan_eisa_probe_#t~ret353#1; [2023-11-06 21:56:42,265 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6920: SUMMARY for call tlan_eisa_probe_#t~ret353#1 := inw((if (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2023-11-06 21:56:42,265 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6921-1: assume -2147483648 <= tlan_eisa_probe_#t~ret354#1 && tlan_eisa_probe_#t~ret354#1 <= 2147483647;havoc tlan_eisa_probe_#t~ret354#1; [2023-11-06 21:56:42,265 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6921: SUMMARY for call tlan_eisa_probe_#t~ret354#1 := printk(43, 0); srcloc: null [2023-11-06 21:56:42,265 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L7021: assume -2147483648 <= tlan_eisa_probe_#t~ret366#1 && tlan_eisa_probe_#t~ret366#1 <= 2147483647;tlan_eisa_probe_~rc~2#1 := tlan_eisa_probe_#t~ret366#1;havoc tlan_eisa_probe_#t~ret366#1; [2023-11-06 21:56:42,265 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint tlan_eisa_probe_case_64#1: tlan_eisa_probe_~irq~0#1 := 10; [2023-11-06 21:56:42,273 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6990: assume 32 == (if tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 <= 2147483647 then tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 else tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 - 4294967296); [2023-11-06 21:56:42,274 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6990: assume !(32 == (if tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 <= 2147483647 then tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 else tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:56:42,275 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6957-1: tlan_eisa_probe_~device_id~1#1 := tlan_eisa_probe_#t~ret362#1;havoc tlan_eisa_probe_#t~ret362#1; [2023-11-06 21:56:42,275 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6957: SUMMARY for call tlan_eisa_probe_#t~ret362#1 := inw((if (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2023-11-06 21:56:42,275 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925-3: assume 0 != tlan_eisa_probe_#t~nondet355#1;havoc tlan_eisa_probe_#t~nondet355#1; [2023-11-06 21:56:42,275 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925-3: assume !(0 != tlan_eisa_probe_#t~nondet355#1);havoc tlan_eisa_probe_#t~nondet355#1; [2023-11-06 21:56:42,276 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925-1: assume 16 == ~debug~0;tlan_eisa_probe_#t~nondet355#1 := ~debug~0; [2023-11-06 21:56:42,276 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925-1: assume !(16 == ~debug~0);assume ~debug~0 < 0 || tlan_eisa_probe_#t~nondet355#1 <= ~debug~0;assume tlan_eisa_probe_#t~nondet355#1 <= 16;assume tlan_eisa_probe_#t~nondet355#1 >= 0;assume ~debug~0 >= 0 || tlan_eisa_probe_#t~nondet355#1 > 16 + ~debug~0;assume tlan_eisa_probe_#t~nondet355#1 >= -2147483648; [2023-11-06 21:56:42,276 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925-5: assume 0 == ~debug~0;tlan_eisa_probe_#t~nondet358#1 := 0; [2023-11-06 21:56:42,276 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925-5: assume !(0 == ~debug~0); [2023-11-06 21:56:42,276 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6959: assume 8433 != tlan_eisa_probe_~device_id~1#1 % 65536 % 4294967296 && 16625 != tlan_eisa_probe_~device_id~1#1 % 65536 % 4294967296; [2023-11-06 21:56:42,277 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6959: assume !(8433 != tlan_eisa_probe_~device_id~1#1 % 65536 % 4294967296 && 16625 != tlan_eisa_probe_~device_id~1#1 % 65536 % 4294967296); [2023-11-06 21:56:42,277 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6927-1: tlan_eisa_probe_~tmp___0~12#1 := tlan_eisa_probe_#t~ret356#1;havoc tlan_eisa_probe_#t~ret356#1; [2023-11-06 21:56:42,277 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6927: SUMMARY for call tlan_eisa_probe_#t~ret356#1 := inw((if (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2023-11-06 21:56:42,277 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6994: assume 64 == (if tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 <= 2147483647 then tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 else tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 - 4294967296); [2023-11-06 21:56:42,278 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6994: assume !(64 == (if tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 <= 2147483647 then tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 else tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:56:42,278 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L7027-1: assume -2147483648 <= tlan_eisa_probe_#t~ret367#1 && tlan_eisa_probe_#t~ret367#1 <= 2147483647;havoc tlan_eisa_probe_#t~ret367#1; [2023-11-06 21:56:42,278 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L7027: SUMMARY for call tlan_eisa_probe_#t~ret367#1 := printk(47, 0); srcloc: null [2023-11-06 21:56:42,278 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928-1: assume -2147483648 <= tlan_eisa_probe_#t~ret357#1 && tlan_eisa_probe_#t~ret357#1 <= 2147483647;havoc tlan_eisa_probe_#t~ret357#1; [2023-11-06 21:56:42,278 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6928: SUMMARY for call tlan_eisa_probe_#t~ret357#1 := printk(44, 0); srcloc: null [2023-11-06 21:56:42,279 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6961: SUMMARY for call __release_region(~#ioport_resource~0.base, ~#ioport_resource~0.offset, tlan_eisa_probe_~ioaddr~0#1, 16); srcloc: null [2023-11-06 21:56:42,279 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume !(0 == ~debug~0); [2023-11-06 21:56:42,279 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume 0 == ~debug~0;tlan_eisa_probe_#t~nondet352#1 := 0; [2023-11-06 21:56:42,279 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint tlan_eisa_probe_case_16#1: tlan_eisa_probe_~irq~0#1 := 5; [2023-11-06 21:56:42,279 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6998: assume 128 == (if tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 <= 2147483647 then tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 else tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 - 4294967296); [2023-11-06 21:56:42,279 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6998: assume !(128 == (if tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 <= 2147483647 then tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 else tlan_eisa_probe_~tmp___4~0#1 % 256 % 4294967296 - 4294967296)); [2023-11-06 21:56:42,280 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6932-1: assume 16 == ~debug~0;tlan_eisa_probe_#t~nondet358#1 := ~debug~0; [2023-11-06 21:56:42,280 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6932-1: assume !(16 == ~debug~0);assume ~debug~0 < 0 || tlan_eisa_probe_#t~nondet358#1 <= ~debug~0;assume tlan_eisa_probe_#t~nondet358#1 <= 16;assume tlan_eisa_probe_#t~nondet358#1 >= 0;assume ~debug~0 >= 0 || tlan_eisa_probe_#t~nondet358#1 > 16 + ~debug~0;assume tlan_eisa_probe_#t~nondet358#1 >= -2147483648; [2023-11-06 21:56:42,280 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6932-5: call tlan_eisa_probe_#t~ret360#1.base, tlan_eisa_probe_#t~ret360#1.offset := __request_region(~#ioport_resource~0.base, ~#ioport_resource~0.offset, tlan_eisa_probe_~ioaddr~0#1, 16, ~#tlan_signature~0.base, ~#tlan_signature~0.offset, 0);tlan_eisa_probe_~tmp___1~5#1.base, tlan_eisa_probe_~tmp___1~5#1.offset := tlan_eisa_probe_#t~ret360#1.base, tlan_eisa_probe_#t~ret360#1.offset;havoc tlan_eisa_probe_#t~ret360#1.base, tlan_eisa_probe_#t~ret360#1.offset; [2023-11-06 21:56:42,280 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6932-3: assume 0 != tlan_eisa_probe_#t~nondet358#1;havoc tlan_eisa_probe_#t~nondet358#1; [2023-11-06 21:56:42,281 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6932-3: assume !(0 != tlan_eisa_probe_#t~nondet358#1);havoc tlan_eisa_probe_#t~nondet358#1; [2023-11-06 21:56:42,281 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint tlan_eisa_probe_case_128#1: tlan_eisa_probe_~irq~0#1 := 11; [2023-11-06 21:56:42,281 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6934: SUMMARY for call tlan_eisa_probe_#t~ret359#1 := printk(45, 0); srcloc: null [2023-11-06 21:56:42,281 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6967-1: tlan_eisa_probe_~tmp___3~1#1 := tlan_eisa_probe_#t~ret363#1;havoc tlan_eisa_probe_#t~ret363#1; [2023-11-06 21:56:42,283 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6967: SUMMARY for call tlan_eisa_probe_#t~ret363#1 := inb((if (3204 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3204 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3204 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2023-11-06 21:56:42,283 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L7033-1: tlan_eisa_probe_~ioaddr~0#1 := 4096 + tlan_eisa_probe_~ioaddr~0#1; [2023-11-06 21:56:42,283 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6934-1: assume -2147483648 <= tlan_eisa_probe_#t~ret359#1 && tlan_eisa_probe_#t~ret359#1 <= 2147483647;havoc tlan_eisa_probe_#t~ret359#1; [2023-11-06 21:56:42,284 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L7035-1: assume -2147483648 <= tlan_eisa_probe_#t~ret368#1 && tlan_eisa_probe_#t~ret368#1 <= 2147483647;havoc tlan_eisa_probe_#t~ret368#1; [2023-11-06 21:56:42,284 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L7035: SUMMARY for call tlan_eisa_probe_#t~ret368#1 := printk(48, 0); srcloc: null [2023-11-06 21:56:42,284 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6969: assume 1 != tlan_eisa_probe_~tmp___3~1#1 % 256 % 4294967296; [2023-11-06 21:56:42,284 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6969: assume !(1 != tlan_eisa_probe_~tmp___3~1#1 % 256 % 4294967296); [2023-11-06 21:56:42,284 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume !(16 == ~debug~0); [2023-11-06 21:56:42,285 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume 16 == ~debug~0; [2023-11-06 21:56:42,285 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##116: assume !(16 == ~debug~0); [2023-11-06 21:56:42,285 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##116: assume 16 == ~debug~0; [2023-11-06 21:56:42,285 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint L6971: SUMMARY for call __release_region(~#ioport_resource~0.base, ~#ioport_resource~0.offset, tlan_eisa_probe_~ioaddr~0#1, 16); srcloc: null [2023-11-06 21:56:42,285 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint tlan_eisa_probe_ldv_43702#1: SUMMARY for call tlan_eisa_probe_#t~ret366#1 := tlan_probe1(0, 0, tlan_eisa_probe_~ioaddr~0#1, tlan_eisa_probe_~irq~0#1, 12, 0, 0); srcloc: null [2023-11-06 21:56:42,562 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:56:42,601 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:56:42,602 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:56:42,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:56:42 BoogieIcfgContainer [2023-11-06 21:56:42,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:56:42,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:56:42,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:56:42,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:56:42,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:56:29" (1/3) ... [2023-11-06 21:56:42,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67401948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:56:42, skipping insertion in model container [2023-11-06 21:56:42,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:34" (2/3) ... [2023-11-06 21:56:42,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67401948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:56:42, skipping insertion in model container [2023-11-06 21:56:42,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:56:42" (3/3) ... [2023-11-06 21:56:42,624 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-ti-tlan.cil.i [2023-11-06 21:56:42,649 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:56:42,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-06 21:56:42,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:56:42,844 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;@38db198e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:56:42,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-06 21:56:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 2550 states, 1765 states have (on average 1.368271954674221) internal successors, (2415), 1816 states have internal predecessors, (2415), 672 states have call successors, (672), 110 states have call predecessors, (672), 109 states have return successors, (668), 653 states have call predecessors, (668), 668 states have call successors, (668) [2023-11-06 21:56:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 21:56:42,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:42,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:42,878 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)] === [2023-11-06 21:56:42,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2098269461, now seen corresponding path program 1 times [2023-11-06 21:56:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:42,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916932360] [2023-11-06 21:56:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 21:56:44,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:44,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916932360] [2023-11-06 21:56:44,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916932360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:44,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:44,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537174623] [2023-11-06 21:56:44,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:44,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:44,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:44,405 INFO L87 Difference]: Start difference. First operand has 2550 states, 1765 states have (on average 1.368271954674221) internal successors, (2415), 1816 states have internal predecessors, (2415), 672 states have call successors, (672), 110 states have call predecessors, (672), 109 states have return successors, (668), 653 states have call predecessors, (668), 668 states have call successors, (668) Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 21:56:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:44,946 INFO L93 Difference]: Finished difference Result 5065 states and 7640 transitions. [2023-11-06 21:56:44,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:44,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2023-11-06 21:56:44,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:44,988 INFO L225 Difference]: With dead ends: 5065 [2023-11-06 21:56:44,988 INFO L226 Difference]: Without dead ends: 2539 [2023-11-06 21:56:45,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:45,030 INFO L413 NwaCegarLoop]: 3691 mSDtfsCounter, 3661 mSDsluCounter, 7368 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3673 SdHoareTripleChecker+Valid, 11059 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:45,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3673 Valid, 11059 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2023-11-06 21:56:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2539. [2023-11-06 21:56:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 1759 states have (on average 1.336554860716316) internal successors, (2351), 1809 states have internal predecessors, (2351), 668 states have call successors, (668), 110 states have call predecessors, (668), 109 states have return successors, (665), 650 states have call predecessors, (665), 665 states have call successors, (665) [2023-11-06 21:56:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3684 transitions. [2023-11-06 21:56:45,435 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3684 transitions. Word has length 63 [2023-11-06 21:56:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:45,436 INFO L495 AbstractCegarLoop]: Abstraction has 2539 states and 3684 transitions. [2023-11-06 21:56:45,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 21:56:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3684 transitions. [2023-11-06 21:56:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 21:56:45,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:45,442 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-06 21:56:45,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:56:45,442 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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)] === [2023-11-06 21:56:45,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1080949030, now seen corresponding path program 1 times [2023-11-06 21:56:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:45,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041187418] [2023-11-06 21:56:45,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:45,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:56:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 21:56:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:46,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041187418] [2023-11-06 21:56:46,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041187418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:46,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434646484] [2023-11-06 21:56:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:46,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:46,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:46,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:46,199 INFO L87 Difference]: Start difference. First operand 2539 states and 3684 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 21:56:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:46,591 INFO L93 Difference]: Finished difference Result 2545 states and 3689 transitions. [2023-11-06 21:56:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-06 21:56:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:46,613 INFO L225 Difference]: With dead ends: 2545 [2023-11-06 21:56:46,613 INFO L226 Difference]: Without dead ends: 2543 [2023-11-06 21:56:46,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:46,617 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3644 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3654 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:46,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3654 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2023-11-06 21:56:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2543. [2023-11-06 21:56:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 1762 states have (on average 1.3359818388195233) internal successors, (2354), 1812 states have internal predecessors, (2354), 668 states have call successors, (668), 111 states have call predecessors, (668), 110 states have return successors, (665), 650 states have call predecessors, (665), 665 states have call successors, (665) [2023-11-06 21:56:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3687 transitions. [2023-11-06 21:56:46,858 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3687 transitions. Word has length 68 [2023-11-06 21:56:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:46,861 INFO L495 AbstractCegarLoop]: Abstraction has 2543 states and 3687 transitions. [2023-11-06 21:56:46,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 21:56:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3687 transitions. [2023-11-06 21:56:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 21:56:46,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:46,870 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2023-11-06 21:56:46,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:56:46,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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)] === [2023-11-06 21:56:46,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1141667829, now seen corresponding path program 1 times [2023-11-06 21:56:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:46,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481148749] [2023-11-06 21:56:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:56:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 21:56:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 21:56:47,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:47,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481148749] [2023-11-06 21:56:47,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481148749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:47,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:47,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397931816] [2023-11-06 21:56:47,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:47,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:47,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:47,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:47,550 INFO L87 Difference]: Start difference. First operand 2543 states and 3687 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 21:56:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:48,037 INFO L93 Difference]: Finished difference Result 2549 states and 3692 transitions. [2023-11-06 21:56:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:48,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 73 [2023-11-06 21:56:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:48,066 INFO L225 Difference]: With dead ends: 2549 [2023-11-06 21:56:48,066 INFO L226 Difference]: Without dead ends: 2547 [2023-11-06 21:56:48,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:48,077 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3644 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3653 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:48,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3653 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2023-11-06 21:56:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2547. [2023-11-06 21:56:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 1765 states have (on average 1.3354107648725213) internal successors, (2357), 1815 states have internal predecessors, (2357), 668 states have call successors, (668), 112 states have call predecessors, (668), 111 states have return successors, (665), 650 states have call predecessors, (665), 665 states have call successors, (665) [2023-11-06 21:56:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 3690 transitions. [2023-11-06 21:56:48,454 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 3690 transitions. Word has length 73 [2023-11-06 21:56:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:48,456 INFO L495 AbstractCegarLoop]: Abstraction has 2547 states and 3690 transitions. [2023-11-06 21:56:48,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 21:56:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3690 transitions. [2023-11-06 21:56:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 21:56:48,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:48,461 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:48,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:56:48,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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)] === [2023-11-06 21:56:48,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2107676538, now seen corresponding path program 1 times [2023-11-06 21:56:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:48,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389787785] [2023-11-06 21:56:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:56:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 21:56:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 21:56:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 21:56:49,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:49,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389787785] [2023-11-06 21:56:49,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389787785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:49,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:49,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:49,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954524588] [2023-11-06 21:56:49,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:49,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:49,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:49,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:49,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:49,219 INFO L87 Difference]: Start difference. First operand 2547 states and 3690 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 21:56:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:49,637 INFO L93 Difference]: Finished difference Result 2553 states and 3695 transitions. [2023-11-06 21:56:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:49,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2023-11-06 21:56:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:49,671 INFO L225 Difference]: With dead ends: 2553 [2023-11-06 21:56:49,671 INFO L226 Difference]: Without dead ends: 2551 [2023-11-06 21:56:49,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:49,677 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3644 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3652 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:49,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3652 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2023-11-06 21:56:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2551. [2023-11-06 21:56:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 1768 states have (on average 1.334841628959276) internal successors, (2360), 1818 states have internal predecessors, (2360), 668 states have call successors, (668), 113 states have call predecessors, (668), 112 states have return successors, (665), 650 states have call predecessors, (665), 665 states have call successors, (665) [2023-11-06 21:56:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3693 transitions. [2023-11-06 21:56:49,990 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3693 transitions. Word has length 78 [2023-11-06 21:56:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:49,990 INFO L495 AbstractCegarLoop]: Abstraction has 2551 states and 3693 transitions. [2023-11-06 21:56:49,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 21:56:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3693 transitions. [2023-11-06 21:56:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 21:56:49,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:49,993 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:49,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:56:49,994 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)] === [2023-11-06 21:56:49,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash -371623211, now seen corresponding path program 1 times [2023-11-06 21:56:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:49,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463186983] [2023-11-06 21:56:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:56:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 21:56:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 21:56:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 21:56:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-06 21:56:50,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:50,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463186983] [2023-11-06 21:56:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463186983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:50,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:50,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329990938] [2023-11-06 21:56:50,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:50,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:50,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:50,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:50,661 INFO L87 Difference]: Start difference. First operand 2551 states and 3693 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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) [2023-11-06 21:56:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:51,143 INFO L93 Difference]: Finished difference Result 2557 states and 3698 transitions. [2023-11-06 21:56:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:51,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 83 [2023-11-06 21:56:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:51,168 INFO L225 Difference]: With dead ends: 2557 [2023-11-06 21:56:51,168 INFO L226 Difference]: Without dead ends: 2555 [2023-11-06 21:56:51,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:51,171 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3644 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3651 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:51,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3651 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2023-11-06 21:56:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2023-11-06 21:56:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 1771 states have (on average 1.334274421230943) internal successors, (2363), 1821 states have internal predecessors, (2363), 668 states have call successors, (668), 114 states have call predecessors, (668), 113 states have return successors, (665), 650 states have call predecessors, (665), 665 states have call successors, (665) [2023-11-06 21:56:51,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3696 transitions. [2023-11-06 21:56:51,599 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3696 transitions. Word has length 83 [2023-11-06 21:56:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:51,600 INFO L495 AbstractCegarLoop]: Abstraction has 2555 states and 3696 transitions. [2023-11-06 21:56:51,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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) [2023-11-06 21:56:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3696 transitions. [2023-11-06 21:56:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 21:56:51,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:51,604 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:51,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:56:51,604 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)] === [2023-11-06 21:56:51,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1478266906, now seen corresponding path program 1 times [2023-11-06 21:56:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:51,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608129440] [2023-11-06 21:56:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:56:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 21:56:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 21:56:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 21:56:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 21:56:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-06 21:56:52,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:52,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608129440] [2023-11-06 21:56:52,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608129440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697053524] [2023-11-06 21:56:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:52,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:52,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:52,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:52,242 INFO L87 Difference]: Start difference. First operand 2555 states and 3696 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 21:56:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:52,745 INFO L93 Difference]: Finished difference Result 2561 states and 3701 transitions. [2023-11-06 21:56:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:52,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (15), 3 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 88 [2023-11-06 21:56:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:52,771 INFO L225 Difference]: With dead ends: 2561 [2023-11-06 21:56:52,771 INFO L226 Difference]: Without dead ends: 2559 [2023-11-06 21:56:52,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:52,775 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3644 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3650 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:52,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3650 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:56:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2023-11-06 21:56:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2559. [2023-11-06 21:56:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 1774 states have (on average 1.3337091319052987) internal successors, (2366), 1824 states have internal predecessors, (2366), 668 states have call successors, (668), 115 states have call predecessors, (668), 114 states have return successors, (665), 650 states have call predecessors, (665), 665 states have call successors, (665) [2023-11-06 21:56:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 3699 transitions. [2023-11-06 21:56:53,178 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 3699 transitions. Word has length 88 [2023-11-06 21:56:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:53,179 INFO L495 AbstractCegarLoop]: Abstraction has 2559 states and 3699 transitions. [2023-11-06 21:56:53,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 21:56:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3699 transitions. [2023-11-06 21:56:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 21:56:53,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:53,186 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:53,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:56:53,186 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)] === [2023-11-06 21:56:53,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1487268427, now seen corresponding path program 1 times [2023-11-06 21:56:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227389156] [2023-11-06 21:56:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:56:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 21:56:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 21:56:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 21:56:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 21:56:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 21:56:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-06 21:56:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227389156] [2023-11-06 21:56:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227389156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:53,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:53,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583868414] [2023-11-06 21:56:53,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:53,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:53,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:53,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:53,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:53,807 INFO L87 Difference]: Start difference. First operand 2559 states and 3699 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 21:56:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:54,720 INFO L93 Difference]: Finished difference Result 4585 states and 6763 transitions. [2023-11-06 21:56:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:56:54,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2023-11-06 21:56:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:54,774 INFO L225 Difference]: With dead ends: 4585 [2023-11-06 21:56:54,774 INFO L226 Difference]: Without dead ends: 4583 [2023-11-06 21:56:54,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:54,780 INFO L413 NwaCegarLoop]: 4199 mSDtfsCounter, 2991 mSDsluCounter, 11990 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2996 SdHoareTripleChecker+Valid, 16189 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:54,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2996 Valid, 16189 Invalid, 50 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:56:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2023-11-06 21:56:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4575. [2023-11-06 21:56:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 3159 states have (on average 1.3260525482747705) internal successors, (4189), 3258 states have internal predecessors, (4189), 1192 states have call successors, (1192), 228 states have call predecessors, (1192), 221 states have return successors, (1375), 1141 states have call predecessors, (1375), 1186 states have call successors, (1375) [2023-11-06 21:56:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 6756 transitions. [2023-11-06 21:56:55,547 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 6756 transitions. Word has length 93 [2023-11-06 21:56:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:55,548 INFO L495 AbstractCegarLoop]: Abstraction has 4575 states and 6756 transitions. [2023-11-06 21:56:55,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 21:56:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 6756 transitions. [2023-11-06 21:56:55,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 21:56:55,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:55,552 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:55,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:56:55,553 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)] === [2023-11-06 21:56:55,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:55,554 INFO L85 PathProgramCache]: Analyzing trace with hash 679586138, now seen corresponding path program 1 times [2023-11-06 21:56:55,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:55,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785535417] [2023-11-06 21:56:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:56:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 21:56:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 21:56:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 21:56:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:56:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:56:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:56:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:56:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 21:56:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-06 21:56:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:56,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785535417] [2023-11-06 21:56:56,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785535417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:56,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:56,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:56,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054622633] [2023-11-06 21:56:56,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:56,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:56,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:56,207 INFO L87 Difference]: Start difference. First operand 4575 states and 6756 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 21:56:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:56,869 INFO L93 Difference]: Finished difference Result 4585 states and 6765 transitions. [2023-11-06 21:56:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:56,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (19), 3 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 112 [2023-11-06 21:56:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:56,952 INFO L225 Difference]: With dead ends: 4585 [2023-11-06 21:56:56,953 INFO L226 Difference]: Without dead ends: 4583 [2023-11-06 21:56:56,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:56,958 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3637 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3641 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:56,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3641 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2023-11-06 21:56:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4583. [2023-11-06 21:56:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 3165 states have (on average 1.3254344391785151) internal successors, (4195), 3264 states have internal predecessors, (4195), 1192 states have call successors, (1192), 230 states have call predecessors, (1192), 223 states have return successors, (1375), 1141 states have call predecessors, (1375), 1186 states have call successors, (1375) [2023-11-06 21:56:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 6762 transitions. [2023-11-06 21:56:57,626 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 6762 transitions. Word has length 112 [2023-11-06 21:56:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:57,627 INFO L495 AbstractCegarLoop]: Abstraction has 4583 states and 6762 transitions. [2023-11-06 21:56:57,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 21:56:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 6762 transitions. [2023-11-06 21:56:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 21:56:57,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:57,632 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:57,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:56:57,633 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)] === [2023-11-06 21:56:57,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1689056245, now seen corresponding path program 1 times [2023-11-06 21:56:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:57,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811600503] [2023-11-06 21:56:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:56:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:56:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:56:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:56:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:56:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:56:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:56:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:56:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:56:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 21:56:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 21:56:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 21:56:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:56:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:56:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 21:56:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 21:56:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 21:56:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 21:56:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-11-06 21:56:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:58,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811600503] [2023-11-06 21:56:58,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811600503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:58,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:58,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535398991] [2023-11-06 21:56:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:58,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:58,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:58,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:58,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:58,374 INFO L87 Difference]: Start difference. First operand 4583 states and 6762 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:56:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:59,023 INFO L93 Difference]: Finished difference Result 4593 states and 6771 transitions. [2023-11-06 21:56:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:59,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 3 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 117 [2023-11-06 21:56:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:59,055 INFO L225 Difference]: With dead ends: 4593 [2023-11-06 21:56:59,056 INFO L226 Difference]: Without dead ends: 4591 [2023-11-06 21:56:59,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:59,063 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3637 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3640 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:59,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3640 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2023-11-06 21:56:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4591. [2023-11-06 21:56:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 3171 states have (on average 1.32481866918953) internal successors, (4201), 3270 states have internal predecessors, (4201), 1192 states have call successors, (1192), 232 states have call predecessors, (1192), 225 states have return successors, (1375), 1141 states have call predecessors, (1375), 1186 states have call successors, (1375) [2023-11-06 21:56:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 6768 transitions. [2023-11-06 21:56:59,779 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 6768 transitions. Word has length 117 [2023-11-06 21:56:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:59,780 INFO L495 AbstractCegarLoop]: Abstraction has 4591 states and 6768 transitions. [2023-11-06 21:56:59,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:56:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 6768 transitions. [2023-11-06 21:56:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 21:56:59,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:59,785 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:59,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:56:59,785 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)] === [2023-11-06 21:56:59,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 374651226, now seen corresponding path program 1 times [2023-11-06 21:56:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:59,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954532831] [2023-11-06 21:56:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:59,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:57:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:57:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:57:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:57:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:57:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:57:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:57:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 21:57:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 21:57:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 21:57:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 21:57:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 21:57:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:57:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 21:57:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 21:57:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-06 21:57:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954532831] [2023-11-06 21:57:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954532831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:00,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:57:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189668847] [2023-11-06 21:57:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:00,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:00,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:00,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:00,381 INFO L87 Difference]: Start difference. First operand 4591 states and 6768 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 21:57:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:01,120 INFO L93 Difference]: Finished difference Result 4601 states and 6777 transitions. [2023-11-06 21:57:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:57:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (19), 3 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 108 [2023-11-06 21:57:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:01,151 INFO L225 Difference]: With dead ends: 4601 [2023-11-06 21:57:01,152 INFO L226 Difference]: Without dead ends: 4599 [2023-11-06 21:57:01,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:57:01,156 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3644 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3646 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:01,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3646 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:57:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2023-11-06 21:57:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 4599. [2023-11-06 21:57:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4599 states, 3177 states have (on average 1.3242052250550833) internal successors, (4207), 3276 states have internal predecessors, (4207), 1192 states have call successors, (1192), 234 states have call predecessors, (1192), 227 states have return successors, (1375), 1141 states have call predecessors, (1375), 1186 states have call successors, (1375) [2023-11-06 21:57:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 6774 transitions. [2023-11-06 21:57:01,809 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 6774 transitions. Word has length 108 [2023-11-06 21:57:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:01,810 INFO L495 AbstractCegarLoop]: Abstraction has 4599 states and 6774 transitions. [2023-11-06 21:57:01,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 21:57:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 6774 transitions. [2023-11-06 21:57:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 21:57:01,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:01,813 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:01,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:57:01,814 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)] === [2023-11-06 21:57:01,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1887310709, now seen corresponding path program 1 times [2023-11-06 21:57:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641035029] [2023-11-06 21:57:01,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:57:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:57:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:57:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:57:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:57:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:57:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:57:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 21:57:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 21:57:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 21:57:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 21:57:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 21:57:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:57:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 21:57:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 21:57:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:57:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-11-06 21:57:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:02,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641035029] [2023-11-06 21:57:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641035029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:02,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:57:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107571277] [2023-11-06 21:57:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:02,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:02,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:02,366 INFO L87 Difference]: Start difference. First operand 4599 states and 6774 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:57:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:03,010 INFO L93 Difference]: Finished difference Result 4609 states and 6783 transitions. [2023-11-06 21:57:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:57:03,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (20), 3 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 113 [2023-11-06 21:57:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:03,037 INFO L225 Difference]: With dead ends: 4609 [2023-11-06 21:57:03,038 INFO L226 Difference]: Without dead ends: 4605 [2023-11-06 21:57:03,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:57:03,042 INFO L413 NwaCegarLoop]: 3681 mSDtfsCounter, 3644 mSDsluCounter, 7342 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3645 SdHoareTripleChecker+Valid, 11023 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:03,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3645 Valid, 11023 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:57:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2023-11-06 21:57:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 4605. [2023-11-06 21:57:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 3182 states have (on average 1.3233815210559396) internal successors, (4211), 3280 states have internal predecessors, (4211), 1192 states have call successors, (1192), 236 states have call predecessors, (1192), 228 states have return successors, (1375), 1141 states have call predecessors, (1375), 1186 states have call successors, (1375) [2023-11-06 21:57:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6778 transitions. [2023-11-06 21:57:03,653 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6778 transitions. Word has length 113 [2023-11-06 21:57:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:03,656 INFO L495 AbstractCegarLoop]: Abstraction has 4605 states and 6778 transitions. [2023-11-06 21:57:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 21:57:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6778 transitions. [2023-11-06 21:57:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-06 21:57:03,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:03,659 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:03,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:57:03,660 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)] === [2023-11-06 21:57:03,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -900929030, now seen corresponding path program 1 times [2023-11-06 21:57:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148037761] [2023-11-06 21:57:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:57:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:57:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 21:57:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:57:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:57:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:57:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:57:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 21:57:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 21:57:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 21:57:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 21:57:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 21:57:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:57:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 21:57:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 21:57:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 21:57:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 21:57:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-11-06 21:57:04,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:04,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148037761] [2023-11-06 21:57:04,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148037761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:04,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:04,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:57:04,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890613774] [2023-11-06 21:57:04,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:04,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:04,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:04,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:04,345 INFO L87 Difference]: Start difference. First operand 4605 states and 6778 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-06 21:57:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:04,995 INFO L93 Difference]: Finished difference Result 4611 states and 6783 transitions. [2023-11-06 21:57:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:57:04,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (21), 3 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 118 [2023-11-06 21:57:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:05,022 INFO L225 Difference]: With dead ends: 4611 [2023-11-06 21:57:05,022 INFO L226 Difference]: Without dead ends: 4518 [2023-11-06 21:57:05,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:57:05,027 INFO L413 NwaCegarLoop]: 3682 mSDtfsCounter, 3644 mSDsluCounter, 7344 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3644 SdHoareTripleChecker+Valid, 11026 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:05,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3644 Valid, 11026 Invalid, 18 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:57:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2023-11-06 21:57:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 4518. [2023-11-06 21:57:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4518 states, 3131 states have (on average 1.3273714468221016) internal successors, (4156), 3227 states have internal predecessors, (4156), 1172 states have call successors, (1172), 219 states have call predecessors, (1172), 212 states have return successors, (1358), 1124 states have call predecessors, (1358), 1169 states have call successors, (1358) [2023-11-06 21:57:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 6686 transitions. [2023-11-06 21:57:05,789 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 6686 transitions. Word has length 118 [2023-11-06 21:57:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:05,790 INFO L495 AbstractCegarLoop]: Abstraction has 4518 states and 6686 transitions. [2023-11-06 21:57:05,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-06 21:57:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 6686 transitions. [2023-11-06 21:57:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-06 21:57:05,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:05,794 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:05,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:57:05,795 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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)] === [2023-11-06 21:57:05,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash -417755308, now seen corresponding path program 1 times [2023-11-06 21:57:05,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949859806] [2023-11-06 21:57:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:05,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:57:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:57:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 21:57:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:57:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:57:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 21:57:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:57:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:57:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:57:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:57:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:57:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:57:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:57:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 21:57:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 21:57:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 21:57:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 21:57:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 21:57:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-11-06 21:57:07,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:07,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949859806] [2023-11-06 21:57:07,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949859806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:07,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:07,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:57:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905810599] [2023-11-06 21:57:07,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:07,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:57:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:07,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:57:07,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:57:07,193 INFO L87 Difference]: Start difference. First operand 4518 states and 6686 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 21:57:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:32,676 INFO L93 Difference]: Finished difference Result 6226 states and 9746 transitions. [2023-11-06 21:57:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:57:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2023-11-06 21:57:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:32,722 INFO L225 Difference]: With dead ends: 6226 [2023-11-06 21:57:32,723 INFO L226 Difference]: Without dead ends: 6224 [2023-11-06 21:57:32,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:57:32,728 INFO L413 NwaCegarLoop]: 1954 mSDtfsCounter, 9703 mSDsluCounter, 8708 mSDsCounter, 0 mSdLazyCounter, 10839 mSolverCounterSat, 6336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10321 SdHoareTripleChecker+Valid, 10662 SdHoareTripleChecker+Invalid, 17175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6336 IncrementalHoareTripleChecker+Valid, 10839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:32,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10321 Valid, 10662 Invalid, 17175 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6336 Valid, 10839 Invalid, 0 Unknown, 0 Unchecked, 23.4s Time] [2023-11-06 21:57:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2023-11-06 21:57:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 5894. [2023-11-06 21:57:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 4110 states have (on average 1.3364963503649636) internal successors, (5493), 4237 states have internal predecessors, (5493), 1503 states have call successors, (1503), 219 states have call predecessors, (1503), 278 states have return successors, (2126), 1508 states have call predecessors, (2126), 1500 states have call successors, (2126) [2023-11-06 21:57:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 9122 transitions. [2023-11-06 21:57:33,962 INFO L78 Accepts]: Start accepts. Automaton has 5894 states and 9122 transitions. Word has length 156 [2023-11-06 21:57:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:33,962 INFO L495 AbstractCegarLoop]: Abstraction has 5894 states and 9122 transitions. [2023-11-06 21:57:33,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 21:57:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5894 states and 9122 transitions. [2023-11-06 21:57:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-06 21:57:33,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:33,969 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:33,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:57:33,969 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_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)] === [2023-11-06 21:57:33,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1217658712, now seen corresponding path program 1 times [2023-11-06 21:57:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193668136] [2023-11-06 21:57:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:57:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:57:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 21:57:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:57:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:57:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 21:57:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:57:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:57:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:57:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:57:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:57:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:57:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:57:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 21:57:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:57:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 21:57:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 21:57:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 21:57:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 21:57:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 21:57:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:57:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:57:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-06 21:57:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-06 21:57:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193668136] [2023-11-06 21:57:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193668136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:35,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:57:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87326901] [2023-11-06 21:57:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:35,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:57:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:35,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:57:35,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:57:35,030 INFO L87 Difference]: Start difference. First operand 5894 states and 9122 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-06 21:58:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:58:09,908 INFO L93 Difference]: Finished difference Result 8132 states and 13227 transitions. [2023-11-06 21:58:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:58:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 183 [2023-11-06 21:58:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:58:09,964 INFO L225 Difference]: With dead ends: 8132 [2023-11-06 21:58:09,964 INFO L226 Difference]: Without dead ends: 8130 [2023-11-06 21:58:09,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:58:09,971 INFO L413 NwaCegarLoop]: 4047 mSDtfsCounter, 7556 mSDsluCounter, 14347 mSDsCounter, 0 mSdLazyCounter, 17379 mSolverCounterSat, 3896 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8086 SdHoareTripleChecker+Valid, 18394 SdHoareTripleChecker+Invalid, 21275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 3896 IncrementalHoareTripleChecker+Valid, 17379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:58:09,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8086 Valid, 18394 Invalid, 21275 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [3896 Valid, 17379 Invalid, 0 Unknown, 0 Unchecked, 32.3s Time] [2023-11-06 21:58:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2023-11-06 21:58:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 5911. [2023-11-06 21:58:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5911 states, 4120 states have (on average 1.3354368932038836) internal successors, (5502), 4245 states have internal predecessors, (5502), 1506 states have call successors, (1506), 219 states have call predecessors, (1506), 282 states have return successors, (2046), 1517 states have call predecessors, (2046), 1503 states have call successors, (2046) [2023-11-06 21:58:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 9054 transitions. [2023-11-06 21:58:11,143 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 9054 transitions. Word has length 183 [2023-11-06 21:58:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:58:11,144 INFO L495 AbstractCegarLoop]: Abstraction has 5911 states and 9054 transitions. [2023-11-06 21:58:11,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-06 21:58:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 9054 transitions. [2023-11-06 21:58:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-11-06 21:58:11,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:58:11,156 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:58:11,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:58:11,156 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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)] === [2023-11-06 21:58:11,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:58:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1931545974, now seen corresponding path program 1 times [2023-11-06 21:58:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:58:11,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336610542] [2023-11-06 21:58:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:58:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:58:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:58:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:58:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 21:58:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 21:58:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:58:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:58:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:58:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 21:58:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 21:58:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 21:58:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 21:58:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 21:58:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 21:58:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:58:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:58:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-06 21:58:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-06 21:58:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-06 21:58:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-06 21:58:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:58:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-06 21:58:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-11-06 21:58:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-11-06 21:58:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-11-06 21:58:12,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:58:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336610542] [2023-11-06 21:58:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336610542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:58:12,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:58:12,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:58:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198652837] [2023-11-06 21:58:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:58:12,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:58:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:58:12,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:58:12,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:58:12,237 INFO L87 Difference]: Start difference. First operand 5911 states and 9054 transitions. Second operand has 7 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-06 21:58:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:58:29,069 INFO L93 Difference]: Finished difference Result 13467 states and 21350 transitions. [2023-11-06 21:58:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:58:29,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) Word has length 239 [2023-11-06 21:58:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:58:29,159 INFO L225 Difference]: With dead ends: 13467 [2023-11-06 21:58:29,159 INFO L226 Difference]: Without dead ends: 7583 [2023-11-06 21:58:29,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:58:29,250 INFO L413 NwaCegarLoop]: 2080 mSDtfsCounter, 3397 mSDsluCounter, 6352 mSDsCounter, 0 mSdLazyCounter, 7800 mSolverCounterSat, 1986 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3892 SdHoareTripleChecker+Valid, 8432 SdHoareTripleChecker+Invalid, 9786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1986 IncrementalHoareTripleChecker+Valid, 7800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:58:29,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3892 Valid, 8432 Invalid, 9786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1986 Valid, 7800 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2023-11-06 21:58:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2023-11-06 21:58:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 5914. [2023-11-06 21:58:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5914 states, 4123 states have (on average 1.3351928207615813) internal successors, (5505), 4248 states have internal predecessors, (5505), 1506 states have call successors, (1506), 219 states have call predecessors, (1506), 282 states have return successors, (2046), 1517 states have call predecessors, (2046), 1503 states have call successors, (2046) [2023-11-06 21:58:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 9057 transitions. [2023-11-06 21:58:30,694 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 9057 transitions. Word has length 239 [2023-11-06 21:58:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:58:30,696 INFO L495 AbstractCegarLoop]: Abstraction has 5914 states and 9057 transitions. [2023-11-06 21:58:30,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (35), 5 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-06 21:58:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 9057 transitions. [2023-11-06 21:58:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-11-06 21:58:30,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:58:30,709 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:58:30,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:58:30,710 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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)] === [2023-11-06 21:58:30,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:58:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1110795535, now seen corresponding path program 1 times [2023-11-06 21:58:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:58:30,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006742149] [2023-11-06 21:58:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:58:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:58:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:58:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:58:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 21:58:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 21:58:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:58:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:58:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:58:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 21:58:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 21:58:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 21:58:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 21:58:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 21:58:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 21:58:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:58:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:58:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-06 21:58:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-06 21:58:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2023-11-06 21:58:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-06 21:58:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:58:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2023-11-06 21:58:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:58:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-06 21:58:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-06 21:58:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-06 21:58:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-11-06 21:58:32,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:58:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006742149] [2023-11-06 21:58:32,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006742149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:58:32,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:58:32,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:58:32,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28504635] [2023-11-06 21:58:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:58:32,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:58:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:58:32,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:58:32,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:58:32,297 INFO L87 Difference]: Start difference. First operand 5914 states and 9057 transitions. Second operand has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2023-11-06 21:58:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:58:50,015 INFO L93 Difference]: Finished difference Result 13477 states and 21362 transitions. [2023-11-06 21:58:50,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:58:50,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) Word has length 253 [2023-11-06 21:58:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:58:50,084 INFO L225 Difference]: With dead ends: 13477 [2023-11-06 21:58:50,084 INFO L226 Difference]: Without dead ends: 7590 [2023-11-06 21:58:50,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:58:50,136 INFO L413 NwaCegarLoop]: 2017 mSDtfsCounter, 2509 mSDsluCounter, 6671 mSDsCounter, 0 mSdLazyCounter, 8985 mSolverCounterSat, 978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3004 SdHoareTripleChecker+Valid, 8688 SdHoareTripleChecker+Invalid, 9963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 978 IncrementalHoareTripleChecker+Valid, 8985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:58:50,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3004 Valid, 8688 Invalid, 9963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [978 Valid, 8985 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2023-11-06 21:58:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7590 states. [2023-11-06 21:58:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7590 to 5916. [2023-11-06 21:58:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5916 states, 4125 states have (on average 1.335030303030303) internal successors, (5507), 4250 states have internal predecessors, (5507), 1506 states have call successors, (1506), 219 states have call predecessors, (1506), 282 states have return successors, (2046), 1517 states have call predecessors, (2046), 1503 states have call successors, (2046) [2023-11-06 21:58:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5916 states to 5916 states and 9059 transitions. [2023-11-06 21:58:51,349 INFO L78 Accepts]: Start accepts. Automaton has 5916 states and 9059 transitions. Word has length 253 [2023-11-06 21:58:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:58:51,350 INFO L495 AbstractCegarLoop]: Abstraction has 5916 states and 9059 transitions. [2023-11-06 21:58:51,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2023-11-06 21:58:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 5916 states and 9059 transitions. [2023-11-06 21:58:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-11-06 21:58:51,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:58:51,361 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:58:51,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:58:51,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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)] === [2023-11-06 21:58:51,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:58:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1943554273, now seen corresponding path program 1 times [2023-11-06 21:58:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:58:51,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140195687] [2023-11-06 21:58:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:58:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:58:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:58:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:58:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:58:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 21:58:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 21:58:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:58:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:58:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:58:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:58:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:58:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 21:58:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 21:58:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 21:58:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 21:58:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 21:58:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 21:58:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:58:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:58:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-06 21:58:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-06 21:58:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-06 21:58:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-06 21:58:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:58:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-11-06 21:58:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:58:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:58:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-06 21:58:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-06 21:58:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-06 21:58:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:58:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-11-06 21:58:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:58:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140195687] [2023-11-06 21:58:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140195687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:58:52,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:58:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:58:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809249826] [2023-11-06 21:58:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:58:52,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:58:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:58:52,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:58:52,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:58:52,395 INFO L87 Difference]: Start difference. First operand 5916 states and 9059 transitions. Second operand has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 5 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 4 states have call predecessors, (32), 5 states have call successors, (32) [2023-11-06 21:59:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:08,571 INFO L93 Difference]: Finished difference Result 13840 states and 21962 transitions. [2023-11-06 21:59:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:59:08,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 5 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 4 states have call predecessors, (32), 5 states have call successors, (32) Word has length 254 [2023-11-06 21:59:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:08,639 INFO L225 Difference]: With dead ends: 13840 [2023-11-06 21:59:08,639 INFO L226 Difference]: Without dead ends: 7951 [2023-11-06 21:59:08,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:59:08,685 INFO L413 NwaCegarLoop]: 2280 mSDtfsCounter, 5193 mSDsluCounter, 8757 mSDsCounter, 0 mSdLazyCounter, 9387 mSolverCounterSat, 3326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5690 SdHoareTripleChecker+Valid, 11037 SdHoareTripleChecker+Invalid, 12713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3326 IncrementalHoareTripleChecker+Valid, 9387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:08,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5690 Valid, 11037 Invalid, 12713 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3326 Valid, 9387 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2023-11-06 21:59:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7951 states. [2023-11-06 21:59:09,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7951 to 5925. [2023-11-06 21:59:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 4132 states have (on average 1.335188770571152) internal successors, (5517), 4257 states have internal predecessors, (5517), 1508 states have call successors, (1508), 219 states have call predecessors, (1508), 282 states have return successors, (2048), 1519 states have call predecessors, (2048), 1505 states have call successors, (2048) [2023-11-06 21:59:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 9073 transitions. [2023-11-06 21:59:09,854 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 9073 transitions. Word has length 254 [2023-11-06 21:59:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:09,855 INFO L495 AbstractCegarLoop]: Abstraction has 5925 states and 9073 transitions. [2023-11-06 21:59:09,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 5 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 4 states have call predecessors, (32), 5 states have call successors, (32) [2023-11-06 21:59:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 9073 transitions. [2023-11-06 21:59:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-11-06 21:59:09,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:09,868 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:09,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 21:59:09,868 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)] === [2023-11-06 21:59:09,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2111173277, now seen corresponding path program 1 times [2023-11-06 21:59:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569224336] [2023-11-06 21:59:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:59:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:59:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:59:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 21:59:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:59:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:59:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 21:59:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:59:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:59:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:59:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:59:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:59:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:59:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:59:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 21:59:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 21:59:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 21:59:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 21:59:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:10,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 21:59:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 21:59:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:59:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:59:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-06 21:59:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-06 21:59:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-06 21:59:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-06 21:59:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:59:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-11-06 21:59:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:59:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-06 21:59:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-06 21:59:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-06 21:59:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-11-06 21:59:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:59:11,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569224336] [2023-11-06 21:59:11,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569224336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:59:11,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:59:11,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:59:11,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117417135] [2023-11-06 21:59:11,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:59:11,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:59:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:59:11,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:59:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:59:11,145 INFO L87 Difference]: Start difference. First operand 5925 states and 9073 transitions. Second operand has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 5 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 4 states have call predecessors, (32), 5 states have call successors, (32) [2023-11-06 21:59:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:29,677 INFO L93 Difference]: Finished difference Result 13497 states and 21391 transitions. [2023-11-06 21:59:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:59:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 5 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 4 states have call predecessors, (32), 5 states have call successors, (32) Word has length 254 [2023-11-06 21:59:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:29,741 INFO L225 Difference]: With dead ends: 13497 [2023-11-06 21:59:29,741 INFO L226 Difference]: Without dead ends: 7599 [2023-11-06 21:59:29,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:59:29,790 INFO L413 NwaCegarLoop]: 2033 mSDtfsCounter, 4161 mSDsluCounter, 7776 mSDsCounter, 0 mSdLazyCounter, 10029 mSolverCounterSat, 2256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 9809 SdHoareTripleChecker+Invalid, 12285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2256 IncrementalHoareTripleChecker+Valid, 10029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:29,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 9809 Invalid, 12285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2256 Valid, 10029 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2023-11-06 21:59:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2023-11-06 21:59:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 5916. [2023-11-06 21:59:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5916 states, 4125 states have (on average 1.3347878787878789) internal successors, (5506), 4250 states have internal predecessors, (5506), 1506 states have call successors, (1506), 219 states have call predecessors, (1506), 282 states have return successors, (2046), 1517 states have call predecessors, (2046), 1503 states have call successors, (2046) [2023-11-06 21:59:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5916 states to 5916 states and 9058 transitions. [2023-11-06 21:59:31,040 INFO L78 Accepts]: Start accepts. Automaton has 5916 states and 9058 transitions. Word has length 254 [2023-11-06 21:59:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:31,041 INFO L495 AbstractCegarLoop]: Abstraction has 5916 states and 9058 transitions. [2023-11-06 21:59:31,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 16.714285714285715) internal successors, (117), 5 states have internal predecessors, (117), 5 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 4 states have call predecessors, (32), 5 states have call successors, (32) [2023-11-06 21:59:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5916 states and 9058 transitions. [2023-11-06 21:59:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-11-06 21:59:31,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:31,053 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:31,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 21:59:31,054 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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)] === [2023-11-06 21:59:31,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:31,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1476307963, now seen corresponding path program 1 times [2023-11-06 21:59:31,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:31,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756361660] [2023-11-06 21:59:31,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:31,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:59:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 21:59:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 21:59:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 21:59:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:59:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:59:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 21:59:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:59:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:59:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 21:59:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 21:59:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:59:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 21:59:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:59:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 21:59:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 21:59:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 21:59:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 21:59:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 21:59:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 21:59:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:59:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:59:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-06 21:59:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-06 21:59:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-06 21:59:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-06 21:59:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:59:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-06 21:59:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 21:59:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:59:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-06 21:59:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-06 21:59:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-06 21:59:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:59:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2023-11-06 21:59:31,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:59:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756361660] [2023-11-06 21:59:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756361660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:59:31,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:59:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:59:31,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661390082] [2023-11-06 21:59:31,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:59:31,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:59:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:59:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:59:31,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:59:31,933 INFO L87 Difference]: Start difference. First operand 5916 states and 9058 transitions. Second operand has 6 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2023-11-06 21:59:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:59:45,907 INFO L93 Difference]: Finished difference Result 13472 states and 21351 transitions. [2023-11-06 21:59:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:59:45,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) Word has length 255 [2023-11-06 21:59:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:59:45,953 INFO L225 Difference]: With dead ends: 13472 [2023-11-06 21:59:45,953 INFO L226 Difference]: Without dead ends: 7583 [2023-11-06 21:59:45,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:59:46,000 INFO L413 NwaCegarLoop]: 2086 mSDtfsCounter, 3362 mSDsluCounter, 4444 mSDsCounter, 0 mSdLazyCounter, 5834 mSolverCounterSat, 1962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3856 SdHoareTripleChecker+Valid, 6530 SdHoareTripleChecker+Invalid, 7796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1962 IncrementalHoareTripleChecker+Valid, 5834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:59:46,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3856 Valid, 6530 Invalid, 7796 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1962 Valid, 5834 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2023-11-06 21:59:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2023-11-06 21:59:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 5917. [2023-11-06 21:59:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5917 states, 4126 states have (on average 1.3347067377605428) internal successors, (5507), 4251 states have internal predecessors, (5507), 1506 states have call successors, (1506), 219 states have call predecessors, (1506), 282 states have return successors, (2046), 1517 states have call predecessors, (2046), 1503 states have call successors, (2046) [2023-11-06 21:59:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5917 states to 5917 states and 9059 transitions. [2023-11-06 21:59:47,137 INFO L78 Accepts]: Start accepts. Automaton has 5917 states and 9059 transitions. Word has length 255 [2023-11-06 21:59:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:59:47,138 INFO L495 AbstractCegarLoop]: Abstraction has 5917 states and 9059 transitions. [2023-11-06 21:59:47,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.6) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (38), 5 states have call predecessors, (38), 1 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2023-11-06 21:59:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 5917 states and 9059 transitions. [2023-11-06 21:59:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-11-06 21:59:47,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:59:47,151 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:59:47,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 21:59:47,151 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)] === [2023-11-06 21:59:47,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:59:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1530700861, now seen corresponding path program 1 times [2023-11-06 21:59:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:59:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607509420] [2023-11-06 21:59:47,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:59:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:59:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat