./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 3bc6b3a88723e5b624538f8d0e562bbcbb838c2bd2dcd71ae870bf42dcd3068b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:18:37,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:18:37,803 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-12 02:18:37,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:18:37,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:18:37,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:18:37,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:18:37,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:18:37,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:18:37,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:18:37,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:18:37,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:18:37,864 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:18:37,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:18:37,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:18:37,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:18:37,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:18:37,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:18:37,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:18:37,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:18:37,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:18:37,880 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:18:37,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:18:37,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:18:37,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:18:37,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:37,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:18:37,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:18:37,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:18:37,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:18:37,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:18:37,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:18:37,886 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:18:37,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:18:37,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:18:37,887 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:18:37,887 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3bc6b3a88723e5b624538f8d0e562bbcbb838c2bd2dcd71ae870bf42dcd3068b [2023-11-12 02:18:38,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:18:38,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:18:38,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:18:38,187 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:18:38,188 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:18:38,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i [2023-11-12 02:18:41,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:18:42,030 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:18:42,031 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i [2023-11-12 02:18:42,097 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/data/58b733bea/6524e66114bc41539adc8da64292afa8/FLAG905f12067 [2023-11-12 02:18:42,116 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/data/58b733bea/6524e66114bc41539adc8da64292afa8 [2023-11-12 02:18:42,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:18:42,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:18:42,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:42,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:18:42,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:18:42,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775508a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:42, skipping insertion in model container [2023-11-12 02:18:42,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:42" (1/1) ... [2023-11-12 02:18:42,341 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:18:45,426 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339479,339492] [2023-11-12 02:18:45,431 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339648,339661] [2023-11-12 02:18:45,432 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339815,339828] [2023-11-12 02:18:45,432 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339983,339996] [2023-11-12 02:18:45,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:45,530 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:18:45,648 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"); [5308] [2023-11-12 02:18:45,650 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)); [5315] [2023-11-12 02:18:45,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [5322] [2023-11-12 02:18:45,653 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)); [5377-5378] [2023-11-12 02:18:45,654 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"); [5383-5385] [2023-11-12 02:18:45,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movb %1,%0": "=q" (ret): "m" (*((unsigned char volatile *)addr)): "memory"); [5502] [2023-11-12 02:18:45,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %1,%0": "=r" (ret): "m" (*((unsigned int volatile *)addr)): "memory"); [5510] [2023-11-12 02:18:45,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %0,%1": : "r" (val), "m" (*((unsigned int volatile *)addr)): "memory"); [5517] [2023-11-12 02:18:45,663 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)); [5645-5646] [2023-11-12 02:18:45,665 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)); [5679-5680] [2023-11-12 02:18:45,667 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" (79), "i" (12UL)); [5720-5721] [2023-11-12 02:18:45,668 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" (91), "i" (12UL)); [5749-5750] [2023-11-12 02:18:45,669 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" (103), "i" (12UL)); [5786-5787] [2023-11-12 02:18:45,671 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" (115), "i" (12UL)); [5823-5824] [2023-11-12 02:18:45,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("": : : "memory"); [6769] [2023-11-12 02:18:45,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [7540] [2023-11-12 02:18:45,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [7550] [2023-11-12 02:18:45,730 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [7565] [2023-11-12 02:18:45,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8351] [2023-11-12 02:18:45,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8384] [2023-11-12 02:18:45,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8407] [2023-11-12 02:18:45,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8648] [2023-11-12 02:18:45,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8678] [2023-11-12 02:18:45,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8691] [2023-11-12 02:18:45,968 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339479,339492] [2023-11-12 02:18:45,968 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339648,339661] [2023-11-12 02:18:45,969 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339815,339828] [2023-11-12 02:18:45,969 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_20f689cf-e4ab-4421-a1fe-0d50cabe170b/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339983,339996] [2023-11-12 02:18:45,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:46,188 WARN L672 CHandler]: The function strncmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:18:46,188 WARN L672 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:18:46,196 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:18:46,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46 WrapperNode [2023-11-12 02:18:46,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:46,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:46,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:18:46,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:18:46,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,598 INFO L138 Inliner]: procedures = 433, calls = 2151, calls flagged for inlining = 207, calls inlined = 190, statements flattened = 5938 [2023-11-12 02:18:46,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:46,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:18:46,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:18:46,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:18:46,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:46,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:47,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:18:47,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:18:47,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:18:47,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:18:47,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (1/1) ... [2023-11-12 02:18:47,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:47,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:18:47,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:18:47,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20f689cf-e4ab-4421-a1fe-0d50cabe170b/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:18:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2023-11-12 02:18:47,111 INFO L130 BoogieDeclarations]: Found specification of procedure BB_GET_BIT2 [2023-11-12 02:18:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure BB_GET_BIT2 [2023-11-12 02:18:47,112 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2023-11-12 02:18:47,112 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2023-11-12 02:18:47,113 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2023-11-12 02:18:47,113 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2023-11-12 02:18:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-12 02:18:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-12 02:18:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_open [2023-11-12 02:18:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_open [2023-11-12 02:18:47,114 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_poll_stop [2023-11-12 02:18:47,114 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_poll_stop [2023-11-12 02:18:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure is_quattro_p [2023-11-12 02:18:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure is_quattro_p [2023-11-12 02:18:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2023-11-12 02:18:47,115 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2023-11-12 02:18:47,115 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_close [2023-11-12 02:18:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_close [2023-11-12 02:18:47,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-12 02:18:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-12 02:18:47,116 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2023-11-12 02:18:47,116 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2023-11-12 02:18:47,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-12 02:18:47,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-12 02:18:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_set_multicast [2023-11-12 02:18:47,117 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_set_multicast [2023-11-12 02:18:47,117 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2023-11-12 02:18:47,117 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2023-11-12 02:18:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure BB_PUT_BIT [2023-11-12 02:18:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure BB_PUT_BIT [2023-11-12 02:18:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2023-11-12 02:18:47,118 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2023-11-12 02:18:47,118 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_begin_auto_negotiation [2023-11-12 02:18:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_begin_auto_negotiation [2023-11-12 02:18:47,119 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_get_counters [2023-11-12 02:18:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_get_counters [2023-11-12 02:18:47,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_happy_lock_of_happy_meal [2023-11-12 02:18:47,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_happy_lock_of_happy_meal [2023-11-12 02:18:47,120 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-12 02:18:47,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-12 02:18:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-12 02:18:47,120 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2023-11-12 02:18:47,120 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2023-11-12 02:18:47,121 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2023-11-12 02:18:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2023-11-12 02:18:47,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer [2023-11-12 02:18:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer [2023-11-12 02:18:47,121 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2023-11-12 02:18:47,121 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2023-11-12 02:18:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-12 02:18:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-12 02:18:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:18:47,122 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2023-11-12 02:18:47,122 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2023-11-12 02:18:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_happy_lock_of_happy_meal [2023-11-12 02:18:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_happy_lock_of_happy_meal [2023-11-12 02:18:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2023-11-12 02:18:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2023-11-12 02:18:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-12 02:18:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2023-11-12 02:18:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2023-11-12 02:18:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-12 02:18:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-12 02:18:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-12 02:18:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:18:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2023-11-12 02:18:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2023-11-12 02:18:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2023-11-12 02:18:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2023-11-12 02:18:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2023-11-12 02:18:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2023-11-12 02:18:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2023-11-12 02:18:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2023-11-12 02:18:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure set_happy_link_modes [2023-11-12 02:18:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure set_happy_link_modes [2023-11-12 02:18:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_tcvr_reset [2023-11-12 02:18:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_tcvr_reset [2023-11-12 02:18:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2023-11-12 02:18:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2023-11-12 02:18:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:18:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_tx_timeout [2023-11-12 02:18:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_tx_timeout [2023-11-12 02:18:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure dma_map_single_attrs [2023-11-12 02:18:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_map_single_attrs [2023-11-12 02:18:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:18:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_tcvr_read [2023-11-12 02:18:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_tcvr_read [2023-11-12 02:18:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-12 02:18:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-12 02:18:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2023-11-12 02:18:47,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2023-11-12 02:18:47,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:18:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-12 02:18:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-12 02:18:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-12 02:18:47,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-12 02:18:47,130 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-12 02:18:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-12 02:18:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_map_page [2023-11-12 02:18:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_map_page [2023-11-12 02:18:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-12 02:18:47,131 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2023-11-12 02:18:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2023-11-12 02:18:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2023-11-12 02:18:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2023-11-12 02:18:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2023-11-12 02:18:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2023-11-12 02:18:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2023-11-12 02:18:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure is_lucent_phy [2023-11-12 02:18:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure is_lucent_phy [2023-11-12 02:18:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:18:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:18:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure hme_read_desc32 [2023-11-12 02:18:47,133 INFO L138 BoogieDeclarations]: Found implementation of procedure hme_read_desc32 [2023-11-12 02:18:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-11-12 02:18:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-11-12 02:18:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-12 02:18:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_clean_rings [2023-11-12 02:18:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_clean_rings [2023-11-12 02:18:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-12 02:18:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-12 02:18:47,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-12 02:18:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2023-11-12 02:18:47,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2023-11-12 02:18:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-12 02:18:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-12 02:18:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure kmemcheck_mark_initialized [2023-11-12 02:18:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure kmemcheck_mark_initialized [2023-11-12 02:18:47,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2023-11-12 02:18:47,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2023-11-12 02:18:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-12 02:18:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-12 02:18:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2023-11-12 02:18:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2023-11-12 02:18:47,137 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2023-11-12 02:18:47,137 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2023-11-12 02:18:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_unmap_page [2023-11-12 02:18:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_unmap_page [2023-11-12 02:18:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_single_attrs [2023-11-12 02:18:47,138 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_single_attrs [2023-11-12 02:18:47,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:18:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:18:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2023-11-12 02:18:47,139 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2023-11-12 02:18:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:18:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-12 02:18:47,140 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-12 02:18:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-12 02:18:47,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-12 02:18:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_stop [2023-11-12 02:18:47,140 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_stop [2023-11-12 02:18:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2023-11-12 02:18:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2023-11-12 02:18:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-12 02:18:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-12 02:18:47,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2023-11-12 02:18:47,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2023-11-12 02:18:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_pci_remove [2023-11-12 02:18:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_pci_remove [2023-11-12 02:18:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_63 [2023-11-12 02:18:47,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_63 [2023-11-12 02:18:47,142 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_init [2023-11-12 02:18:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_init [2023-11-12 02:18:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2023-11-12 02:18:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2023-11-12 02:18:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2023-11-12 02:18:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2023-11-12 02:18:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_tcvr_write [2023-11-12 02:18:47,144 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_tcvr_write [2023-11-12 02:18:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:18:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-12 02:18:47,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-12 02:18:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2023-11-12 02:18:47,144 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2023-11-12 02:18:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_64 [2023-11-12 02:18:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_64 [2023-11-12 02:18:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-12 02:18:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-12 02:18:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2023-11-12 02:18:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2023-11-12 02:18:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure ethtool_cmd_speed [2023-11-12 02:18:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ethtool_cmd_speed [2023-11-12 02:18:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2023-11-12 02:18:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2023-11-12 02:18:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:18:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_page [2023-11-12 02:18:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_page [2023-11-12 02:18:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2023-11-12 02:18:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2023-11-12 02:18:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2023-11-12 02:18:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2023-11-12 02:18:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_transceiver_check [2023-11-12 02:18:47,148 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_transceiver_check [2023-11-12 02:18:48,080 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:18:48,089 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:18:48,987 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-12 02:18:55,713 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:18:55,743 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:18:55,743 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:18:55,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:55 BoogieIcfgContainer [2023-11-12 02:18:55,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:18:55,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:18:55,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:18:55,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:18:55,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:18:42" (1/3) ... [2023-11-12 02:18:55,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675663b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:55, skipping insertion in model container [2023-11-12 02:18:55,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:46" (2/3) ... [2023-11-12 02:18:55,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675663b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:55, skipping insertion in model container [2023-11-12 02:18:55,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:55" (3/3) ... [2023-11-12 02:18:55,760 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i [2023-11-12 02:18:55,782 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:18:55,782 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-12 02:18:55,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:18:55,900 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=LoopHeads, 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;@7130ac37, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:18:55,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-12 02:18:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 2386 states, 1691 states have (on average 1.4039030159668835) internal successors, (2374), 1736 states have internal predecessors, (2374), 604 states have call successors, (604), 88 states have call predecessors, (604), 87 states have return successors, (600), 589 states have call predecessors, (600), 600 states have call successors, (600) [2023-11-12 02:18:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 02:18:55,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:55,925 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:18:55,926 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-12 02:18:55,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:55,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1457790757, now seen corresponding path program 1 times [2023-11-12 02:18:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647541930] [2023-11-12 02:18:55,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-12 02:18:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:56,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:18:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:56,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-12 02:18:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-12 02:18:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-12 02:18:56,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:56,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647541930] [2023-11-12 02:18:56,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647541930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:56,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:56,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264829256] [2023-11-12 02:18:56,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:56,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:18:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:56,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:18:56,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:56,792 INFO L87 Difference]: Start difference. First operand has 2386 states, 1691 states have (on average 1.4039030159668835) internal successors, (2374), 1736 states have internal predecessors, (2374), 604 states have call successors, (604), 88 states have call predecessors, (604), 87 states have return successors, (600), 589 states have call predecessors, (600), 600 states have call successors, (600) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 02:18:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:57,184 INFO L93 Difference]: Finished difference Result 4742 states and 7261 transitions. [2023-11-12 02:18:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:18:57,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-11-12 02:18:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:57,232 INFO L225 Difference]: With dead ends: 4742 [2023-11-12 02:18:57,233 INFO L226 Difference]: Without dead ends: 2373 [2023-11-12 02:18:57,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:57,261 INFO L413 NwaCegarLoop]: 3523 mSDtfsCounter, 636 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 6273 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:57,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 6273 Invalid, 4 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:18:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2023-11-12 02:18:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2023-11-12 02:18:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 1684 states have (on average 1.3741092636579573) internal successors, (2314), 1728 states have internal predecessors, (2314), 600 states have call successors, (600), 87 states have call predecessors, (600), 86 states have return successors, (597), 586 states have call predecessors, (597), 597 states have call successors, (597) [2023-11-12 02:18:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 3511 transitions. [2023-11-12 02:18:57,558 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 3511 transitions. Word has length 35 [2023-11-12 02:18:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:57,558 INFO L495 AbstractCegarLoop]: Abstraction has 2373 states and 3511 transitions. [2023-11-12 02:18:57,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 02:18:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 3511 transitions. [2023-11-12 02:18:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-12 02:18:57,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:57,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:18:57,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:18:57,563 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-12 02:18:57,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash -686301534, now seen corresponding path program 1 times [2023-11-12 02:18:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565706243] [2023-11-12 02:18:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:58,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:58,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:58,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:58,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:18:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:58,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 02:18:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565706243] [2023-11-12 02:18:58,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565706243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:58,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411352778] [2023-11-12 02:18:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:58,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:58,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:58,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:58,324 INFO L87 Difference]: Start difference. First operand 2373 states and 3511 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:18:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:58,689 INFO L93 Difference]: Finished difference Result 2379 states and 3516 transitions. [2023-11-12 02:18:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:18:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2023-11-12 02:18:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:58,720 INFO L225 Difference]: With dead ends: 2379 [2023-11-12 02:18:58,720 INFO L226 Difference]: Without dead ends: 2377 [2023-11-12 02:18:58,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 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-12 02:18:58,726 INFO L413 NwaCegarLoop]: 3508 mSDtfsCounter, 3484 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3496 SdHoareTripleChecker+Valid, 10509 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:58,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3496 Valid, 10509 Invalid, 22 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:18:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2023-11-12 02:18:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2377. [2023-11-12 02:18:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 1687 states have (on average 1.3734439834024896) internal successors, (2317), 1731 states have internal predecessors, (2317), 600 states have call successors, (600), 88 states have call predecessors, (600), 87 states have return successors, (597), 586 states have call predecessors, (597), 597 states have call successors, (597) [2023-11-12 02:18:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3514 transitions. [2023-11-12 02:18:58,931 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3514 transitions. Word has length 51 [2023-11-12 02:18:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:58,932 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 3514 transitions. [2023-11-12 02:18:58,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:18:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3514 transitions. [2023-11-12 02:18:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-12 02:18:58,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:58,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-12 02:18:58,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:18:58,944 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-12 02:18:58,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 816268834, now seen corresponding path program 1 times [2023-11-12 02:18:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:58,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872925029] [2023-11-12 02:18:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:58,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:59,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:18:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:59,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 02:18:59,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:59,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872925029] [2023-11-12 02:18:59,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872925029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:59,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:59,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:18:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113393759] [2023-11-12 02:18:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:59,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:18:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:18:59,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:18:59,732 INFO L87 Difference]: Start difference. First operand 2377 states and 3514 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 02:19:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:00,068 INFO L93 Difference]: Finished difference Result 2383 states and 3519 transitions. [2023-11-12 02:19:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:00,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2023-11-12 02:19:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:00,110 INFO L225 Difference]: With dead ends: 2383 [2023-11-12 02:19:00,110 INFO L226 Difference]: Without dead ends: 2381 [2023-11-12 02:19:00,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-12 02:19:00,116 INFO L413 NwaCegarLoop]: 3511 mSDtfsCounter, 3479 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3490 SdHoareTripleChecker+Valid, 10512 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:00,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3490 Valid, 10512 Invalid, 22 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2023-11-12 02:19:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2381. [2023-11-12 02:19:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1690 states have (on average 1.3727810650887573) internal successors, (2320), 1734 states have internal predecessors, (2320), 600 states have call successors, (600), 89 states have call predecessors, (600), 88 states have return successors, (597), 586 states have call predecessors, (597), 597 states have call successors, (597) [2023-11-12 02:19:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3517 transitions. [2023-11-12 02:19:00,339 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3517 transitions. Word has length 56 [2023-11-12 02:19:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:00,340 INFO L495 AbstractCegarLoop]: Abstraction has 2381 states and 3517 transitions. [2023-11-12 02:19:00,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 02:19:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3517 transitions. [2023-11-12 02:19:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-12 02:19:00,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:00,342 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:19:00,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:19:00,343 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-12 02:19:00,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash 371828322, now seen corresponding path program 1 times [2023-11-12 02:19:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:00,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389510959] [2023-11-12 02:19:00,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:00,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:19:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-12 02:19:00,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:00,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389510959] [2023-11-12 02:19:00,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389510959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:00,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:00,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052510066] [2023-11-12 02:19:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:00,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:00,867 INFO L87 Difference]: Start difference. First operand 2381 states and 3517 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:01,209 INFO L93 Difference]: Finished difference Result 2387 states and 3522 transitions. [2023-11-12 02:19:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 61 [2023-11-12 02:19:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:01,234 INFO L225 Difference]: With dead ends: 2387 [2023-11-12 02:19:01,234 INFO L226 Difference]: Without dead ends: 2385 [2023-11-12 02:19:01,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 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-12 02:19:01,238 INFO L413 NwaCegarLoop]: 3511 mSDtfsCounter, 3479 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3489 SdHoareTripleChecker+Valid, 10512 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:01,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3489 Valid, 10512 Invalid, 22 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2023-11-12 02:19:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2023-11-12 02:19:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 1693 states have (on average 1.3721204961606615) internal successors, (2323), 1737 states have internal predecessors, (2323), 600 states have call successors, (600), 90 states have call predecessors, (600), 89 states have return successors, (597), 586 states have call predecessors, (597), 597 states have call successors, (597) [2023-11-12 02:19:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3520 transitions. [2023-11-12 02:19:01,442 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3520 transitions. Word has length 61 [2023-11-12 02:19:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:01,444 INFO L495 AbstractCegarLoop]: Abstraction has 2385 states and 3520 transitions. [2023-11-12 02:19:01,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3520 transitions. [2023-11-12 02:19:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-12 02:19:01,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:01,448 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-11-12 02:19:01,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:19:01,449 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-12 02:19:01,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:01,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1871280670, now seen corresponding path program 1 times [2023-11-12 02:19:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:01,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781366630] [2023-11-12 02:19:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:19:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:19:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-12 02:19:01,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:01,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781366630] [2023-11-12 02:19:01,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781366630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:01,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:01,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:01,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923064233] [2023-11-12 02:19:01,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:01,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:01,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:01,996 INFO L87 Difference]: Start difference. First operand 2385 states and 3520 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:02,274 INFO L93 Difference]: Finished difference Result 2391 states and 3525 transitions. [2023-11-12 02:19:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 66 [2023-11-12 02:19:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:02,302 INFO L225 Difference]: With dead ends: 2391 [2023-11-12 02:19:02,302 INFO L226 Difference]: Without dead ends: 2389 [2023-11-12 02:19:02,305 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-12 02:19:02,306 INFO L413 NwaCegarLoop]: 3511 mSDtfsCounter, 3479 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 10512 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:02,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 10512 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2023-11-12 02:19:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2389. [2023-11-12 02:19:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 1696 states have (on average 1.3714622641509433) internal successors, (2326), 1740 states have internal predecessors, (2326), 600 states have call successors, (600), 91 states have call predecessors, (600), 90 states have return successors, (597), 586 states have call predecessors, (597), 597 states have call successors, (597) [2023-11-12 02:19:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3523 transitions. [2023-11-12 02:19:02,514 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3523 transitions. Word has length 66 [2023-11-12 02:19:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:02,516 INFO L495 AbstractCegarLoop]: Abstraction has 2389 states and 3523 transitions. [2023-11-12 02:19:02,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3523 transitions. [2023-11-12 02:19:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-12 02:19:02,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:02,518 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2023-11-12 02:19:02,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:19:02,518 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-12 02:19:02,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash 149319202, now seen corresponding path program 1 times [2023-11-12 02:19:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:02,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057428284] [2023-11-12 02:19:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:19:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:19:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-12 02:19:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057428284] [2023-11-12 02:19:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057428284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329474779] [2023-11-12 02:19:03,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:03,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:03,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:03,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:03,075 INFO L87 Difference]: Start difference. First operand 2389 states and 3523 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:03,368 INFO L93 Difference]: Finished difference Result 2457 states and 3591 transitions. [2023-11-12 02:19:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:03,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 71 [2023-11-12 02:19:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:03,390 INFO L225 Difference]: With dead ends: 2457 [2023-11-12 02:19:03,390 INFO L226 Difference]: Without dead ends: 2455 [2023-11-12 02:19:03,393 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-12 02:19:03,394 INFO L413 NwaCegarLoop]: 3528 mSDtfsCounter, 1100 mSDsluCounter, 9469 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 12997 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:03,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 12997 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2023-11-12 02:19:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2455. [2023-11-12 02:19:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2455 states, 1743 states have (on average 1.3654618473895583) internal successors, (2380), 1787 states have internal predecessors, (2380), 606 states have call successors, (606), 104 states have call predecessors, (606), 103 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 3589 transitions. [2023-11-12 02:19:03,602 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 3589 transitions. Word has length 71 [2023-11-12 02:19:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:03,602 INFO L495 AbstractCegarLoop]: Abstraction has 2455 states and 3589 transitions. [2023-11-12 02:19:03,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3589 transitions. [2023-11-12 02:19:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-12 02:19:03,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:03,604 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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] [2023-11-12 02:19:03,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:19:03,605 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-12 02:19:03,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1222307559, now seen corresponding path program 1 times [2023-11-12 02:19:03,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:03,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221840667] [2023-11-12 02:19:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:19:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:19:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:19:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:19:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-12 02:19:04,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221840667] [2023-11-12 02:19:04,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221840667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:04,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:04,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296051713] [2023-11-12 02:19:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:04,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:04,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:04,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:04,162 INFO L87 Difference]: Start difference. First operand 2455 states and 3589 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:04,440 INFO L93 Difference]: Finished difference Result 2461 states and 3594 transitions. [2023-11-12 02:19:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:04,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 91 [2023-11-12 02:19:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:04,463 INFO L225 Difference]: With dead ends: 2461 [2023-11-12 02:19:04,463 INFO L226 Difference]: Without dead ends: 2459 [2023-11-12 02:19:04,466 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-12 02:19:04,467 INFO L413 NwaCegarLoop]: 3511 mSDtfsCounter, 3467 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3474 SdHoareTripleChecker+Valid, 10512 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:04,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3474 Valid, 10512 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2023-11-12 02:19:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2459. [2023-11-12 02:19:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1746 states have (on average 1.3648339060710195) internal successors, (2383), 1790 states have internal predecessors, (2383), 606 states have call successors, (606), 105 states have call predecessors, (606), 104 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3592 transitions. [2023-11-12 02:19:04,840 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3592 transitions. Word has length 91 [2023-11-12 02:19:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:04,842 INFO L495 AbstractCegarLoop]: Abstraction has 2459 states and 3592 transitions. [2023-11-12 02:19:04,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3592 transitions. [2023-11-12 02:19:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-12 02:19:04,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:04,849 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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] [2023-11-12 02:19:04,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:19:04,849 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-12 02:19:04,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1856732363, now seen corresponding path program 1 times [2023-11-12 02:19:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727869284] [2023-11-12 02:19:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:19:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:19:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:19:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:19:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:19:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-12 02:19:05,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727869284] [2023-11-12 02:19:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727869284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:05,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063542988] [2023-11-12 02:19:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:05,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:05,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:05,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:05,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:05,413 INFO L87 Difference]: Start difference. First operand 2459 states and 3592 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:05,688 INFO L93 Difference]: Finished difference Result 2465 states and 3597 transitions. [2023-11-12 02:19:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:05,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 96 [2023-11-12 02:19:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:05,710 INFO L225 Difference]: With dead ends: 2465 [2023-11-12 02:19:05,711 INFO L226 Difference]: Without dead ends: 2463 [2023-11-12 02:19:05,713 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-12 02:19:05,714 INFO L413 NwaCegarLoop]: 3511 mSDtfsCounter, 3467 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3473 SdHoareTripleChecker+Valid, 10512 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:05,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3473 Valid, 10512 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2023-11-12 02:19:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2463. [2023-11-12 02:19:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 1749 states have (on average 1.3642081189251) internal successors, (2386), 1793 states have internal predecessors, (2386), 606 states have call successors, (606), 106 states have call predecessors, (606), 105 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3595 transitions. [2023-11-12 02:19:05,945 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3595 transitions. Word has length 96 [2023-11-12 02:19:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:05,946 INFO L495 AbstractCegarLoop]: Abstraction has 2463 states and 3595 transitions. [2023-11-12 02:19:05,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3595 transitions. [2023-11-12 02:19:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-12 02:19:05,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:05,949 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 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] [2023-11-12 02:19:05,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:19:05,949 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-12 02:19:05,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash 796132706, now seen corresponding path program 1 times [2023-11-12 02:19:05,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:05,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442030233] [2023-11-12 02:19:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:19:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:19:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:19:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:19:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-12 02:19:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442030233] [2023-11-12 02:19:06,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442030233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:06,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:06,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308464920] [2023-11-12 02:19:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:06,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:06,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:06,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:06,569 INFO L87 Difference]: Start difference. First operand 2463 states and 3595 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:06,933 INFO L93 Difference]: Finished difference Result 2469 states and 3600 transitions. [2023-11-12 02:19:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:06,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 86 [2023-11-12 02:19:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:06,969 INFO L225 Difference]: With dead ends: 2469 [2023-11-12 02:19:06,969 INFO L226 Difference]: Without dead ends: 2467 [2023-11-12 02:19:06,972 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-12 02:19:06,974 INFO L413 NwaCegarLoop]: 3511 mSDtfsCounter, 3479 mSDsluCounter, 7001 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3484 SdHoareTripleChecker+Valid, 10512 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:06,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3484 Valid, 10512 Invalid, 22 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2023-11-12 02:19:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2467. [2023-11-12 02:19:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 1752 states have (on average 1.3635844748858448) internal successors, (2389), 1796 states have internal predecessors, (2389), 606 states have call successors, (606), 107 states have call predecessors, (606), 106 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3598 transitions. [2023-11-12 02:19:07,286 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3598 transitions. Word has length 86 [2023-11-12 02:19:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:07,288 INFO L495 AbstractCegarLoop]: Abstraction has 2467 states and 3598 transitions. [2023-11-12 02:19:07,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3598 transitions. [2023-11-12 02:19:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-12 02:19:07,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:07,292 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:07,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:19:07,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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-12 02:19:07,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:07,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1408155274, now seen corresponding path program 1 times [2023-11-12 02:19:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:07,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112692516] [2023-11-12 02:19:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:07,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:19:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:19:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:19:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-12 02:19:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:19:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:19:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-12 02:19:08,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112692516] [2023-11-12 02:19:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112692516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:08,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:19:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13438986] [2023-11-12 02:19:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:08,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:19:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:08,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:19:08,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:19:08,220 INFO L87 Difference]: Start difference. First operand 2467 states and 3598 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-12 02:19:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:14,792 INFO L93 Difference]: Finished difference Result 2492 states and 3639 transitions. [2023-11-12 02:19:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:19:14,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2023-11-12 02:19:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:14,810 INFO L225 Difference]: With dead ends: 2492 [2023-11-12 02:19:14,810 INFO L226 Difference]: Without dead ends: 2490 [2023-11-12 02:19:14,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:19:14,813 INFO L413 NwaCegarLoop]: 2304 mSDtfsCounter, 1945 mSDsluCounter, 6617 mSDsCounter, 0 mSdLazyCounter, 5984 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 8921 SdHoareTripleChecker+Invalid, 6590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 5984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:14,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 8921 Invalid, 6590 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [606 Valid, 5984 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-11-12 02:19:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2023-11-12 02:19:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2465. [2023-11-12 02:19:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 1751 states have (on average 1.3632210165619645) internal successors, (2387), 1794 states have internal predecessors, (2387), 606 states have call successors, (606), 107 states have call predecessors, (606), 106 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3596 transitions. [2023-11-12 02:19:15,041 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3596 transitions. Word has length 107 [2023-11-12 02:19:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:15,041 INFO L495 AbstractCegarLoop]: Abstraction has 2465 states and 3596 transitions. [2023-11-12 02:19:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-12 02:19:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3596 transitions. [2023-11-12 02:19:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-12 02:19:15,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:15,043 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 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] [2023-11-12 02:19:15,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:19:15,044 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-12 02:19:15,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -765395550, now seen corresponding path program 1 times [2023-11-12 02:19:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711517811] [2023-11-12 02:19:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:19:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:19:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:19:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:19:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:19:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:19:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-12 02:19:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711517811] [2023-11-12 02:19:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711517811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913947020] [2023-11-12 02:19:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:15,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:15,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:15,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:15,525 INFO L87 Difference]: Start difference. First operand 2465 states and 3596 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:15,802 INFO L93 Difference]: Finished difference Result 2471 states and 3601 transitions. [2023-11-12 02:19:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 91 [2023-11-12 02:19:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:15,829 INFO L225 Difference]: With dead ends: 2471 [2023-11-12 02:19:15,829 INFO L226 Difference]: Without dead ends: 2469 [2023-11-12 02:19:15,832 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-12 02:19:15,833 INFO L413 NwaCegarLoop]: 3509 mSDtfsCounter, 3477 mSDsluCounter, 6997 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3481 SdHoareTripleChecker+Valid, 10506 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:15,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3481 Valid, 10506 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2023-11-12 02:19:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2469. [2023-11-12 02:19:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 1754 states have (on average 1.362599771949829) internal successors, (2390), 1797 states have internal predecessors, (2390), 606 states have call successors, (606), 108 states have call predecessors, (606), 107 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3599 transitions. [2023-11-12 02:19:16,076 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3599 transitions. Word has length 91 [2023-11-12 02:19:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:16,076 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 3599 transitions. [2023-11-12 02:19:16,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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-12 02:19:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3599 transitions. [2023-11-12 02:19:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-12 02:19:16,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:16,080 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 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] [2023-11-12 02:19:16,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:19:16,080 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-12 02:19:16,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash -606916839, now seen corresponding path program 1 times [2023-11-12 02:19:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:16,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148395788] [2023-11-12 02:19:16,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:16,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:19:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:19:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:19:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:19:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:19:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:19:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-12 02:19:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-12 02:19:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-11-12 02:19:16,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:16,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148395788] [2023-11-12 02:19:16,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148395788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:16,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:16,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580605447] [2023-11-12 02:19:16,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:16,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:16,604 INFO L87 Difference]: Start difference. First operand 2469 states and 3599 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:19:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:16,990 INFO L93 Difference]: Finished difference Result 2475 states and 3604 transitions. [2023-11-12 02:19:16,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:16,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2023-11-12 02:19:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:17,010 INFO L225 Difference]: With dead ends: 2475 [2023-11-12 02:19:17,010 INFO L226 Difference]: Without dead ends: 2473 [2023-11-12 02:19:17,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 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-12 02:19:17,014 INFO L413 NwaCegarLoop]: 3509 mSDtfsCounter, 3465 mSDsluCounter, 6997 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3468 SdHoareTripleChecker+Valid, 10506 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:17,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3468 Valid, 10506 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2023-11-12 02:19:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2473. [2023-11-12 02:19:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 1757 states have (on average 1.3619806488332384) internal successors, (2393), 1800 states have internal predecessors, (2393), 606 states have call successors, (606), 109 states have call predecessors, (606), 108 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3602 transitions. [2023-11-12 02:19:17,253 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3602 transitions. Word has length 111 [2023-11-12 02:19:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:17,255 INFO L495 AbstractCegarLoop]: Abstraction has 2473 states and 3602 transitions. [2023-11-12 02:19:17,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:19:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3602 transitions. [2023-11-12 02:19:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-12 02:19:17,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:17,257 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 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] [2023-11-12 02:19:17,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:19:17,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:19:17,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:17,258 INFO L85 PathProgramCache]: Analyzing trace with hash 949255627, now seen corresponding path program 1 times [2023-11-12 02:19:17,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:17,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508833686] [2023-11-12 02:19:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:19:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:19:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:19:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:19:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:19:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:19:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-12 02:19:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-12 02:19:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:19:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2023-11-12 02:19:17,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:17,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508833686] [2023-11-12 02:19:17,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508833686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:17,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:17,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015819585] [2023-11-12 02:19:17,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:17,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:17,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:17,793 INFO L87 Difference]: Start difference. First operand 2473 states and 3602 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:18,090 INFO L93 Difference]: Finished difference Result 2479 states and 3607 transitions. [2023-11-12 02:19:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 116 [2023-11-12 02:19:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:18,105 INFO L225 Difference]: With dead ends: 2479 [2023-11-12 02:19:18,105 INFO L226 Difference]: Without dead ends: 2477 [2023-11-12 02:19:18,107 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-12 02:19:18,108 INFO L413 NwaCegarLoop]: 3509 mSDtfsCounter, 3465 mSDsluCounter, 6997 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3467 SdHoareTripleChecker+Valid, 10506 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:18,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3467 Valid, 10506 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2023-11-12 02:19:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2477. [2023-11-12 02:19:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 1760 states have (on average 1.3613636363636363) internal successors, (2396), 1803 states have internal predecessors, (2396), 606 states have call successors, (606), 110 states have call predecessors, (606), 109 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3605 transitions. [2023-11-12 02:19:18,372 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3605 transitions. Word has length 116 [2023-11-12 02:19:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:18,374 INFO L495 AbstractCegarLoop]: Abstraction has 2477 states and 3605 transitions. [2023-11-12 02:19:18,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3605 transitions. [2023-11-12 02:19:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-12 02:19:18,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:18,377 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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] [2023-11-12 02:19:18,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:19:18,377 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:19:18,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:18,378 INFO L85 PathProgramCache]: Analyzing trace with hash -162552295, now seen corresponding path program 1 times [2023-11-12 02:19:18,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:18,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649459415] [2023-11-12 02:19:18,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:19:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:19:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:19:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:19:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:19:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:19:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-12 02:19:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-12 02:19:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:19:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-12 02:19:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2023-11-12 02:19:18,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:18,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649459415] [2023-11-12 02:19:18,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649459415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:18,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:18,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:18,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427335115] [2023-11-12 02:19:18,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:18,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:18,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:18,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:18,954 INFO L87 Difference]: Start difference. First operand 2477 states and 3605 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:19,278 INFO L93 Difference]: Finished difference Result 2483 states and 3610 transitions. [2023-11-12 02:19:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:19,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 121 [2023-11-12 02:19:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:19,292 INFO L225 Difference]: With dead ends: 2483 [2023-11-12 02:19:19,293 INFO L226 Difference]: Without dead ends: 2479 [2023-11-12 02:19:19,297 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-12 02:19:19,298 INFO L413 NwaCegarLoop]: 3509 mSDtfsCounter, 3465 mSDsluCounter, 6997 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3466 SdHoareTripleChecker+Valid, 10506 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:19,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3466 Valid, 10506 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2023-11-12 02:19:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2479. [2023-11-12 02:19:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 1762 states have (on average 1.3603859250851305) internal successors, (2397), 1804 states have internal predecessors, (2397), 606 states have call successors, (606), 111 states have call predecessors, (606), 109 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2023-11-12 02:19:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3606 transitions. [2023-11-12 02:19:19,568 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3606 transitions. Word has length 121 [2023-11-12 02:19:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:19,568 INFO L495 AbstractCegarLoop]: Abstraction has 2479 states and 3606 transitions. [2023-11-12 02:19:19,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3606 transitions. [2023-11-12 02:19:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-12 02:19:19,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:19,572 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 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] [2023-11-12 02:19:19,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:19:19,572 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:19:19,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1552193099, now seen corresponding path program 1 times [2023-11-12 02:19:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:19,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091823985] [2023-11-12 02:19:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:19:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:19:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:19:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:19:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:19:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:19:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-12 02:19:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:19:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:19:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:19:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:19:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:19:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:19:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:19:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-12 02:19:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-12 02:19:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:19:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-12 02:19:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-12 02:19:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:19:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2023-11-12 02:19:20,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:19:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091823985] [2023-11-12 02:19:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091823985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:19:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:19:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:19:20,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307071398] [2023-11-12 02:19:20,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:19:20,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:19:20,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:19:20,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:19:20,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:19:20,159 INFO L87 Difference]: Start difference. First operand 2479 states and 3606 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:19:20,482 INFO L93 Difference]: Finished difference Result 2479 states and 3606 transitions. [2023-11-12 02:19:20,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:19:20,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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 126 [2023-11-12 02:19:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:19:20,495 INFO L225 Difference]: With dead ends: 2479 [2023-11-12 02:19:20,495 INFO L226 Difference]: Without dead ends: 2391 [2023-11-12 02:19:20,499 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-12 02:19:20,500 INFO L413 NwaCegarLoop]: 3507 mSDtfsCounter, 3461 mSDsluCounter, 6996 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3461 SdHoareTripleChecker+Valid, 10503 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:19:20,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3461 Valid, 10503 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:19:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2023-11-12 02:19:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2023-11-12 02:19:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 1704 states have (on average 1.3703051643192488) internal successors, (2335), 1745 states have internal predecessors, (2335), 589 states have call successors, (589), 97 states have call predecessors, (589), 97 states have return successors, (588), 577 states have call predecessors, (588), 588 states have call successors, (588) [2023-11-12 02:19:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3512 transitions. [2023-11-12 02:19:20,769 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3512 transitions. Word has length 126 [2023-11-12 02:19:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:19:20,769 INFO L495 AbstractCegarLoop]: Abstraction has 2391 states and 3512 transitions. [2023-11-12 02:19:20,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-12 02:19:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3512 transitions. [2023-11-12 02:19:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-12 02:19:20,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:19:20,773 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:19:20,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:19:20,773 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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-12 02:19:20,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:19:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1806580211, now seen corresponding path program 1 times [2023-11-12 02:19:20,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:19:20,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200683548] [2023-11-12 02:19:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:19:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:19:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat