./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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.3.0-?-551b009-m [2025-01-09 19:59:05,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 19:59:05,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 19:59:05,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 19:59:05,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 19:59:05,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 19:59:05,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 19:59:05,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 19:59:05,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 19:59:05,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 19:59:05,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 19:59:05,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 19:59:05,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 19:59:05,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 19:59:05,202 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 19:59:05,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 19:59:05,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 19:59:05,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 19:59:05,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 19:59:05,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:59:05,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 19:59:05,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 19:59:05,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 19:59:05,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 19:59:05,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:59:05,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 19:59:05,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 [2025-01-09 19:59:05,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 19:59:05,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 19:59:05,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 19:59:05,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 19:59:05,420 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 19:59:05,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i [2025-01-09 19:59:06,592 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b01c2f41/20fcbc101f8744be841d610189af1927/FLAG972cc11ab [2025-01-09 19:59:07,153 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 19:59:07,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i [2025-01-09 19:59:07,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b01c2f41/20fcbc101f8744be841d610189af1927/FLAG972cc11ab [2025-01-09 19:59:07,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b01c2f41/20fcbc101f8744be841d610189af1927 [2025-01-09 19:59:07,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 19:59:07,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 19:59:07,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 19:59:07,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 19:59:07,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 19:59:07,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:59:07" (1/1) ... [2025-01-09 19:59:07,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:07, skipping insertion in model container [2025-01-09 19:59:07,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:59:07" (1/1) ... [2025-01-09 19:59:07,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 19:59:09,300 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339479,339492] [2025-01-09 19:59:09,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339648,339661] [2025-01-09 19:59:09,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339815,339828] [2025-01-09 19:59:09,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339983,339996] [2025-01-09 19:59:09,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 19:59:09,335 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 19:59:09,409 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] [2025-01-09 19:59:09,411 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] [2025-01-09 19:59:09,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [5322] [2025-01-09 19:59:09,414 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] [2025-01-09 19:59:09,414 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] [2025-01-09 19:59:09,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movb %1,%0": "=q" (ret): "m" (*((unsigned char volatile *)addr)): "memory"); [5502] [2025-01-09 19:59:09,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %1,%0": "=r" (ret): "m" (*((unsigned int volatile *)addr)): "memory"); [5510] [2025-01-09 19:59:09,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %0,%1": : "r" (val), "m" (*((unsigned int volatile *)addr)): "memory"); [5517] [2025-01-09 19:59:09,423 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] [2025-01-09 19:59:09,425 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] [2025-01-09 19:59:09,426 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] [2025-01-09 19:59:09,426 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] [2025-01-09 19:59:09,427 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] [2025-01-09 19:59:09,429 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] [2025-01-09 19:59:09,455 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("": : : "memory"); [6769] [2025-01-09 19:59:09,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [7540] [2025-01-09 19:59:09,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [7550] [2025-01-09 19:59:09,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [7565] [2025-01-09 19:59:09,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8351] [2025-01-09 19:59:09,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8384] [2025-01-09 19:59:09,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8407] [2025-01-09 19:59:09,530 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8648] [2025-01-09 19:59:09,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8678] [2025-01-09 19:59:09,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [8691] [2025-01-09 19:59:09,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339479,339492] [2025-01-09 19:59:09,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339648,339661] [2025-01-09 19:59:09,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339815,339828] [2025-01-09 19:59:09,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i[339983,339996] [2025-01-09 19:59:09,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 19:59:09,741 INFO L204 MainTranslator]: Completed translation [2025-01-09 19:59:09,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09 WrapperNode [2025-01-09 19:59:09,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 19:59:09,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 19:59:09,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 19:59:09,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 19:59:09,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:09,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,014 INFO L138 Inliner]: procedures = 432, calls = 2152, calls flagged for inlining = 207, calls inlined = 190, statements flattened = 5992 [2025-01-09 19:59:10,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 19:59:10,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 19:59:10,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 19:59:10,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 19:59:10,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,766 INFO L175 MemorySlicer]: Split 1014 memory accesses to 20 slices as follows [1, 4, 7, 4, 7, 7, 15, 4, 2, 2, 834, 7, 8, 19, 7, 1, 2, 71, 10, 2]. 82 percent of accesses are in the largest equivalence class. The 91 initializations are split as follows [0, 0, 0, 4, 0, 7, 15, 4, 0, 0, 30, 7, 8, 0, 7, 1, 2, 0, 6, 0]. The 457 writes are split as follows [0, 4, 2, 0, 2, 0, 0, 0, 1, 1, 364, 0, 0, 11, 0, 0, 0, 71, 1, 0]. [2025-01-09 19:59:10,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 19:59:10,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 19:59:10,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 19:59:10,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 19:59:10,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (1/1) ... [2025-01-09 19:59:10,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:59:10,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:59:11,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 19:59:11,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 19:59:11,052 INFO L130 BoogieDeclarations]: Found specification of procedure BB_GET_BIT2 [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure BB_GET_BIT2 [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_open [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_open [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_poll_stop [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_poll_stop [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure is_quattro_p [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure is_quattro_p [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_close [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_close [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 19:59:11,053 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-01-09 19:59:11,053 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_set_multicast [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_set_multicast [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure BB_PUT_BIT [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure BB_PUT_BIT [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_begin_auto_negotiation [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_begin_auto_negotiation [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_get_counters [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_get_counters [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_happy_lock_of_happy_meal [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_happy_lock_of_happy_meal [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_happy_lock_of_happy_meal [2025-01-09 19:59:11,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_happy_lock_of_happy_meal [2025-01-09 19:59:11,054 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-01-09 19:59:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-01-09 19:59:11,055 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 19:59:11,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 19:59:11,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 19:59:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure set_happy_link_modes [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure set_happy_link_modes [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_tcvr_reset [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_tcvr_reset [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_tx_timeout [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_tx_timeout [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure dma_map_single_attrs [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_map_single_attrs [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_tcvr_read [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_tcvr_read [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 19:59:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 19:59:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-01-09 19:59:11,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-01-09 19:59:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 19:59:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 19:59:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 19:59:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 19:59:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 19:59:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 19:59:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 19:59:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 19:59:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 19:59:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 19:59:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 19:59:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 19:59:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 19:59:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 19:59:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_map_page [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_map_page [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure is_lucent_phy [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure is_lucent_phy [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure hme_read_desc32 [2025-01-09 19:59:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure hme_read_desc32 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-01-09 19:59:11,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-01-09 19:59:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 19:59:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 19:59:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 19:59:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 19:59:11,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_clean_rings [2025-01-09 19:59:11,068 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_clean_rings [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 19:59:11,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 19:59:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2025-01-09 19:59:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 19:59:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure kmemcheck_mark_initialized [2025-01-09 19:59:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure kmemcheck_mark_initialized [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2025-01-09 19:59:11,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 19:59:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-01-09 19:59:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-01-09 19:59:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_unmap_page [2025-01-09 19:59:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_unmap_page [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_single_attrs [2025-01-09 19:59:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_single_attrs [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-01-09 19:59:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 19:59:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-01-09 19:59:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_stop [2025-01-09 19:59:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_stop [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-01-09 19:59:11,073 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-01-09 19:59:11,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_pci_remove [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_pci_remove [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_63 [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_63 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_init [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_init [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_tcvr_write [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_tcvr_write [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_64 [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_64 [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 19:59:11,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 19:59:11,074 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2025-01-09 19:59:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure ethtool_cmd_speed [2025-01-09 19:59:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ethtool_cmd_speed [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2025-01-09 19:59:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_page [2025-01-09 19:59:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_page [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2025-01-09 19:59:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2025-01-09 19:59:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2025-01-09 19:59:11,076 INFO L130 BoogieDeclarations]: Found specification of procedure happy_meal_transceiver_check [2025-01-09 19:59:11,076 INFO L138 BoogieDeclarations]: Found implementation of procedure happy_meal_transceiver_check [2025-01-09 19:59:11,826 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 19:59:11,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 19:59:11,988 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 19:59:22,052 INFO L? ?]: Removed 2904 outVars from TransFormulas that were not future-live. [2025-01-09 19:59:22,053 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 19:59:22,102 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 19:59:22,103 INFO L312 CfgBuilder]: Removed 21 assume(true) statements. [2025-01-09 19:59:22,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:59:22 BoogieIcfgContainer [2025-01-09 19:59:22,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 19:59:22,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 19:59:22,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 19:59:22,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 19:59:22,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:59:07" (1/3) ... [2025-01-09 19:59:22,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba75b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:59:22, skipping insertion in model container [2025-01-09 19:59:22,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:09" (2/3) ... [2025-01-09 19:59:22,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba75b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:59:22, skipping insertion in model container [2025-01-09 19:59:22,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:59:22" (3/3) ... [2025-01-09 19:59:22,127 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i [2025-01-09 19:59:22,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 19:59:22,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.14_linux-kernel-locking-spinlock_drivers-net-ethernet-sun-sunhme.cil.i that has 127 procedures, 2730 locations, 1 initial locations, 43 loop locations, and 3 error locations. [2025-01-09 19:59:22,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 19:59:22,313 INFO L333 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, 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;@5f7b0eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 19:59:22,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 19:59:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 2562 states, 1866 states have (on average 1.3670953912111468) internal successors, (2551), 1911 states have internal predecessors, (2551), 604 states have call successors, (604), 89 states have call predecessors, (604), 88 states have return successors, (600), 589 states have call predecessors, (600), 600 states have call successors, (600) [2025-01-09 19:59:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 19:59:22,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:59:22,331 INFO L218 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] [2025-01-09 19:59:22,331 INFO L396 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)] === [2025-01-09 19:59:22,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:59:22,335 INFO L85 PathProgramCache]: Analyzing trace with hash -817300777, now seen corresponding path program 1 times [2025-01-09 19:59:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:59:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259552803] [2025-01-09 19:59:22,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:59:22,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:59:26,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 19:59:26,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 19:59:26,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:59:26,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:59:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 19:59:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:59:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259552803] [2025-01-09 19:59:27,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259552803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:59:27,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:59:27,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:59:27,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280441759] [2025-01-09 19:59:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:59:27,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:59:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:59:27,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:59:27,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:59:27,097 INFO L87 Difference]: Start difference. First operand has 2562 states, 1866 states have (on average 1.3670953912111468) internal successors, (2551), 1911 states have internal predecessors, (2551), 604 states have call successors, (604), 89 states have call predecessors, (604), 88 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) [2025-01-09 19:59:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:59:27,365 INFO L93 Difference]: Finished difference Result 5094 states and 7615 transitions. [2025-01-09 19:59:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:59:27,367 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 [2025-01-09 19:59:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:59:27,400 INFO L225 Difference]: With dead ends: 5094 [2025-01-09 19:59:27,400 INFO L226 Difference]: Without dead ends: 2549 [2025-01-09 19:59:27,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:59:27,436 INFO L435 NwaCegarLoop]: 3700 mSDtfsCounter, 0 mSDsluCounter, 3696 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7396 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:59:27,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7396 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:59:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2025-01-09 19:59:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2025-01-09 19:59:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 1859 states have (on average 1.3399677245831092) internal successors, (2491), 1903 states have internal predecessors, (2491), 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) [2025-01-09 19:59:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3688 transitions. [2025-01-09 19:59:27,633 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3688 transitions. Word has length 35 [2025-01-09 19:59:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:59:27,633 INFO L471 AbstractCegarLoop]: Abstraction has 2549 states and 3688 transitions. [2025-01-09 19:59:27,633 INFO L472 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) [2025-01-09 19:59:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3688 transitions. [2025-01-09 19:59:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 19:59:27,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:59:27,635 INFO L218 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] [2025-01-09 19:59:27,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 19:59:27,635 INFO L396 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)] === [2025-01-09 19:59:27,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:59:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1785505893, now seen corresponding path program 1 times [2025-01-09 19:59:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:59:27,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386240734] [2025-01-09 19:59:27,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:59:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:59:31,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 19:59:31,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 19:59:31,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:59:31,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:59:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 19:59:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:59:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386240734] [2025-01-09 19:59:32,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386240734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:59:32,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:59:32,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:59:32,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474850324] [2025-01-09 19:59:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:59:32,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:59:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:59:32,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:59:32,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:59:32,061 INFO L87 Difference]: Start difference. First operand 2549 states and 3688 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) [2025-01-09 19:59:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:59:32,479 INFO L93 Difference]: Finished difference Result 2555 states and 3693 transitions. [2025-01-09 19:59:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:59:32,479 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 [2025-01-09 19:59:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:59:32,494 INFO L225 Difference]: With dead ends: 2555 [2025-01-09 19:59:32,494 INFO L226 Difference]: Without dead ends: 2553 [2025-01-09 19:59:32,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:59:32,498 INFO L435 NwaCegarLoop]: 3685 mSDtfsCounter, 3669 mSDsluCounter, 7356 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3670 SdHoareTripleChecker+Valid, 11041 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:59:32,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3670 Valid, 11041 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:59:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2025-01-09 19:59:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2553. [2025-01-09 19:59:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 1862 states have (on average 1.339419978517723) internal successors, (2494), 1906 states have internal predecessors, (2494), 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) [2025-01-09 19:59:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3691 transitions. [2025-01-09 19:59:32,581 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3691 transitions. Word has length 51 [2025-01-09 19:59:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:59:32,581 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 3691 transitions. [2025-01-09 19:59:32,581 INFO L472 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) [2025-01-09 19:59:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3691 transitions. [2025-01-09 19:59:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 19:59:32,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:59:32,584 INFO L218 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] [2025-01-09 19:59:32,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 19:59:32,584 INFO L396 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)] === [2025-01-09 19:59:32,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:59:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash -3616603, now seen corresponding path program 1 times [2025-01-09 19:59:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:59:32,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911157231] [2025-01-09 19:59:32,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:59:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:59:36,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 19:59:36,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 19:59:36,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:59:36,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:59:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 19:59:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:59:36,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911157231] [2025-01-09 19:59:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911157231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:59:36,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:59:36,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:59:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112266162] [2025-01-09 19:59:36,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:59:36,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:59:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:59:36,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:59:36,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:59:36,979 INFO L87 Difference]: Start difference. First operand 2553 states and 3691 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) [2025-01-09 19:59:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:59:37,365 INFO L93 Difference]: Finished difference Result 2559 states and 3696 transitions. [2025-01-09 19:59:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:59:37,365 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 [2025-01-09 19:59:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:59:37,378 INFO L225 Difference]: With dead ends: 2559 [2025-01-09 19:59:37,378 INFO L226 Difference]: Without dead ends: 2557 [2025-01-09 19:59:37,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:59:37,379 INFO L435 NwaCegarLoop]: 3688 mSDtfsCounter, 3665 mSDsluCounter, 7357 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3666 SdHoareTripleChecker+Valid, 11045 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:59:37,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3666 Valid, 11045 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:59:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2025-01-09 19:59:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2557. [2025-01-09 19:59:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 1865 states have (on average 1.3388739946380697) internal successors, (2497), 1909 states have internal predecessors, (2497), 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) [2025-01-09 19:59:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3694 transitions. [2025-01-09 19:59:37,454 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3694 transitions. Word has length 56 [2025-01-09 19:59:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:59:37,455 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 3694 transitions. [2025-01-09 19:59:37,455 INFO L472 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) [2025-01-09 19:59:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3694 transitions. [2025-01-09 19:59:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 19:59:37,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:59:37,456 INFO L218 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] [2025-01-09 19:59:37,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 19:59:37,457 INFO L396 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)] === [2025-01-09 19:59:37,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:59:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash 320399397, now seen corresponding path program 1 times [2025-01-09 19:59:37,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:59:37,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805706599] [2025-01-09 19:59:37,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:59:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:59:41,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 19:59:41,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 19:59:41,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:59:41,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:59:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 19:59:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:59:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805706599] [2025-01-09 19:59:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805706599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:59:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:59:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:59:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314226181] [2025-01-09 19:59:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:59:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:59:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:59:41,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:59:41,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:59:41,597 INFO L87 Difference]: Start difference. First operand 2557 states and 3694 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) [2025-01-09 19:59:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:59:41,989 INFO L93 Difference]: Finished difference Result 2563 states and 3699 transitions. [2025-01-09 19:59:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:59:41,990 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 [2025-01-09 19:59:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:59:42,001 INFO L225 Difference]: With dead ends: 2563 [2025-01-09 19:59:42,001 INFO L226 Difference]: Without dead ends: 2561 [2025-01-09 19:59:42,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:59:42,003 INFO L435 NwaCegarLoop]: 3688 mSDtfsCounter, 3664 mSDsluCounter, 7357 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3665 SdHoareTripleChecker+Valid, 11045 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:59:42,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3665 Valid, 11045 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:59:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-01-09 19:59:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2561. [2025-01-09 19:59:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 1868 states have (on average 1.3383297644539613) internal successors, (2500), 1912 states have internal predecessors, (2500), 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) [2025-01-09 19:59:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3697 transitions. [2025-01-09 19:59:42,076 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3697 transitions. Word has length 61 [2025-01-09 19:59:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:59:42,076 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 3697 transitions. [2025-01-09 19:59:42,076 INFO L472 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) [2025-01-09 19:59:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3697 transitions. [2025-01-09 19:59:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 19:59:42,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:59:42,077 INFO L218 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] [2025-01-09 19:59:42,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 19:59:42,078 INFO L396 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)] === [2025-01-09 19:59:42,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:59:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1412917147, now seen corresponding path program 1 times [2025-01-09 19:59:42,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:59:42,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263633746] [2025-01-09 19:59:42,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:59:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:59:45,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 19:59:45,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 19:59:45,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:59:45,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:59:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 19:59:46,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:59:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263633746] [2025-01-09 19:59:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263633746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:59:46,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:59:46,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:59:46,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118184854] [2025-01-09 19:59:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:59:46,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:59:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:59:46,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:59:46,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:59:46,024 INFO L87 Difference]: Start difference. First operand 2561 states and 3697 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) [2025-01-09 19:59:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:59:46,414 INFO L93 Difference]: Finished difference Result 2567 states and 3702 transitions. [2025-01-09 19:59:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:59:46,414 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 [2025-01-09 19:59:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:59:46,425 INFO L225 Difference]: With dead ends: 2567 [2025-01-09 19:59:46,426 INFO L226 Difference]: Without dead ends: 2565 [2025-01-09 19:59:46,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:59:46,428 INFO L435 NwaCegarLoop]: 3688 mSDtfsCounter, 3663 mSDsluCounter, 7357 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3664 SdHoareTripleChecker+Valid, 11045 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:59:46,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3664 Valid, 11045 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:59:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2025-01-09 19:59:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2565. [2025-01-09 19:59:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 1871 states have (on average 1.3377872795296633) internal successors, (2503), 1915 states have internal predecessors, (2503), 600 states have call successors, (600), 92 states have call predecessors, (600), 91 states have return successors, (597), 586 states have call predecessors, (597), 597 states have call successors, (597) [2025-01-09 19:59:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3700 transitions. [2025-01-09 19:59:46,504 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3700 transitions. Word has length 66 [2025-01-09 19:59:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:59:46,504 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 3700 transitions. [2025-01-09 19:59:46,504 INFO L472 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) [2025-01-09 19:59:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3700 transitions. [2025-01-09 19:59:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 19:59:46,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:59:46,505 INFO L218 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] [2025-01-09 19:59:46,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 19:59:46,505 INFO L396 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)] === [2025-01-09 19:59:46,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:59:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash -356898843, now seen corresponding path program 1 times [2025-01-09 19:59:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:59:46,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688909409] [2025-01-09 19:59:46,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:59:46,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:59:49,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 19:59:49,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 19:59:49,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:59:49,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:59:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 19:59:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:59:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688909409] [2025-01-09 19:59:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688909409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:59:50,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:59:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:59:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837367656] [2025-01-09 19:59:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:59:50,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:59:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:59:50,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:59:50,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:59:50,600 INFO L87 Difference]: Start difference. First operand 2565 states and 3700 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) [2025-01-09 19:59:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:59:51,189 INFO L93 Difference]: Finished difference Result 2634 states and 3769 transitions. [2025-01-09 19:59:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:59:51,194 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 [2025-01-09 19:59:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:59:51,211 INFO L225 Difference]: With dead ends: 2634 [2025-01-09 19:59:51,212 INFO L226 Difference]: Without dead ends: 2632 [2025-01-09 19:59:51,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:59:51,217 INFO L435 NwaCegarLoop]: 3705 mSDtfsCounter, 1131 mSDsluCounter, 9978 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 13683 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 19:59:51,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 13683 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 19:59:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2025-01-09 19:59:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2632. [2025-01-09 19:59:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 1919 states have (on average 1.3329859301719647) internal successors, (2558), 1963 states have internal predecessors, (2558), 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) [2025-01-09 19:59:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3767 transitions. [2025-01-09 19:59:51,327 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3767 transitions. Word has length 71 [2025-01-09 19:59:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:59:51,327 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 3767 transitions. [2025-01-09 19:59:51,327 INFO L472 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) [2025-01-09 19:59:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3767 transitions. [2025-01-09 19:59:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 19:59:51,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:59:51,328 INFO L218 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] [2025-01-09 19:59:51,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 19:59:51,329 INFO L396 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)] === [2025-01-09 19:59:51,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:59:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 225828598, now seen corresponding path program 1 times [2025-01-09 19:59:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:59:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545899274] [2025-01-09 19:59:51,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:59:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:59:54,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 19:59:54,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 19:59:54,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:59:54,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:59:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-09 19:59:55,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:59:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545899274] [2025-01-09 19:59:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545899274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:59:55,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:59:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:59:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409396778] [2025-01-09 19:59:55,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:59:55,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:59:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:59:55,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:59:55,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:59:55,621 INFO L87 Difference]: Start difference. First operand 2632 states and 3767 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) [2025-01-09 19:59:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:59:56,058 INFO L93 Difference]: Finished difference Result 2638 states and 3772 transitions. [2025-01-09 19:59:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:59:56,062 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 [2025-01-09 19:59:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:59:56,081 INFO L225 Difference]: With dead ends: 2638 [2025-01-09 19:59:56,082 INFO L226 Difference]: Without dead ends: 2636 [2025-01-09 19:59:56,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:59:56,085 INFO L435 NwaCegarLoop]: 3688 mSDtfsCounter, 3649 mSDsluCounter, 7357 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3650 SdHoareTripleChecker+Valid, 11045 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:59:56,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3650 Valid, 11045 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 19:59:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-01-09 19:59:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-01-09 19:59:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 1922 states have (on average 1.3324661810613945) internal successors, (2561), 1966 states have internal predecessors, (2561), 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) [2025-01-09 19:59:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3770 transitions. [2025-01-09 19:59:56,197 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3770 transitions. Word has length 91 [2025-01-09 19:59:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:59:56,198 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3770 transitions. [2025-01-09 19:59:56,198 INFO L472 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) [2025-01-09 19:59:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3770 transitions. [2025-01-09 19:59:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 19:59:56,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:59:56,202 INFO L218 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] [2025-01-09 19:59:56,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 19:59:56,202 INFO L396 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)] === [2025-01-09 19:59:56,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:59:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -133069964, now seen corresponding path program 1 times [2025-01-09 19:59:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:59:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490358010] [2025-01-09 19:59:56,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:59:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:59:59,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 20:00:00,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 20:00:00,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:00:00,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:00:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 20:00:00,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:00:00,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490358010] [2025-01-09 20:00:00,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490358010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:00:00,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:00:00,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:00:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866370149] [2025-01-09 20:00:00,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:00:00,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:00:00,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:00:00,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:00:00,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:00:00,668 INFO L87 Difference]: Start difference. First operand 2636 states and 3770 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) [2025-01-09 20:00:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:00:01,117 INFO L93 Difference]: Finished difference Result 2642 states and 3775 transitions. [2025-01-09 20:00:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:00:01,118 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 [2025-01-09 20:00:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:00:01,132 INFO L225 Difference]: With dead ends: 2642 [2025-01-09 20:00:01,133 INFO L226 Difference]: Without dead ends: 2640 [2025-01-09 20:00:01,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:00:01,135 INFO L435 NwaCegarLoop]: 3688 mSDtfsCounter, 3648 mSDsluCounter, 7357 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3649 SdHoareTripleChecker+Valid, 11045 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:00:01,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3649 Valid, 11045 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:00:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2025-01-09 20:00:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2640. [2025-01-09 20:00:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 1925 states have (on average 1.331948051948052) internal successors, (2564), 1969 states have internal predecessors, (2564), 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) [2025-01-09 20:00:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3773 transitions. [2025-01-09 20:00:01,256 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3773 transitions. Word has length 96 [2025-01-09 20:00:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:00:01,257 INFO L471 AbstractCegarLoop]: Abstraction has 2640 states and 3773 transitions. [2025-01-09 20:00:01,257 INFO L472 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) [2025-01-09 20:00:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3773 transitions. [2025-01-09 20:00:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 20:00:01,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:00:01,259 INFO L218 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] [2025-01-09 20:00:01,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:00:01,260 INFO L396 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)] === [2025-01-09 20:00:01,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:00:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash 814295013, now seen corresponding path program 1 times [2025-01-09 20:00:01,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:00:01,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65734050] [2025-01-09 20:00:01,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:00:01,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:00:04,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 20:00:04,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 20:00:04,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:00:04,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:00:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-09 20:00:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:00:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65734050] [2025-01-09 20:00:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65734050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:00:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:00:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:00:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349234283] [2025-01-09 20:00:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:00:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:00:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:00:05,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:00:05,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:00:05,522 INFO L87 Difference]: Start difference. First operand 2640 states and 3773 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) [2025-01-09 20:00:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:00:05,997 INFO L93 Difference]: Finished difference Result 2646 states and 3778 transitions. [2025-01-09 20:00:05,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:00:05,998 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 [2025-01-09 20:00:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:00:06,008 INFO L225 Difference]: With dead ends: 2646 [2025-01-09 20:00:06,008 INFO L226 Difference]: Without dead ends: 2644 [2025-01-09 20:00:06,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:00:06,009 INFO L435 NwaCegarLoop]: 3688 mSDtfsCounter, 3659 mSDsluCounter, 7357 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3660 SdHoareTripleChecker+Valid, 11045 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:00:06,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3660 Valid, 11045 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:00:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2025-01-09 20:00:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2025-01-09 20:00:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 1928 states have (on average 1.3314315352697095) internal successors, (2567), 1972 states have internal predecessors, (2567), 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) [2025-01-09 20:00:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3776 transitions. [2025-01-09 20:00:06,092 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3776 transitions. Word has length 86 [2025-01-09 20:00:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:00:06,092 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3776 transitions. [2025-01-09 20:00:06,092 INFO L472 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) [2025-01-09 20:00:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3776 transitions. [2025-01-09 20:00:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 20:00:06,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:00:06,093 INFO L218 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] [2025-01-09 20:00:06,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:00:06,093 INFO L396 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)] === [2025-01-09 20:00:06,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:00:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1047957182, now seen corresponding path program 1 times [2025-01-09 20:00:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:00:06,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953267008] [2025-01-09 20:00:06,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:00:06,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:00:09,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:00:09,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:00:09,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:00:09,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:00:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 20:00:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:00:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953267008] [2025-01-09 20:00:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953267008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:00:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:00:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:00:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338176835] [2025-01-09 20:00:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:00:10,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:00:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:00:10,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:00:10,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:00:10,275 INFO L87 Difference]: Start difference. First operand 2644 states and 3776 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:00:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:00:10,643 INFO L93 Difference]: Finished difference Result 2644 states and 3776 transitions. [2025-01-09 20:00:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:00:10,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 3 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 [2025-01-09 20:00:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:00:10,654 INFO L225 Difference]: With dead ends: 2644 [2025-01-09 20:00:10,654 INFO L226 Difference]: Without dead ends: 2642 [2025-01-09 20:00:10,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:00:10,655 INFO L435 NwaCegarLoop]: 3700 mSDtfsCounter, 1120 mSDsluCounter, 9984 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 13684 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:00:10,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 13684 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:00:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2025-01-09 20:00:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2642. [2025-01-09 20:00:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 1927 states have (on average 1.331084587441619) internal successors, (2565), 1970 states have internal predecessors, (2565), 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) [2025-01-09 20:00:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3774 transitions. [2025-01-09 20:00:10,736 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 3774 transitions. Word has length 107 [2025-01-09 20:00:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:00:10,736 INFO L471 AbstractCegarLoop]: Abstraction has 2642 states and 3774 transitions. [2025-01-09 20:00:10,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:00:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3774 transitions. [2025-01-09 20:00:10,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 20:00:10,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:00:10,738 INFO L218 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] [2025-01-09 20:00:10,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:00:10,738 INFO L396 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)] === [2025-01-09 20:00:10,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:00:10,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1037805413, now seen corresponding path program 1 times [2025-01-09 20:00:10,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:00:10,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713715689] [2025-01-09 20:00:10,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:00:10,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:00:14,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 20:00:14,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 20:00:14,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:00:14,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:00:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-09 20:00:14,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:00:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713715689] [2025-01-09 20:00:14,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713715689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:00:14,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:00:14,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:00:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733090916] [2025-01-09 20:00:14,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:00:14,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:00:14,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:00:14,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:00:14,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:00:14,690 INFO L87 Difference]: Start difference. First operand 2642 states and 3774 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) [2025-01-09 20:00:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:00:15,201 INFO L93 Difference]: Finished difference Result 2648 states and 3779 transitions. [2025-01-09 20:00:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:00:15,201 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 [2025-01-09 20:00:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:00:15,214 INFO L225 Difference]: With dead ends: 2648 [2025-01-09 20:00:15,214 INFO L226 Difference]: Without dead ends: 2646 [2025-01-09 20:00:15,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:00:15,216 INFO L435 NwaCegarLoop]: 3686 mSDtfsCounter, 3656 mSDsluCounter, 7353 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3657 SdHoareTripleChecker+Valid, 11039 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:00:15,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3657 Valid, 11039 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:00:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-01-09 20:00:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2646. [2025-01-09 20:00:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 1930 states have (on average 1.3305699481865285) internal successors, (2568), 1973 states have internal predecessors, (2568), 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) [2025-01-09 20:00:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 3777 transitions. [2025-01-09 20:00:15,300 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 3777 transitions. Word has length 91 [2025-01-09 20:00:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:00:15,300 INFO L471 AbstractCegarLoop]: Abstraction has 2646 states and 3777 transitions. [2025-01-09 20:00:15,300 INFO L472 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) [2025-01-09 20:00:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 3777 transitions. [2025-01-09 20:00:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 20:00:15,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:00:15,305 INFO L218 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] [2025-01-09 20:00:15,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:00:15,305 INFO L396 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)] === [2025-01-09 20:00:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:00:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash -704521226, now seen corresponding path program 1 times [2025-01-09 20:00:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:00:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921864150] [2025-01-09 20:00:15,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:00:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:00:18,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 20:00:18,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 20:00:18,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:00:18,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:00:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-01-09 20:00:19,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:00:19,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921864150] [2025-01-09 20:00:19,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921864150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:00:19,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:00:19,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:00:19,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043007682] [2025-01-09 20:00:19,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:00:19,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:00:19,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:00:19,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:00:19,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:00:19,142 INFO L87 Difference]: Start difference. First operand 2646 states and 3777 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) [2025-01-09 20:00:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:00:19,559 INFO L93 Difference]: Finished difference Result 2652 states and 3782 transitions. [2025-01-09 20:00:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:00:19,559 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 [2025-01-09 20:00:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:00:19,566 INFO L225 Difference]: With dead ends: 2652 [2025-01-09 20:00:19,566 INFO L226 Difference]: Without dead ends: 2650 [2025-01-09 20:00:19,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:00:19,567 INFO L435 NwaCegarLoop]: 3686 mSDtfsCounter, 3643 mSDsluCounter, 7353 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3644 SdHoareTripleChecker+Valid, 11039 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:00:19,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3644 Valid, 11039 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:00:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2025-01-09 20:00:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2025-01-09 20:00:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 1933 states have (on average 1.330056906363166) internal successors, (2571), 1976 states have internal predecessors, (2571), 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) [2025-01-09 20:00:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3780 transitions. [2025-01-09 20:00:19,647 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3780 transitions. Word has length 111 [2025-01-09 20:00:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:00:19,647 INFO L471 AbstractCegarLoop]: Abstraction has 2650 states and 3780 transitions. [2025-01-09 20:00:19,647 INFO L472 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) [2025-01-09 20:00:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3780 transitions. [2025-01-09 20:00:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 20:00:19,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:00:19,648 INFO L218 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] [2025-01-09 20:00:19,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:00:19,648 INFO L396 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)] === [2025-01-09 20:00:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:00:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1997535884, now seen corresponding path program 1 times [2025-01-09 20:00:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:00:19,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387038427] [2025-01-09 20:00:19,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:00:19,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:00:23,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 20:00:23,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 20:00:23,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:00:23,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:00:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-01-09 20:00:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:00:23,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387038427] [2025-01-09 20:00:23,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387038427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:00:23,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:00:23,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:00:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180939145] [2025-01-09 20:00:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:00:23,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:00:23,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:00:23,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:00:23,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:00:23,579 INFO L87 Difference]: Start difference. First operand 2650 states and 3780 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) [2025-01-09 20:00:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:00:23,989 INFO L93 Difference]: Finished difference Result 2656 states and 3785 transitions. [2025-01-09 20:00:23,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:00:23,990 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 [2025-01-09 20:00:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:00:24,001 INFO L225 Difference]: With dead ends: 2656 [2025-01-09 20:00:24,001 INFO L226 Difference]: Without dead ends: 2654 [2025-01-09 20:00:24,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:00:24,002 INFO L435 NwaCegarLoop]: 3686 mSDtfsCounter, 3642 mSDsluCounter, 7353 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3643 SdHoareTripleChecker+Valid, 11039 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:00:24,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3643 Valid, 11039 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:00:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2025-01-09 20:00:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2654. [2025-01-09 20:00:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 1936 states have (on average 1.3295454545454546) internal successors, (2574), 1979 states have internal predecessors, (2574), 606 states have call successors, (606), 111 states have call predecessors, (606), 110 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2025-01-09 20:00:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 3783 transitions. [2025-01-09 20:00:24,089 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 3783 transitions. Word has length 116 [2025-01-09 20:00:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:00:24,089 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 3783 transitions. [2025-01-09 20:00:24,089 INFO L472 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) [2025-01-09 20:00:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 3783 transitions. [2025-01-09 20:00:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 20:00:24,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:00:24,092 INFO L218 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] [2025-01-09 20:00:24,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:00:24,092 INFO L396 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)] === [2025-01-09 20:00:24,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:00:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1217606262, now seen corresponding path program 1 times [2025-01-09 20:00:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:00:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430786160] [2025-01-09 20:00:24,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:00:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:00:27,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 20:00:27,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 20:00:27,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:00:27,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:00:27,988 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-01-09 20:00:27,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:00:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430786160] [2025-01-09 20:00:27,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430786160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:00:27,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:00:27,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:00:27,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426797624] [2025-01-09 20:00:27,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:00:27,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:00:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:00:27,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:00:27,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:00:27,990 INFO L87 Difference]: Start difference. First operand 2654 states and 3783 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) [2025-01-09 20:00:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:00:28,392 INFO L93 Difference]: Finished difference Result 2660 states and 3788 transitions. [2025-01-09 20:00:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:00:28,393 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 [2025-01-09 20:00:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:00:28,399 INFO L225 Difference]: With dead ends: 2660 [2025-01-09 20:00:28,400 INFO L226 Difference]: Without dead ends: 2656 [2025-01-09 20:00:28,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:00:28,401 INFO L435 NwaCegarLoop]: 3686 mSDtfsCounter, 3641 mSDsluCounter, 7353 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3642 SdHoareTripleChecker+Valid, 11039 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:00:28,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3642 Valid, 11039 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:00:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states. [2025-01-09 20:00:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2656. [2025-01-09 20:00:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 1938 states have (on average 1.3286893704850362) internal successors, (2575), 1980 states have internal predecessors, (2575), 606 states have call successors, (606), 112 states have call predecessors, (606), 110 states have return successors, (603), 592 states have call predecessors, (603), 603 states have call successors, (603) [2025-01-09 20:00:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 3784 transitions. [2025-01-09 20:00:28,500 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 3784 transitions. Word has length 121 [2025-01-09 20:00:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:00:28,500 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 3784 transitions. [2025-01-09 20:00:28,500 INFO L472 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) [2025-01-09 20:00:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 3784 transitions. [2025-01-09 20:00:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 20:00:28,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:00:28,502 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:00:28,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:00:28,502 INFO L396 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)] === [2025-01-09 20:00:28,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:00:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1311693083, now seen corresponding path program 1 times [2025-01-09 20:00:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:00:28,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275963622] [2025-01-09 20:00:28,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:00:28,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms