./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.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 737f509bd25a9e06ce0273f44396be18568d5a5ccd53141342830e40e0488456 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 19:45:35,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 19:45:35,649 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:45:35,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 19:45:35,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 19:45:35,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 19:45:35,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 19:45:35,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 19:45:35,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 19:45:35,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 19:45:35,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 19:45:35,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 19:45:35,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 19:45:35,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 19:45:35,684 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 19:45:35,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 19:45:35,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 19:45:35,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 19:45:35,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 19:45:35,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 19:45:35,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 19:45:35,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:45:35,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 19:45:35,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 19:45:35,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 19:45:35,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:45:35,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 19:45:35,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 19:45:35,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 19:45:35,688 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 -> 737f509bd25a9e06ce0273f44396be18568d5a5ccd53141342830e40e0488456 [2025-01-09 19:45:35,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 19:45:35,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 19:45:35,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 19:45:35,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 19:45:35,954 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 19:45:35,955 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i [2025-01-09 19:45:37,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/716b7a4fd/aa2c11b095a74059b36fa049543b015f/FLAG0c567e6b5 [2025-01-09 19:45:37,719 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 19:45:37,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i [2025-01-09 19:45:37,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/716b7a4fd/aa2c11b095a74059b36fa049543b015f/FLAG0c567e6b5 [2025-01-09 19:45:37,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/716b7a4fd/aa2c11b095a74059b36fa049543b015f [2025-01-09 19:45:37,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 19:45:37,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 19:45:37,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 19:45:37,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 19:45:37,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 19:45:37,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:45:37" (1/1) ... [2025-01-09 19:45:37,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ead840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:37, skipping insertion in model container [2025-01-09 19:45:37,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:45:37" (1/1) ... [2025-01-09 19:45:37,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 19:45:39,190 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292189,292202] [2025-01-09 19:45:39,193 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292358,292371] [2025-01-09 19:45:39,193 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292525,292538] [2025-01-09 19:45:39,193 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292693,292706] [2025-01-09 19:45:39,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 19:45:39,213 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 19:45:39,301 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [6219] [2025-01-09 19:45:39,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6222] [2025-01-09 19:45:39,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6225] [2025-01-09 19:45:39,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6228] [2025-01-09 19:45:39,359 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %b0, %1\n": "+q" (__ret), "+m" (tmp___0->state): : "memory", "cc"); [6657-6658] [2025-01-09 19:45:39,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %w0, %1\n": "+r" (__ret), "+m" (tmp___1->state): : "memory", "cc"); [6664-6665] [2025-01-09 19:45:39,361 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0, %1\n": "+r" (__ret), "+m" (tmp___2->state): : "memory", "cc"); [6671-6672] [2025-01-09 19:45:39,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %q0, %1\n": "+r" (__ret), "+m" (tmp___3->state): : "memory", "cc"); [6678-6679] [2025-01-09 19:45:39,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %b0, %1\n": "+q" (__ret___0), "+m" (tmp___4->state): : "memory", "cc"); [6722-6723] [2025-01-09 19:45:39,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %w0, %1\n": "+r" (__ret___0), "+m" (tmp___5->state): : "memory", "cc"); [6729-6730] [2025-01-09 19:45:39,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0, %1\n": "+r" (__ret___0), "+m" (tmp___6->state): : "memory", "cc"); [6736-6737] [2025-01-09 19:45:39,362 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %q0, %1\n": "+r" (__ret___0), "+m" (tmp___7->state): : "memory", "cc"); [6743-6744] [2025-01-09 19:45:39,438 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292189,292202] [2025-01-09 19:45:39,439 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292358,292371] [2025-01-09 19:45:39,439 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292525,292538] [2025-01-09 19:45:39,439 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_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i[292693,292706] [2025-01-09 19:45:39,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 19:45:39,537 INFO L204 MainTranslator]: Completed translation [2025-01-09 19:45:39,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39 WrapperNode [2025-01-09 19:45:39,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 19:45:39,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 19:45:39,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 19:45:39,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 19:45:39,544 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:45:39" (1/1) ... [2025-01-09 19:45:39,597 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:45:39" (1/1) ... [2025-01-09 19:45:39,711 INFO L138 Inliner]: procedures = 327, calls = 936, calls flagged for inlining = 153, calls inlined = 140, statements flattened = 2787 [2025-01-09 19:45:39,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 19:45:39,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 19:45:39,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 19:45:39,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 19:45:39,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:39,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:39,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,013 INFO L175 MemorySlicer]: Split 272 memory accesses to 11 slices as follows [158, 14, 5, 52, 1, 6, 2, 2, 25, 5, 2]. 58 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [0, 0, 0, 0, 1, 6, 2, 0, 0, 0, 1]. The 123 writes are split as follows [26, 12, 5, 52, 0, 0, 0, 1, 23, 4, 0]. [2025-01-09 19:45:40,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 19:45:40,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 19:45:40,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 19:45:40,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 19:45:40,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (1/1) ... [2025-01-09 19:45:40,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 19:45:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 19:45:40,194 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:45:40,201 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:45:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-01-09 19:45:40,218 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-01-09 19:45:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-01-09 19:45:40,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-01-09 19:45:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 19:45:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 19:45:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 19:45:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 19:45:40,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 19:45:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 19:45:40,220 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 19:45:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 19:45:40,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 19:45:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-01-09 19:45:40,220 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_request [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_request [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure spi_sync [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_sync [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_irq_unsubscribe [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_irq_unsubscribe [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~bool~0~TO~int [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~bool~0~TO~int [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_unlock [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_unlock [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_66 [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_66 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 19:45:40,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 19:45:40,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_hwbus_priv [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_hwbus_priv [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_add_tail [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_add_tail [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_probe [2025-01-09 19:45:40,222 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_probe [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 19:45:40,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 19:45:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 19:45:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 19:45:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 19:45:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 19:45:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 19:45:40,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 19:45:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-01-09 19:45:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2025-01-09 19:45:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 19:45:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 19:45:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_disconnect [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_disconnect [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_set_value [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_set_value [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_direction_output [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_direction_output [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_off [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_off [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_3 [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_3 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 19:45:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 19:45:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_init [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_init [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure spi_get_drvdata [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_get_drvdata [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_lock [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_lock [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_resume [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_resume [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_spi_driver_exit_9_2 [2025-01-09 19:45:40,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_spi_driver_exit_9_2 [2025-01-09 19:45:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_pm [2025-01-09 19:45:40,230 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_pm [2025-01-09 19:45:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 19:45:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 19:45:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 19:45:40,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2025-01-09 19:45:40,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2025-01-09 19:45:40,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 19:45:40,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 19:45:40,714 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 19:45:40,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 19:45:40,735 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 19:45:51,015 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-01-09 19:45:51,443 INFO L? ?]: Removed 1137 outVars from TransFormulas that were not future-live. [2025-01-09 19:45:51,443 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 19:45:51,471 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 19:45:51,473 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 19:45:51,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:45:51 BoogieIcfgContainer [2025-01-09 19:45:51,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 19:45:51,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 19:45:51,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 19:45:51,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 19:45:51,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:45:37" (1/3) ... [2025-01-09 19:45:51,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d32ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:45:51, skipping insertion in model container [2025-01-09 19:45:51,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:45:39" (2/3) ... [2025-01-09 19:45:51,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d32ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:45:51, skipping insertion in model container [2025-01-09 19:45:51,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:45:51" (3/3) ... [2025-01-09 19:45:51,482 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i [2025-01-09 19:45:51,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 19:45:51,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i that has 54 procedures, 1085 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-01-09 19:45:51,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 19:45:51,581 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;@9f1a74d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 19:45:51,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 19:45:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 774 states have (on average 1.2803617571059431) internal successors, (991), 786 states have internal predecessors, (991), 256 states have call successors, (256), 53 states have call predecessors, (256), 52 states have return successors, (247), 246 states have call predecessors, (247), 247 states have call successors, (247) [2025-01-09 19:45:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 19:45:51,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:45:51,607 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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 19:45:51,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:45:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash 497895914, now seen corresponding path program 1 times [2025-01-09 19:45:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:45:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115721211] [2025-01-09 19:45:51,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:45:51,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:45:51,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 19:45:51,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 19:45:51,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:45:51,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:45:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-01-09 19:45:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:45:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115721211] [2025-01-09 19:45:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115721211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:45:52,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:45:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:45:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374034613] [2025-01-09 19:45:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:45:52,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:45:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:45:52,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:45:52,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:45:52,247 INFO L87 Difference]: Start difference. First operand has 1083 states, 774 states have (on average 1.2803617571059431) internal successors, (991), 786 states have internal predecessors, (991), 256 states have call successors, (256), 53 states have call predecessors, (256), 52 states have return successors, (247), 246 states have call predecessors, (247), 247 states have call successors, (247) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 19:45:53,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 19:45:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:45:54,037 INFO L93 Difference]: Finished difference Result 2952 states and 4147 transitions. [2025-01-09 19:45:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:45:54,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 151 [2025-01-09 19:45:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:45:54,069 INFO L225 Difference]: With dead ends: 2952 [2025-01-09 19:45:54,069 INFO L226 Difference]: Without dead ends: 1880 [2025-01-09 19:45:54,081 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:45:54,083 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1121 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 19:45:54,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 2885 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 19:45:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-01-09 19:45:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1853. [2025-01-09 19:45:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1335 states have (on average 1.247940074906367) internal successors, (1666), 1362 states have internal predecessors, (1666), 418 states have call successors, (418), 98 states have call predecessors, (418), 97 states have return successors, (414), 408 states have call predecessors, (414), 414 states have call successors, (414) [2025-01-09 19:45:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2498 transitions. [2025-01-09 19:45:54,213 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2498 transitions. Word has length 151 [2025-01-09 19:45:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:45:54,214 INFO L471 AbstractCegarLoop]: Abstraction has 1853 states and 2498 transitions. [2025-01-09 19:45:54,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 19:45:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2498 transitions. [2025-01-09 19:45:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 19:45:54,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:45:54,220 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:54,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 19:45:54,221 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:45:54,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:45:54,221 INFO L85 PathProgramCache]: Analyzing trace with hash 444234944, now seen corresponding path program 1 times [2025-01-09 19:45:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:45:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745374461] [2025-01-09 19:45:54,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:45:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:45:54,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 19:45:54,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 19:45:54,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:45:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:45:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-01-09 19:45:54,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:45:54,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745374461] [2025-01-09 19:45:54,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745374461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:45:54,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:45:54,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:45:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162814791] [2025-01-09 19:45:54,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:45:54,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:45:54,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:45:54,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:45:54,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:45:54,539 INFO L87 Difference]: Start difference. First operand 1853 states and 2498 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 19:45:57,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 19:45:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:45:57,896 INFO L93 Difference]: Finished difference Result 5358 states and 7217 transitions. [2025-01-09 19:45:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:45:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 151 [2025-01-09 19:45:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:45:57,926 INFO L225 Difference]: With dead ends: 5358 [2025-01-09 19:45:57,927 INFO L226 Difference]: Without dead ends: 3532 [2025-01-09 19:45:57,937 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:45:57,938 INFO L435 NwaCegarLoop]: 1435 mSDtfsCounter, 1279 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 19:45:57,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 2798 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 19:45:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2025-01-09 19:45:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 3528. [2025-01-09 19:45:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 2562 states have (on average 1.2478532396565183) internal successors, (3197), 2608 states have internal predecessors, (3197), 772 states have call successors, (772), 192 states have call predecessors, (772), 191 states have return successors, (768), 759 states have call predecessors, (768), 768 states have call successors, (768) [2025-01-09 19:45:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 4737 transitions. [2025-01-09 19:45:58,141 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 4737 transitions. Word has length 151 [2025-01-09 19:45:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:45:58,141 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 4737 transitions. [2025-01-09 19:45:58,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 19:45:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 4737 transitions. [2025-01-09 19:45:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 19:45:58,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:45:58,144 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:58,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 19:45:58,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 19:45:58,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:45:58,145 INFO L85 PathProgramCache]: Analyzing trace with hash 704418550, now seen corresponding path program 1 times [2025-01-09 19:45:58,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:45:58,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558392061] [2025-01-09 19:45:58,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:45:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:45:58,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 19:45:58,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 19:45:58,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:45:58,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:45:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-01-09 19:45:58,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:45:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558392061] [2025-01-09 19:45:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558392061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:45:58,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:45:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:45:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019511768] [2025-01-09 19:45:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:45:58,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:45:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:45:58,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:45:58,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:45:58,329 INFO L87 Difference]: Start difference. First operand 3528 states and 4737 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (16), 2 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 19:45:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:45:59,453 INFO L93 Difference]: Finished difference Result 8391 states and 11240 transitions. [2025-01-09 19:45:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:45:59,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (16), 2 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 157 [2025-01-09 19:45:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:45:59,478 INFO L225 Difference]: With dead ends: 8391 [2025-01-09 19:45:59,478 INFO L226 Difference]: Without dead ends: 4890 [2025-01-09 19:45:59,490 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:45:59,491 INFO L435 NwaCegarLoop]: 1437 mSDtfsCounter, 1195 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:45:59,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 2818 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 19:45:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2025-01-09 19:45:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4861. [2025-01-09 19:45:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4861 states, 3507 states have (on average 1.2375249500998005) internal successors, (4340), 3582 states have internal predecessors, (4340), 1074 states have call successors, (1074), 278 states have call predecessors, (1074), 277 states have return successors, (1070), 1048 states have call predecessors, (1070), 1070 states have call successors, (1070) [2025-01-09 19:45:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 6484 transitions. [2025-01-09 19:45:59,645 INFO L78 Accepts]: Start accepts. Automaton has 4861 states and 6484 transitions. Word has length 157 [2025-01-09 19:45:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:45:59,645 INFO L471 AbstractCegarLoop]: Abstraction has 4861 states and 6484 transitions. [2025-01-09 19:45:59,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (16), 2 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 19:45:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4861 states and 6484 transitions. [2025-01-09 19:45:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 19:45:59,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:45:59,648 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:59,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 19:45:59,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 19:45:59,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:45:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1254314602, now seen corresponding path program 1 times [2025-01-09 19:45:59,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:45:59,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011571451] [2025-01-09 19:45:59,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:45:59,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:45:59,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 19:45:59,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 19:45:59,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:45:59,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:45:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-01-09 19:45:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:45:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011571451] [2025-01-09 19:45:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011571451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:45:59,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:45:59,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:45:59,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768214993] [2025-01-09 19:45:59,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:45:59,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:45:59,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:45:59,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:45:59,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:45:59,855 INFO L87 Difference]: Start difference. First operand 4861 states and 6484 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 19:46:01,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 19:46:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:01,684 INFO L93 Difference]: Finished difference Result 14119 states and 19076 transitions. [2025-01-09 19:46:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:46:01,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 163 [2025-01-09 19:46:01,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:01,728 INFO L225 Difference]: With dead ends: 14119 [2025-01-09 19:46:01,728 INFO L226 Difference]: Without dead ends: 9285 [2025-01-09 19:46:01,742 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:46:01,743 INFO L435 NwaCegarLoop]: 1456 mSDtfsCounter, 1369 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:01,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 2834 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 19:46:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9285 states. [2025-01-09 19:46:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9285 to 9248. [2025-01-09 19:46:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9248 states, 6684 states have (on average 1.2410233393177739) internal successors, (8295), 6844 states have internal predecessors, (8295), 2042 states have call successors, (2042), 532 states have call predecessors, (2042), 519 states have return successors, (2224), 1955 states have call predecessors, (2224), 2038 states have call successors, (2224) [2025-01-09 19:46:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 12561 transitions. [2025-01-09 19:46:02,274 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 12561 transitions. Word has length 163 [2025-01-09 19:46:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:02,275 INFO L471 AbstractCegarLoop]: Abstraction has 9248 states and 12561 transitions. [2025-01-09 19:46:02,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 19:46:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 12561 transitions. [2025-01-09 19:46:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 19:46:02,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:02,278 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 11, 11, 11, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:02,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 19:46:02,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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 19:46:02,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1586530598, now seen corresponding path program 1 times [2025-01-09 19:46:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951951404] [2025-01-09 19:46:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:02,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 19:46:02,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 19:46:02,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:02,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-01-09 19:46:02,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:02,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951951404] [2025-01-09 19:46:02,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951951404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:02,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:02,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:46:02,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763683575] [2025-01-09 19:46:02,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:02,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:46:02,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:02,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:46:02,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:46:02,493 INFO L87 Difference]: Start difference. First operand 9248 states and 12561 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 19:46:05,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 19:46:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:05,511 INFO L93 Difference]: Finished difference Result 22807 states and 30853 transitions. [2025-01-09 19:46:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:46:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 175 [2025-01-09 19:46:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:05,589 INFO L225 Difference]: With dead ends: 22807 [2025-01-09 19:46:05,589 INFO L226 Difference]: Without dead ends: 13586 [2025-01-09 19:46:05,618 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:46:05,620 INFO L435 NwaCegarLoop]: 1717 mSDtfsCounter, 1271 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:05,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 3092 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 19:46:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13586 states. [2025-01-09 19:46:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13586 to 13545. [2025-01-09 19:46:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13545 states, 9798 states have (on average 1.2308634415186772) internal successors, (12060), 10058 states have internal predecessors, (12060), 2948 states have call successors, (2948), 815 states have call predecessors, (2948), 796 states have return successors, (3173), 2797 states have call predecessors, (3173), 2944 states have call successors, (3173) [2025-01-09 19:46:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13545 states to 13545 states and 18181 transitions. [2025-01-09 19:46:06,095 INFO L78 Accepts]: Start accepts. Automaton has 13545 states and 18181 transitions. Word has length 175 [2025-01-09 19:46:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:06,097 INFO L471 AbstractCegarLoop]: Abstraction has 13545 states and 18181 transitions. [2025-01-09 19:46:06,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 19:46:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand 13545 states and 18181 transitions. [2025-01-09 19:46:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 19:46:06,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:06,102 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:06,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 19:46:06,102 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:46:06,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2113638291, now seen corresponding path program 1 times [2025-01-09 19:46:06,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:06,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508366257] [2025-01-09 19:46:06,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:06,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 19:46:06,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 19:46:06,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:06,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-01-09 19:46:06,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:06,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508366257] [2025-01-09 19:46:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508366257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:06,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:06,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:46:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616787873] [2025-01-09 19:46:06,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:06,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:46:06,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:06,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:46:06,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:46:06,243 INFO L87 Difference]: Start difference. First operand 13545 states and 18181 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 19:46:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:07,800 INFO L93 Difference]: Finished difference Result 37494 states and 50480 transitions. [2025-01-09 19:46:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:46:07,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 209 [2025-01-09 19:46:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:07,907 INFO L225 Difference]: With dead ends: 37494 [2025-01-09 19:46:07,907 INFO L226 Difference]: Without dead ends: 24949 [2025-01-09 19:46:07,947 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:46:07,948 INFO L435 NwaCegarLoop]: 2671 mSDtfsCounter, 1252 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 4060 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:07,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 4060 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 19:46:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24949 states. [2025-01-09 19:46:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24949 to 24945. [2025-01-09 19:46:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24945 states, 18134 states have (on average 1.231167971765744) internal successors, (22326), 18554 states have internal predecessors, (22326), 5344 states have call successors, (5344), 1499 states have call predecessors, (5344), 1464 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-01-09 19:46:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24945 states to 24945 states and 33465 transitions. [2025-01-09 19:46:08,946 INFO L78 Accepts]: Start accepts. Automaton has 24945 states and 33465 transitions. Word has length 209 [2025-01-09 19:46:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:08,947 INFO L471 AbstractCegarLoop]: Abstraction has 24945 states and 33465 transitions. [2025-01-09 19:46:08,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 19:46:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 24945 states and 33465 transitions. [2025-01-09 19:46:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 19:46:08,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:08,951 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:08,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 19:46:08,951 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:46:08,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -190410257, now seen corresponding path program 1 times [2025-01-09 19:46:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623446177] [2025-01-09 19:46:08,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:08,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 19:46:09,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 19:46:09,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:09,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2025-01-09 19:46:09,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:09,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623446177] [2025-01-09 19:46:09,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623446177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:09,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:09,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:09,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649236461] [2025-01-09 19:46:09,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:09,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:09,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:09,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:09,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:09,279 INFO L87 Difference]: Start difference. First operand 24945 states and 33465 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 19:46:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:09,852 INFO L93 Difference]: Finished difference Result 24951 states and 33470 transitions. [2025-01-09 19:46:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 209 [2025-01-09 19:46:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:09,936 INFO L225 Difference]: With dead ends: 24951 [2025-01-09 19:46:09,936 INFO L226 Difference]: Without dead ends: 24949 [2025-01-09 19:46:09,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:09,946 INFO L435 NwaCegarLoop]: 1419 mSDtfsCounter, 1365 mSDsluCounter, 2825 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 4244 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:09,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1366 Valid, 4244 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24949 states. [2025-01-09 19:46:10,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24949 to 24949. [2025-01-09 19:46:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24949 states, 18137 states have (on average 1.2311297347962729) internal successors, (22329), 18557 states have internal predecessors, (22329), 5344 states have call successors, (5344), 1500 states have call predecessors, (5344), 1465 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-01-09 19:46:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24949 states to 24949 states and 33468 transitions. [2025-01-09 19:46:10,678 INFO L78 Accepts]: Start accepts. Automaton has 24949 states and 33468 transitions. Word has length 209 [2025-01-09 19:46:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:10,679 INFO L471 AbstractCegarLoop]: Abstraction has 24949 states and 33468 transitions. [2025-01-09 19:46:10,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 19:46:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 24949 states and 33468 transitions. [2025-01-09 19:46:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 19:46:10,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:10,683 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:10,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 19:46:10,683 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:46:10,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1832737645, now seen corresponding path program 1 times [2025-01-09 19:46:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267814994] [2025-01-09 19:46:10,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:10,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 19:46:10,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 19:46:10,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:10,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2025-01-09 19:46:10,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:10,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267814994] [2025-01-09 19:46:10,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267814994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:10,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:10,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340099416] [2025-01-09 19:46:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:10,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:10,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:10,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:10,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:10,989 INFO L87 Difference]: Start difference. First operand 24949 states and 33468 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 19:46:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:11,813 INFO L93 Difference]: Finished difference Result 24955 states and 33473 transitions. [2025-01-09 19:46:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:11,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 214 [2025-01-09 19:46:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:11,919 INFO L225 Difference]: With dead ends: 24955 [2025-01-09 19:46:11,920 INFO L226 Difference]: Without dead ends: 24953 [2025-01-09 19:46:11,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:11,935 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 1361 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 4248 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:11,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 4248 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24953 states. [2025-01-09 19:46:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24953 to 24953. [2025-01-09 19:46:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24953 states, 18140 states have (on average 1.2310915104740905) internal successors, (22332), 18560 states have internal predecessors, (22332), 5344 states have call successors, (5344), 1501 states have call predecessors, (5344), 1466 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-01-09 19:46:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24953 states to 24953 states and 33471 transitions. [2025-01-09 19:46:13,248 INFO L78 Accepts]: Start accepts. Automaton has 24953 states and 33471 transitions. Word has length 214 [2025-01-09 19:46:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:13,249 INFO L471 AbstractCegarLoop]: Abstraction has 24953 states and 33471 transitions. [2025-01-09 19:46:13,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 19:46:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 24953 states and 33471 transitions. [2025-01-09 19:46:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 19:46:13,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:13,254 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:13,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 19:46:13,254 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 19:46:13,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:13,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1214519185, now seen corresponding path program 1 times [2025-01-09 19:46:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:13,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875500029] [2025-01-09 19:46:13,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:13,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:13,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 19:46:13,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 19:46:13,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:13,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-01-09 19:46:13,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:13,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875500029] [2025-01-09 19:46:13,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875500029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474423564] [2025-01-09 19:46:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:13,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:13,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:13,580 INFO L87 Difference]: Start difference. First operand 24953 states and 33471 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 19:46:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:14,131 INFO L93 Difference]: Finished difference Result 24959 states and 33476 transitions. [2025-01-09 19:46:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 219 [2025-01-09 19:46:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:14,274 INFO L225 Difference]: With dead ends: 24959 [2025-01-09 19:46:14,275 INFO L226 Difference]: Without dead ends: 24957 [2025-01-09 19:46:14,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:14,294 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 1360 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 4248 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:14,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 4248 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24957 states. [2025-01-09 19:46:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24957 to 24957. [2025-01-09 19:46:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24957 states, 18143 states have (on average 1.2310532987929228) internal successors, (22335), 18563 states have internal predecessors, (22335), 5344 states have call successors, (5344), 1502 states have call predecessors, (5344), 1467 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-01-09 19:46:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24957 states to 24957 states and 33474 transitions. [2025-01-09 19:46:15,583 INFO L78 Accepts]: Start accepts. Automaton has 24957 states and 33474 transitions. Word has length 219 [2025-01-09 19:46:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:15,584 INFO L471 AbstractCegarLoop]: Abstraction has 24957 states and 33474 transitions. [2025-01-09 19:46:15,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 19:46:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 24957 states and 33474 transitions. [2025-01-09 19:46:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-09 19:46:15,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:15,590 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:15,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 19:46:15,590 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 19:46:15,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1479106163, now seen corresponding path program 1 times [2025-01-09 19:46:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558908852] [2025-01-09 19:46:15,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:15,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 19:46:15,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 19:46:15,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:15,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-01-09 19:46:15,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:15,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558908852] [2025-01-09 19:46:15,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558908852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:15,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:15,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:46:15,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633017715] [2025-01-09 19:46:15,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:15,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:46:15,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:15,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:46:15,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:46:15,809 INFO L87 Difference]: Start difference. First operand 24957 states and 33474 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 19:46:17,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 19:46:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:18,384 INFO L93 Difference]: Finished difference Result 60364 states and 81135 transitions. [2025-01-09 19:46:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:46:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 235 [2025-01-09 19:46:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:18,551 INFO L225 Difference]: With dead ends: 60364 [2025-01-09 19:46:18,551 INFO L226 Difference]: Without dead ends: 36407 [2025-01-09 19:46:18,618 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:46:18,619 INFO L435 NwaCegarLoop]: 2672 mSDtfsCounter, 1284 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 4063 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:18,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 4063 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 19:46:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36407 states. [2025-01-09 19:46:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36407 to 36373. [2025-01-09 19:46:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36373 states, 26495 states have (on average 1.2310624646159654) internal successors, (32617), 27075 states have internal predecessors, (32617), 7740 states have call successors, (7740), 2186 states have call predecessors, (7740), 2135 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-01-09 19:46:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36373 states to 36373 states and 48774 transitions. [2025-01-09 19:46:20,171 INFO L78 Accepts]: Start accepts. Automaton has 36373 states and 48774 transitions. Word has length 235 [2025-01-09 19:46:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:20,172 INFO L471 AbstractCegarLoop]: Abstraction has 36373 states and 48774 transitions. [2025-01-09 19:46:20,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 19:46:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36373 states and 48774 transitions. [2025-01-09 19:46:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 19:46:20,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:20,176 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:20,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 19:46:20,176 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 19:46:20,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -690731923, now seen corresponding path program 1 times [2025-01-09 19:46:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726774907] [2025-01-09 19:46:20,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:20,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 19:46:20,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 19:46:20,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:20,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-01-09 19:46:20,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726774907] [2025-01-09 19:46:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726774907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952893852] [2025-01-09 19:46:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:20,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:20,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:20,409 INFO L87 Difference]: Start difference. First operand 36373 states and 48774 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 19:46:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:21,706 INFO L93 Difference]: Finished difference Result 36379 states and 48779 transitions. [2025-01-09 19:46:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:21,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 224 [2025-01-09 19:46:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:21,930 INFO L225 Difference]: With dead ends: 36379 [2025-01-09 19:46:21,930 INFO L226 Difference]: Without dead ends: 36377 [2025-01-09 19:46:21,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:21,953 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 1359 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 4248 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:21,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 4248 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36377 states. [2025-01-09 19:46:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36377 to 36377. [2025-01-09 19:46:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36377 states, 26498 states have (on average 1.2310363046267643) internal successors, (32620), 27078 states have internal predecessors, (32620), 7740 states have call successors, (7740), 2187 states have call predecessors, (7740), 2136 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-01-09 19:46:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 48777 transitions. [2025-01-09 19:46:23,223 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 48777 transitions. Word has length 224 [2025-01-09 19:46:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:23,224 INFO L471 AbstractCegarLoop]: Abstraction has 36377 states and 48777 transitions. [2025-01-09 19:46:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 19:46:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 48777 transitions. [2025-01-09 19:46:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 19:46:23,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:23,228 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:23,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 19:46:23,228 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 19:46:23,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1965608687, now seen corresponding path program 1 times [2025-01-09 19:46:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133155311] [2025-01-09 19:46:23,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:23,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 19:46:23,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 19:46:23,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:23,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2025-01-09 19:46:23,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:23,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133155311] [2025-01-09 19:46:23,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133155311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:23,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786164214] [2025-01-09 19:46:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:23,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:23,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:23,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:23,649 INFO L87 Difference]: Start difference. First operand 36377 states and 48777 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 19:46:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:24,838 INFO L93 Difference]: Finished difference Result 36383 states and 48782 transitions. [2025-01-09 19:46:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 229 [2025-01-09 19:46:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:25,006 INFO L225 Difference]: With dead ends: 36383 [2025-01-09 19:46:25,006 INFO L226 Difference]: Without dead ends: 36381 [2025-01-09 19:46:25,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:25,032 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 1358 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 4248 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:25,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 4248 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 19:46:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36381 states. [2025-01-09 19:46:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36381 to 36381. [2025-01-09 19:46:26,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36381 states, 26501 states have (on average 1.2310101505603561) internal successors, (32623), 27081 states have internal predecessors, (32623), 7740 states have call successors, (7740), 2188 states have call predecessors, (7740), 2137 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-01-09 19:46:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36381 states to 36381 states and 48780 transitions. [2025-01-09 19:46:26,961 INFO L78 Accepts]: Start accepts. Automaton has 36381 states and 48780 transitions. Word has length 229 [2025-01-09 19:46:26,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:26,962 INFO L471 AbstractCegarLoop]: Abstraction has 36381 states and 48780 transitions. [2025-01-09 19:46:26,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 19:46:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 36381 states and 48780 transitions. [2025-01-09 19:46:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 19:46:26,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:26,968 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:26,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 19:46:26,969 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 19:46:26,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash 101555565, now seen corresponding path program 1 times [2025-01-09 19:46:26,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:26,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433644285] [2025-01-09 19:46:26,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:26,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:27,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 19:46:27,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 19:46:27,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:27,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-01-09 19:46:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433644285] [2025-01-09 19:46:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433644285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895630321] [2025-01-09 19:46:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:27,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:27,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:27,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:27,250 INFO L87 Difference]: Start difference. First operand 36381 states and 48780 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 19:46:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:28,328 INFO L93 Difference]: Finished difference Result 36387 states and 48785 transitions. [2025-01-09 19:46:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:28,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 234 [2025-01-09 19:46:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:28,452 INFO L225 Difference]: With dead ends: 36387 [2025-01-09 19:46:28,453 INFO L226 Difference]: Without dead ends: 36385 [2025-01-09 19:46:28,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:28,473 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 1357 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 4248 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:28,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 4248 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:28,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36385 states. [2025-01-09 19:46:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36385 to 36385. [2025-01-09 19:46:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36385 states, 26504 states have (on average 1.2309840024147298) internal successors, (32626), 27084 states have internal predecessors, (32626), 7740 states have call successors, (7740), 2189 states have call predecessors, (7740), 2138 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-01-09 19:46:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36385 states to 36385 states and 48783 transitions. [2025-01-09 19:46:30,035 INFO L78 Accepts]: Start accepts. Automaton has 36385 states and 48783 transitions. Word has length 234 [2025-01-09 19:46:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:30,036 INFO L471 AbstractCegarLoop]: Abstraction has 36385 states and 48783 transitions. [2025-01-09 19:46:30,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 19:46:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36385 states and 48783 transitions. [2025-01-09 19:46:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-09 19:46:30,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:30,040 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:30,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 19:46:30,040 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 19:46:30,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1055308433, now seen corresponding path program 1 times [2025-01-09 19:46:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042814889] [2025-01-09 19:46:30,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:30,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 19:46:30,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 19:46:30,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:30,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2025-01-09 19:46:30,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:30,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042814889] [2025-01-09 19:46:30,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042814889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:30,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238285890] [2025-01-09 19:46:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:30,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:30,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:30,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:30,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:30,238 INFO L87 Difference]: Start difference. First operand 36385 states and 48783 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 19:46:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:31,632 INFO L93 Difference]: Finished difference Result 36907 states and 49218 transitions. [2025-01-09 19:46:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:31,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 239 [2025-01-09 19:46:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:31,796 INFO L225 Difference]: With dead ends: 36907 [2025-01-09 19:46:31,796 INFO L226 Difference]: Without dead ends: 36905 [2025-01-09 19:46:31,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:31,819 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 1308 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 4292 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:31,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 4292 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36905 states. [2025-01-09 19:46:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36905 to 36905. [2025-01-09 19:46:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36905 states, 26937 states have (on average 1.227271039833686) internal successors, (33059), 27517 states have internal predecessors, (33059), 7740 states have call successors, (7740), 2276 states have call predecessors, (7740), 2225 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-01-09 19:46:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36905 states to 36905 states and 49216 transitions. [2025-01-09 19:46:33,568 INFO L78 Accepts]: Start accepts. Automaton has 36905 states and 49216 transitions. Word has length 239 [2025-01-09 19:46:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:33,569 INFO L471 AbstractCegarLoop]: Abstraction has 36905 states and 49216 transitions. [2025-01-09 19:46:33,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 19:46:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 36905 states and 49216 transitions. [2025-01-09 19:46:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-09 19:46:33,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:33,573 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:33,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 19:46:33,573 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 19:46:33,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash -425892243, now seen corresponding path program 1 times [2025-01-09 19:46:33,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830655293] [2025-01-09 19:46:33,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:33,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 19:46:33,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 19:46:33,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:33,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2025-01-09 19:46:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:33,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830655293] [2025-01-09 19:46:33,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830655293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:33,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:33,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:33,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194904325] [2025-01-09 19:46:33,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:33,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:33,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:33,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:33,774 INFO L87 Difference]: Start difference. First operand 36905 states and 49216 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 19:46:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:35,336 INFO L93 Difference]: Finished difference Result 36911 states and 49221 transitions. [2025-01-09 19:46:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:35,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 244 [2025-01-09 19:46:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:35,465 INFO L225 Difference]: With dead ends: 36911 [2025-01-09 19:46:35,465 INFO L226 Difference]: Without dead ends: 36909 [2025-01-09 19:46:35,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:35,482 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 1355 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 4248 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:35,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 4248 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36909 states. [2025-01-09 19:46:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36909 to 36909. [2025-01-09 19:46:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36909 states, 26940 states have (on average 1.2272457312546399) internal successors, (33062), 27520 states have internal predecessors, (33062), 7740 states have call successors, (7740), 2277 states have call predecessors, (7740), 2226 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-01-09 19:46:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36909 states to 36909 states and 49219 transitions. [2025-01-09 19:46:37,817 INFO L78 Accepts]: Start accepts. Automaton has 36909 states and 49219 transitions. Word has length 244 [2025-01-09 19:46:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:37,818 INFO L471 AbstractCegarLoop]: Abstraction has 36909 states and 49219 transitions. [2025-01-09 19:46:37,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 19:46:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 36909 states and 49219 transitions. [2025-01-09 19:46:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 19:46:37,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:37,823 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:37,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 19:46:37,824 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 19:46:37,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:37,824 INFO L85 PathProgramCache]: Analyzing trace with hash -533115921, now seen corresponding path program 1 times [2025-01-09 19:46:37,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:37,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748834614] [2025-01-09 19:46:37,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:37,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:37,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 19:46:37,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 19:46:37,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:37,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2025-01-09 19:46:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748834614] [2025-01-09 19:46:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748834614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:38,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:38,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298668649] [2025-01-09 19:46:38,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:38,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:38,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:38,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:38,102 INFO L87 Difference]: Start difference. First operand 36909 states and 49219 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 19:46:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:39,296 INFO L93 Difference]: Finished difference Result 36915 states and 49224 transitions. [2025-01-09 19:46:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:39,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 249 [2025-01-09 19:46:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:39,443 INFO L225 Difference]: With dead ends: 36915 [2025-01-09 19:46:39,443 INFO L226 Difference]: Without dead ends: 36913 [2025-01-09 19:46:39,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:39,465 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 1354 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 4248 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:39,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 4248 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36913 states. [2025-01-09 19:46:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36913 to 36913. [2025-01-09 19:46:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36913 states, 26943 states have (on average 1.2272204283116208) internal successors, (33065), 27523 states have internal predecessors, (33065), 7740 states have call successors, (7740), 2278 states have call predecessors, (7740), 2227 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-01-09 19:46:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36913 states to 36913 states and 49222 transitions. [2025-01-09 19:46:41,014 INFO L78 Accepts]: Start accepts. Automaton has 36913 states and 49222 transitions. Word has length 249 [2025-01-09 19:46:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:41,015 INFO L471 AbstractCegarLoop]: Abstraction has 36913 states and 49222 transitions. [2025-01-09 19:46:41,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 19:46:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 36913 states and 49222 transitions. [2025-01-09 19:46:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 19:46:41,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:41,020 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 10, 9, 9, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 19:46:41,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 19:46:41,020 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 19:46:41,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1396154221, now seen corresponding path program 1 times [2025-01-09 19:46:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:41,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121770670] [2025-01-09 19:46:41,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:41,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 19:46:41,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 19:46:41,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:41,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-01-09 19:46:41,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:41,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121770670] [2025-01-09 19:46:41,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121770670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:41,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:41,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 19:46:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690553120] [2025-01-09 19:46:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:41,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 19:46:41,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:41,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 19:46:41,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 19:46:41,219 INFO L87 Difference]: Start difference. First operand 36913 states and 49222 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 3 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 19:46:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:42,492 INFO L93 Difference]: Finished difference Result 36919 states and 49227 transitions. [2025-01-09 19:46:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 19:46:42,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 3 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 254 [2025-01-09 19:46:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:42,640 INFO L225 Difference]: With dead ends: 36919 [2025-01-09 19:46:42,640 INFO L226 Difference]: Without dead ends: 36917 [2025-01-09 19:46:42,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 19:46:42,663 INFO L435 NwaCegarLoop]: 1422 mSDtfsCounter, 1353 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 4248 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:42,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 4248 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 19:46:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36917 states. [2025-01-09 19:46:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36917 to 36917. [2025-01-09 19:46:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36917 states, 26946 states have (on average 1.2271951310027462) internal successors, (33068), 27526 states have internal predecessors, (33068), 7740 states have call successors, (7740), 2279 states have call predecessors, (7740), 2228 states have return successors, (8417), 7461 states have call predecessors, (8417), 7736 states have call successors, (8417) [2025-01-09 19:46:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36917 states to 36917 states and 49225 transitions. [2025-01-09 19:46:44,336 INFO L78 Accepts]: Start accepts. Automaton has 36917 states and 49225 transitions. Word has length 254 [2025-01-09 19:46:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:44,336 INFO L471 AbstractCegarLoop]: Abstraction has 36917 states and 49225 transitions. [2025-01-09 19:46:44,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 3 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 19:46:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 36917 states and 49225 transitions. [2025-01-09 19:46:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 19:46:44,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:44,342 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 11, 11, 11, 11, 11, 11, 11, 10, 10, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:44,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 19:46:44,342 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:46:44,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1417221420, now seen corresponding path program 1 times [2025-01-09 19:46:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:44,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658699768] [2025-01-09 19:46:44,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:44,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 19:46:44,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 19:46:44,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:44,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 989 trivial. 0 not checked. [2025-01-09 19:46:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658699768] [2025-01-09 19:46:44,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658699768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:44,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:44,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:46:44,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332774301] [2025-01-09 19:46:44,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:44,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:46:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:44,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:46:44,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:46:44,479 INFO L87 Difference]: Start difference. First operand 36917 states and 49225 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 19:46:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 19:46:46,893 INFO L93 Difference]: Finished difference Result 84580 states and 112820 transitions. [2025-01-09 19:46:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 19:46:46,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 295 [2025-01-09 19:46:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 19:46:47,082 INFO L225 Difference]: With dead ends: 84580 [2025-01-09 19:46:47,083 INFO L226 Difference]: Without dead ends: 48675 [2025-01-09 19:46:47,181 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:46:47,182 INFO L435 NwaCegarLoop]: 2706 mSDtfsCounter, 1295 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 19:46:47,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 4095 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 19:46:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48675 states. [2025-01-09 19:46:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48675 to 48613. [2025-01-09 19:46:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48613 states, 35518 states have (on average 1.2271524297539276) internal successors, (43586), 36258 states have internal predecessors, (43586), 10152 states have call successors, (10152), 3007 states have call predecessors, (10152), 2940 states have return successors, (11055), 9809 states have call predecessors, (11055), 10148 states have call successors, (11055) [2025-01-09 19:46:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48613 states to 48613 states and 64793 transitions. [2025-01-09 19:46:49,345 INFO L78 Accepts]: Start accepts. Automaton has 48613 states and 64793 transitions. Word has length 295 [2025-01-09 19:46:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 19:46:49,346 INFO L471 AbstractCegarLoop]: Abstraction has 48613 states and 64793 transitions. [2025-01-09 19:46:49,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 19:46:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 48613 states and 64793 transitions. [2025-01-09 19:46:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-09 19:46:49,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 19:46:49,351 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 11, 11, 11, 11, 11, 11, 11, 10, 10, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:49,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 19:46:49,351 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 19:46:49,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 19:46:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2003497642, now seen corresponding path program 1 times [2025-01-09 19:46:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 19:46:49,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336115177] [2025-01-09 19:46:49,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 19:46:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 19:46:49,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 19:46:49,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 19:46:49,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 19:46:49,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 19:46:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 989 trivial. 0 not checked. [2025-01-09 19:46:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 19:46:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336115177] [2025-01-09 19:46:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336115177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 19:46:49,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 19:46:49,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 19:46:49,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62035613] [2025-01-09 19:46:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 19:46:49,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 19:46:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 19:46:49,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 19:46:49,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 19:46:49,482 INFO L87 Difference]: Start difference. First operand 48613 states and 64793 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2025-01-09 19:46:53,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []