./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-798a7b3-m [2025-03-04 05:11:02,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:11:02,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 05:11:02,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:11:02,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:11:02,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:11:02,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:11:02,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:11:02,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:11:02,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:11:02,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:11:02,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:11:02,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:11:02,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:11:02,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:11:02,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:11:02,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:11:02,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:11:02,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:11:02,697 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/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-03-04 05:11:02,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:11:02,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:11:02,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:11:02,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:11:02,968 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:11:02,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-04 05:11:04,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d034ab2c1/0f150fac4dc44a8db9e88acb0c9762aa/FLAG84737515f [2025-03-04 05:11:04,707 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:11:04,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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-03-04 05:11:04,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d034ab2c1/0f150fac4dc44a8db9e88acb0c9762aa/FLAG84737515f [2025-03-04 05:11:05,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d034ab2c1/0f150fac4dc44a8db9e88acb0c9762aa [2025-03-04 05:11:05,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:11:05,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:11:05,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:11:05,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:11:05,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:11:05,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:11:05" (1/1) ... [2025-03-04 05:11:05,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1820a8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:05, skipping insertion in model container [2025-03-04 05:11:05,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:11:05" (1/1) ... [2025-03-04 05:11:05,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:11:07,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-04 05:11:07,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-04 05:11:07,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-04 05:11:07,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-04 05:11:07,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:11:07,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:11:07,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [6219] [2025-03-04 05:11:07,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6222] [2025-03-04 05:11:07,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6225] [2025-03-04 05:11:07,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [6228] [2025-03-04 05:11:07,333 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-03-04 05:11:07,336 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-03-04 05:11:07,336 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-03-04 05:11:07,336 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-03-04 05:11:07,337 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-03-04 05:11:07,337 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-03-04 05:11:07,337 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-03-04 05:11:07,337 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-03-04 05:11:07,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-04 05:11:07,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-04 05:11:07,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-04 05:11:07,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/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-03-04 05:11:07,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:11:07,522 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:11:07,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07 WrapperNode [2025-03-04 05:11:07,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:11:07,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:11:07,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:11:07,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:11:07,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:07,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:07,654 INFO L138 Inliner]: procedures = 327, calls = 936, calls flagged for inlining = 153, calls inlined = 140, statements flattened = 2787 [2025-03-04 05:11:07,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:11:07,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:11:07,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:11:07,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:11:07,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:07,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:07,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:07,972 INFO L175 MemorySlicer]: Split 272 memory accesses to 11 slices as follows [158, 5, 2, 14, 1, 2, 25, 52, 6, 5, 2]. 58 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [0, 0, 0, 0, 1, 2, 0, 0, 6, 0, 1]. The 123 writes are split as follows [26, 4, 1, 12, 0, 0, 23, 52, 0, 5, 0]. [2025-03-04 05:11:07,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:07,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:08,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:08,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:08,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:08,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:08,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:11:08,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:11:08,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:11:08,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:11:08,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (1/1) ... [2025-03-04 05:11:08,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:11:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:11:08,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:11:08,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:11:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-03-04 05:11:08,146 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-03-04 05:11:08,146 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-03-04 05:11:08,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-03-04 05:11:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 05:11:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 05:11:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 05:11:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 05:11:08,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 05:11:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 05:11:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 05:11:08,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 05:11:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 05:11:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 05:11:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 05:11:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 05:11:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 05:11:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 05:11:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 05:11:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:11:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-04 05:11:08,149 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-04 05:11:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-04 05:11:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_request [2025-03-04 05:11:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_request [2025-03-04 05:11:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure spi_sync [2025-03-04 05:11:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_sync [2025-03-04 05:11:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 05:11:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 05:11:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_irq_unsubscribe [2025-03-04 05:11:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_irq_unsubscribe [2025-03-04 05:11:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-03-04 05:11:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-03-04 05:11:08,150 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~bool~0~TO~int [2025-03-04 05:11:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~bool~0~TO~int [2025-03-04 05:11:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_unlock [2025-03-04 05:11:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_unlock [2025-03-04 05:11:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:11:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-04 05:11:08,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_66 [2025-03-04 05:11:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_66 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2025-03-04 05:11:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-04 05:11:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 05:11:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_hwbus_priv [2025-03-04 05:11:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_hwbus_priv [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 05:11:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_add_tail [2025-03-04 05:11:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_add_tail [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-04 05:11:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-04 05:11:08,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-04 05:11:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2025-03-04 05:11:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 05:11:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_probe [2025-03-04 05:11:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_probe [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-04 05:11:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-03-04 05:11:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2025-03-04 05:11:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2025-03-04 05:11:08,153 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 05:11:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 05:11:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_disconnect [2025-03-04 05:11:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_disconnect [2025-03-04 05:11:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2025-03-04 05:11:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2025-03-04 05:11:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 05:11:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 05:11:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_set_value [2025-03-04 05:11:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_set_value [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_direction_output [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_direction_output [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_off [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_off [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_3 [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_3 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_init [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_init [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:11:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 05:11:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure spi_get_drvdata [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_get_drvdata [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_lock [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_lock [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_resume [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_resume [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_spi_driver_exit_9_2 [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_spi_driver_exit_9_2 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure cw1200_spi_pm [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure cw1200_spi_pm [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2025-03-04 05:11:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:11:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:11:08,642 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:11:08,644 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:11:08,672 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 05:11:08,685 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11309: havoc #t~nondet518; [2025-03-04 05:11:08,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11298: havoc #t~nondet515; [2025-03-04 05:11:08,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11359: havoc #t~nondet523; [2025-03-04 05:11:08,783 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6870: call ULTIMATE.dealloc(~#descriptor~1#1.base, ~#descriptor~1#1.offset);havoc ~#descriptor~1#1.base, ~#descriptor~1#1.offset; [2025-03-04 05:11:08,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11247: havoc #t~nondet512; [2025-03-04 05:11:08,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11301: havoc gpio_to_desc_#t~ret516#1.base, gpio_to_desc_#t~ret516#1.offset; [2025-03-04 05:11:08,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11305: havoc gpiod_direction_output_#t~nondet517#1; [2025-03-04 05:11:08,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6293: havoc #t~mem38.base, #t~mem38.offset; [2025-03-04 05:11:08,975 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9475: havoc ldv_dev_get_drvdata_#t~mem414#1.base, ldv_dev_get_drvdata_#t~mem414#1.offset;havoc ldv_dev_get_drvdata_#t~mem415#1.base, ldv_dev_get_drvdata_#t~mem415#1.offset; [2025-03-04 05:11:08,993 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11337: havoc #t~nondet519; [2025-03-04 05:11:09,057 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6610: call ULTIMATE.dealloc(~#wait~0#1.base, ~#wait~0#1.offset);havoc ~#wait~0#1.base, ~#wait~0#1.offset; [2025-03-04 05:11:09,104 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6188: havoc #t~bitwise4; [2025-03-04 05:11:21,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6444: call ULTIMATE.dealloc(cw1200_spi_memcpy_fromio_~#regaddr~0#1.base, cw1200_spi_memcpy_fromio_~#regaddr~0#1.offset);havoc cw1200_spi_memcpy_fromio_~#regaddr~0#1.base, cw1200_spi_memcpy_fromio_~#regaddr~0#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_fromio_~#m~0#1.base, cw1200_spi_memcpy_fromio_~#m~0#1.offset);havoc cw1200_spi_memcpy_fromio_~#m~0#1.base, cw1200_spi_memcpy_fromio_~#m~0#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_fromio_~#t_addr~0#1.base, cw1200_spi_memcpy_fromio_~#t_addr~0#1.offset);havoc cw1200_spi_memcpy_fromio_~#t_addr~0#1.base, cw1200_spi_memcpy_fromio_~#t_addr~0#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_fromio_~#t_msg~0#1.base, cw1200_spi_memcpy_fromio_~#t_msg~0#1.offset);havoc cw1200_spi_memcpy_fromio_~#t_msg~0#1.base, cw1200_spi_memcpy_fromio_~#t_msg~0#1.offset; [2025-03-04 05:11:21,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11275: havoc cw1200_can_suspend_#t~nondet513#1; [2025-03-04 05:11:21,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint main_returnLabel#1: #t~ret526#1 := main_#res#1;havoc main_#t~ret266#1, main_~tmp~19#1;assume { :end_inline_main } true; [2025-03-04 05:11:21,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6520: call ULTIMATE.dealloc(cw1200_spi_memcpy_toio_~#regaddr~1#1.base, cw1200_spi_memcpy_toio_~#regaddr~1#1.offset);havoc cw1200_spi_memcpy_toio_~#regaddr~1#1.base, cw1200_spi_memcpy_toio_~#regaddr~1#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_toio_~#t_addr~1#1.base, cw1200_spi_memcpy_toio_~#t_addr~1#1.offset);havoc cw1200_spi_memcpy_toio_~#t_addr~1#1.base, cw1200_spi_memcpy_toio_~#t_addr~1#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_toio_~#t_msg~1#1.base, cw1200_spi_memcpy_toio_~#t_msg~1#1.offset);havoc cw1200_spi_memcpy_toio_~#t_msg~1#1.base, cw1200_spi_memcpy_toio_~#t_msg~1#1.offset;call ULTIMATE.dealloc(cw1200_spi_memcpy_toio_~#m~1#1.base, cw1200_spi_memcpy_toio_~#m~1#1.offset);havoc cw1200_spi_memcpy_toio_~#m~1#1.base, cw1200_spi_memcpy_toio_~#m~1#1.offset; [2025-03-04 05:11:21,709 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11351: havoc spi_register_driver_#t~nondet521#1; [2025-03-04 05:11:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8907-1: ldv_spi_register_driver_#res#1 := ldv_spi_register_driver_~arg0#1; [2025-03-04 05:11:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9457-1: ldv_spi_register_driver_74_#res#1 := ldv_spi_register_driver_74_~ldv_func_res~1#1; [2025-03-04 05:11:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-03-04 05:11:21,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8025: call ULTIMATE.dealloc(ldv_io_instance_callback_0_17_~#arg2#1.base, ldv_io_instance_callback_0_17_~#arg2#1.offset);havoc ldv_io_instance_callback_0_17_~#arg2#1.base, ldv_io_instance_callback_0_17_~#arg2#1.offset; [2025-03-04 05:11:21,918 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7024: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset;call ULTIMATE.dealloc(~#__key___0~0#1.base, ~#__key___0~0#1.offset);havoc ~#__key___0~0#1.base, ~#__key___0~0#1.offset; [2025-03-04 05:11:21,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8882-1: ldv_request_threaded_irq_#res#1 := ldv_request_threaded_irq_~arg0#1; [2025-03-04 05:11:21,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11344: havoc request_threaded_irq_#t~nondet520#1; [2025-03-04 05:11:21,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6795: call ULTIMATE.dealloc(cw1200_spi_irq_subscribe_~#descriptor~0#1.base, cw1200_spi_irq_subscribe_~#descriptor~0#1.offset);havoc cw1200_spi_irq_subscribe_~#descriptor~0#1.base, cw1200_spi_irq_subscribe_~#descriptor~0#1.offset; [2025-03-04 05:11:21,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11279: havoc cw1200_core_probe_#t~nondet514#1; [2025-03-04 05:11:21,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9422-1: ldv_request_threaded_irq_71_#res#1 := ldv_request_threaded_irq_71_~ldv_func_res~0#1; [2025-03-04 05:11:21,919 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11355: havoc spi_setup_#t~nondet522#1; [2025-03-04 05:11:22,333 INFO L? ?]: Removed 1137 outVars from TransFormulas that were not future-live. [2025-03-04 05:11:22,333 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:11:22,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:11:22,418 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 05:11:22,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:11:22 BoogieIcfgContainer [2025-03-04 05:11:22,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:11:22,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:11:22,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:11:22,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:11:22,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:11:05" (1/3) ... [2025-03-04 05:11:22,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a647b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:11:22, skipping insertion in model container [2025-03-04 05:11:22,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:11:07" (2/3) ... [2025-03-04 05:11:22,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a647b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:11:22, skipping insertion in model container [2025-03-04 05:11:22,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:11:22" (3/3) ... [2025-03-04 05:11:22,431 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wireless-cw1200-cw1200_wlan_spi.cil.i [2025-03-04 05:11:22,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:11:22,446 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, 1088 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-04 05:11:22,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:11:22,532 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;@366b367a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:11:22,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 05:11:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 1086 states, 775 states have (on average 1.2825806451612902) internal successors, (994), 789 states have internal predecessors, (994), 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-03-04 05:11:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 05:11:22,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:22,558 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-03-04 05:11:22,559 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-03-04 05:11:22,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1174484624, now seen corresponding path program 1 times [2025-03-04 05:11:22,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562878303] [2025-03-04 05:11:22,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:22,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:22,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 05:11:22,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 05:11:22,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:22,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-04 05:11:23,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562878303] [2025-03-04 05:11:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562878303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:23,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:11:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606066044] [2025-03-04 05:11:23,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:11:23,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:23,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:11:23,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:11:23,367 INFO L87 Difference]: Start difference. First operand has 1086 states, 775 states have (on average 1.2825806451612902) internal successors, (994), 789 states have internal predecessors, (994), 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-03-04 05:11:26,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:11:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:27,287 INFO L93 Difference]: Finished difference Result 2961 states and 4156 transitions. [2025-03-04 05:11:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:11:27,289 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-03-04 05:11:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:27,313 INFO L225 Difference]: With dead ends: 2961 [2025-03-04 05:11:27,314 INFO L226 Difference]: Without dead ends: 1886 [2025-03-04 05:11:27,325 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-03-04 05:11:27,329 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 1124 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:27,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 2883 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-04 05:11:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2025-03-04 05:11:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1859. [2025-03-04 05:11:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1341 states have (on average 1.2468307233407905) internal successors, (1672), 1368 states have internal predecessors, (1672), 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-03-04 05:11:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2504 transitions. [2025-03-04 05:11:27,514 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2504 transitions. Word has length 151 [2025-03-04 05:11:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:27,515 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2504 transitions. [2025-03-04 05:11:27,515 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-03-04 05:11:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2504 transitions. [2025-03-04 05:11:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 05:11:27,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:27,524 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-03-04 05:11:27,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:11:27,524 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-03-04 05:11:27,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash 501087875, now seen corresponding path program 1 times [2025-03-04 05:11:27,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:27,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661389809] [2025-03-04 05:11:27,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:27,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:27,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 05:11:27,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 05:11:27,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:27,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-04 05:11:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:27,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661389809] [2025-03-04 05:11:27,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661389809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:27,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:11:27,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486247326] [2025-03-04 05:11:27,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:11:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:27,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:11:27,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:11:27,812 INFO L87 Difference]: Start difference. First operand 1859 states and 2504 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-03-04 05:11:29,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:11:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:29,556 INFO L93 Difference]: Finished difference Result 5376 states and 7235 transitions. [2025-03-04 05:11:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:11:29,557 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-03-04 05:11:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:29,579 INFO L225 Difference]: With dead ends: 5376 [2025-03-04 05:11:29,579 INFO L226 Difference]: Without dead ends: 3544 [2025-03-04 05:11:29,588 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-03-04 05:11:29,589 INFO L435 NwaCegarLoop]: 1434 mSDtfsCounter, 1282 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:29,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 2796 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 05:11:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2025-03-04 05:11:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3540. [2025-03-04 05:11:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 2574 states have (on average 1.2466977466977467) internal successors, (3209), 2620 states have internal predecessors, (3209), 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-03-04 05:11:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 4749 transitions. [2025-03-04 05:11:29,760 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 4749 transitions. Word has length 151 [2025-03-04 05:11:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:29,760 INFO L471 AbstractCegarLoop]: Abstraction has 3540 states and 4749 transitions. [2025-03-04 05:11:29,760 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-03-04 05:11:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4749 transitions. [2025-03-04 05:11:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 05:11:29,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:29,764 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-03-04 05:11:29,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:11:29,764 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-03-04 05:11:29,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1695834974, now seen corresponding path program 1 times [2025-03-04 05:11:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:29,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117783851] [2025-03-04 05:11:29,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:29,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 05:11:29,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 05:11:29,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:29,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-04 05:11:29,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:29,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117783851] [2025-03-04 05:11:29,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117783851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:29,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:29,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:11:29,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285185304] [2025-03-04 05:11:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:29,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:11:29,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:29,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:11:29,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:11:29,930 INFO L87 Difference]: Start difference. First operand 3540 states and 4749 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-03-04 05:11:33,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:11:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:33,425 INFO L93 Difference]: Finished difference Result 8421 states and 11270 transitions. [2025-03-04 05:11:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:11:33,426 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-03-04 05:11:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:33,451 INFO L225 Difference]: With dead ends: 8421 [2025-03-04 05:11:33,451 INFO L226 Difference]: Without dead ends: 4908 [2025-03-04 05:11:33,459 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-03-04 05:11:33,461 INFO L435 NwaCegarLoop]: 1436 mSDtfsCounter, 1198 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:33,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2816 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-04 05:11:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2025-03-04 05:11:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4879. [2025-03-04 05:11:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4879 states, 3525 states have (on average 1.2363120567375887) internal successors, (4358), 3600 states have internal predecessors, (4358), 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-03-04 05:11:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 6502 transitions. [2025-03-04 05:11:33,607 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 6502 transitions. Word has length 157 [2025-03-04 05:11:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:33,608 INFO L471 AbstractCegarLoop]: Abstraction has 4879 states and 6502 transitions. [2025-03-04 05:11:33,608 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-03-04 05:11:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 6502 transitions. [2025-03-04 05:11:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 05:11:33,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:33,610 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-03-04 05:11:33,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:11:33,610 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-03-04 05:11:33,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1214179373, now seen corresponding path program 1 times [2025-03-04 05:11:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:33,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091714348] [2025-03-04 05:11:33,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:33,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 05:11:33,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 05:11:33,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:33,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2025-03-04 05:11:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091714348] [2025-03-04 05:11:33,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091714348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:33,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:33,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:11:33,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612395538] [2025-03-04 05:11:33,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:33,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:11:33,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:33,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:11:33,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:11:33,831 INFO L87 Difference]: Start difference. First operand 4879 states and 6502 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-03-04 05:11:35,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:11:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:35,722 INFO L93 Difference]: Finished difference Result 14169 states and 19126 transitions. [2025-03-04 05:11:35,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:11:35,723 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-03-04 05:11:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:35,767 INFO L225 Difference]: With dead ends: 14169 [2025-03-04 05:11:35,768 INFO L226 Difference]: Without dead ends: 9317 [2025-03-04 05:11:35,782 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-03-04 05:11:35,783 INFO L435 NwaCegarLoop]: 1455 mSDtfsCounter, 1372 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:35,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 2832 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 05:11:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9317 states. [2025-03-04 05:11:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9317 to 9280. [2025-03-04 05:11:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9280 states, 6716 states have (on average 1.2398749255509232) internal successors, (8327), 6876 states have internal predecessors, (8327), 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-03-04 05:11:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9280 states to 9280 states and 12593 transitions. [2025-03-04 05:11:36,100 INFO L78 Accepts]: Start accepts. Automaton has 9280 states and 12593 transitions. Word has length 163 [2025-03-04 05:11:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:36,100 INFO L471 AbstractCegarLoop]: Abstraction has 9280 states and 12593 transitions. [2025-03-04 05:11:36,100 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-03-04 05:11:36,101 INFO L276 IsEmpty]: Start isEmpty. Operand 9280 states and 12593 transitions. [2025-03-04 05:11:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 05:11:36,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:36,105 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-03-04 05:11:36,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:11:36,106 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-03-04 05:11:36,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1593534493, now seen corresponding path program 1 times [2025-03-04 05:11:36,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:36,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733480210] [2025-03-04 05:11:36,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:36,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 05:11:36,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 05:11:36,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:36,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-03-04 05:11:36,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:36,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733480210] [2025-03-04 05:11:36,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733480210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:36,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:36,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:11:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035701386] [2025-03-04 05:11:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:36,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:11:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:36,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:11:36,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:11:36,329 INFO L87 Difference]: Start difference. First operand 9280 states and 12593 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-03-04 05:11:38,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:11:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:38,467 INFO L93 Difference]: Finished difference Result 22887 states and 30933 transitions. [2025-03-04 05:11:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:11:38,467 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-03-04 05:11:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:38,544 INFO L225 Difference]: With dead ends: 22887 [2025-03-04 05:11:38,545 INFO L226 Difference]: Without dead ends: 13634 [2025-03-04 05:11:38,584 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-03-04 05:11:38,585 INFO L435 NwaCegarLoop]: 1716 mSDtfsCounter, 1274 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 3090 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:38,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 3090 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 05:11:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13634 states. [2025-03-04 05:11:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13634 to 13593. [2025-03-04 05:11:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13593 states, 9846 states have (on average 1.2297379646556978) internal successors, (12108), 10106 states have internal predecessors, (12108), 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-03-04 05:11:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13593 states to 13593 states and 18229 transitions. [2025-03-04 05:11:39,085 INFO L78 Accepts]: Start accepts. Automaton has 13593 states and 18229 transitions. Word has length 175 [2025-03-04 05:11:39,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:39,087 INFO L471 AbstractCegarLoop]: Abstraction has 13593 states and 18229 transitions. [2025-03-04 05:11:39,088 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-03-04 05:11:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 13593 states and 18229 transitions. [2025-03-04 05:11:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 05:11:39,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:39,090 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-03-04 05:11:39,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:11:39,091 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-03-04 05:11:39,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1527953473, now seen corresponding path program 1 times [2025-03-04 05:11:39,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:39,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23050026] [2025-03-04 05:11:39,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:39,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 05:11:39,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 05:11:39,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:39,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:39,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-03-04 05:11:39,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:39,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23050026] [2025-03-04 05:11:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23050026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:11:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933901139] [2025-03-04 05:11:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:39,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:11:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:39,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:11:39,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:11:39,244 INFO L87 Difference]: Start difference. First operand 13593 states and 18229 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-03-04 05:11:40,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:11:40,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:40,974 INFO L93 Difference]: Finished difference Result 37630 states and 50616 transitions. [2025-03-04 05:11:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:11:40,975 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-03-04 05:11:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:41,084 INFO L225 Difference]: With dead ends: 37630 [2025-03-04 05:11:41,085 INFO L226 Difference]: Without dead ends: 25041 [2025-03-04 05:11:41,129 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-03-04 05:11:41,130 INFO L435 NwaCegarLoop]: 2669 mSDtfsCounter, 1255 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 4057 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:41,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 4057 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 05:11:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25041 states. [2025-03-04 05:11:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25041 to 25037. [2025-03-04 05:11:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25037 states, 18226 states have (on average 1.2300010973334796) internal successors, (22418), 18646 states have internal predecessors, (22418), 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-03-04 05:11:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25037 states to 25037 states and 33557 transitions. [2025-03-04 05:11:42,173 INFO L78 Accepts]: Start accepts. Automaton has 25037 states and 33557 transitions. Word has length 209 [2025-03-04 05:11:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:42,174 INFO L471 AbstractCegarLoop]: Abstraction has 25037 states and 33557 transitions. [2025-03-04 05:11:42,175 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-03-04 05:11:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 25037 states and 33557 transitions. [2025-03-04 05:11:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 05:11:42,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:42,179 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-03-04 05:11:42,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:11:42,179 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-03-04 05:11:42,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:42,179 INFO L85 PathProgramCache]: Analyzing trace with hash -566339456, now seen corresponding path program 1 times [2025-03-04 05:11:42,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453274063] [2025-03-04 05:11:42,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:42,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 05:11:42,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 05:11:42,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:42,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2025-03-04 05:11:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453274063] [2025-03-04 05:11:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453274063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:42,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:11:42,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432369474] [2025-03-04 05:11:42,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:42,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:11:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:42,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:11:42,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:11:42,497 INFO L87 Difference]: Start difference. First operand 25037 states and 33557 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-03-04 05:11:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:43,164 INFO L93 Difference]: Finished difference Result 25043 states and 33562 transitions. [2025-03-04 05:11:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:11:43,164 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-03-04 05:11:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:43,264 INFO L225 Difference]: With dead ends: 25043 [2025-03-04 05:11:43,264 INFO L226 Difference]: Without dead ends: 25041 [2025-03-04 05:11:43,276 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-03-04 05:11:43,277 INFO L435 NwaCegarLoop]: 1418 mSDtfsCounter, 1368 mSDsluCounter, 2823 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:43,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 4241 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:11:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25041 states. [2025-03-04 05:11:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25041 to 25041. [2025-03-04 05:11:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25041 states, 18229 states have (on average 1.2299632453782434) internal successors, (22421), 18649 states have internal predecessors, (22421), 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-03-04 05:11:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25041 states to 25041 states and 33560 transitions. [2025-03-04 05:11:44,047 INFO L78 Accepts]: Start accepts. Automaton has 25041 states and 33560 transitions. Word has length 209 [2025-03-04 05:11:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:44,048 INFO L471 AbstractCegarLoop]: Abstraction has 25041 states and 33560 transitions. [2025-03-04 05:11:44,048 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-03-04 05:11:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 25041 states and 33560 transitions. [2025-03-04 05:11:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-04 05:11:44,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:44,052 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-03-04 05:11:44,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 05:11:44,053 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-03-04 05:11:44,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:44,053 INFO L85 PathProgramCache]: Analyzing trace with hash 30980453, now seen corresponding path program 1 times [2025-03-04 05:11:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:44,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916181082] [2025-03-04 05:11:44,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:44,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:44,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-04 05:11:44,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-04 05:11:44,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:44,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2025-03-04 05:11:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916181082] [2025-03-04 05:11:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916181082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:44,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:44,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:11:44,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093506068] [2025-03-04 05:11:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:44,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:11:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:44,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:11:44,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:11:44,366 INFO L87 Difference]: Start difference. First operand 25041 states and 33560 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-03-04 05:11:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:45,207 INFO L93 Difference]: Finished difference Result 25047 states and 33565 transitions. [2025-03-04 05:11:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:11:45,208 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-03-04 05:11:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:45,330 INFO L225 Difference]: With dead ends: 25047 [2025-03-04 05:11:45,330 INFO L226 Difference]: Without dead ends: 25045 [2025-03-04 05:11:45,347 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-03-04 05:11:45,348 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 1364 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:45,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 4245 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:11:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25045 states. [2025-03-04 05:11:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25045 to 25045. [2025-03-04 05:11:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25045 states, 18232 states have (on average 1.2299254058797717) internal successors, (22424), 18652 states have internal predecessors, (22424), 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-03-04 05:11:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25045 states to 25045 states and 33563 transitions. [2025-03-04 05:11:46,255 INFO L78 Accepts]: Start accepts. Automaton has 25045 states and 33563 transitions. Word has length 214 [2025-03-04 05:11:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:46,255 INFO L471 AbstractCegarLoop]: Abstraction has 25045 states and 33563 transitions. [2025-03-04 05:11:46,256 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-03-04 05:11:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 25045 states and 33563 transitions. [2025-03-04 05:11:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-04 05:11:46,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:46,260 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-03-04 05:11:46,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 05:11:46,261 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-03-04 05:11:46,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1717766112, now seen corresponding path program 1 times [2025-03-04 05:11:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:46,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114281967] [2025-03-04 05:11:46,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-04 05:11:46,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-04 05:11:46,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:46,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-03-04 05:11:46,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:46,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114281967] [2025-03-04 05:11:46,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114281967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:11:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065135587] [2025-03-04 05:11:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:46,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:11:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:46,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:11:46,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:11:46,746 INFO L87 Difference]: Start difference. First operand 25045 states and 33563 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-03-04 05:11:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:47,351 INFO L93 Difference]: Finished difference Result 25051 states and 33568 transitions. [2025-03-04 05:11:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:11:47,352 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-03-04 05:11:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:47,460 INFO L225 Difference]: With dead ends: 25051 [2025-03-04 05:11:47,461 INFO L226 Difference]: Without dead ends: 25049 [2025-03-04 05:11:47,473 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-03-04 05:11:47,473 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 1363 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:47,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 4245 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:11:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25049 states. [2025-03-04 05:11:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25049 to 25049. [2025-03-04 05:11:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25049 states, 18235 states have (on average 1.2298875788319166) internal successors, (22427), 18655 states have internal predecessors, (22427), 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-03-04 05:11:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25049 states to 25049 states and 33566 transitions. [2025-03-04 05:11:48,363 INFO L78 Accepts]: Start accepts. Automaton has 25049 states and 33566 transitions. Word has length 219 [2025-03-04 05:11:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:48,364 INFO L471 AbstractCegarLoop]: Abstraction has 25049 states and 33566 transitions. [2025-03-04 05:11:48,364 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-03-04 05:11:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 25049 states and 33566 transitions. [2025-03-04 05:11:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-04 05:11:48,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:48,369 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-03-04 05:11:48,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 05:11:48,370 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-03-04 05:11:48,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash 870348421, now seen corresponding path program 1 times [2025-03-04 05:11:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551344358] [2025-03-04 05:11:48,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:48,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:48,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-04 05:11:48,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-04 05:11:48,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:48,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-03-04 05:11:48,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:48,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551344358] [2025-03-04 05:11:48,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551344358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:48,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:48,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:11:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102861247] [2025-03-04 05:11:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:48,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:11:48,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:48,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:11:48,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:11:48,646 INFO L87 Difference]: Start difference. First operand 25049 states and 33566 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-03-04 05:11:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:49,589 INFO L93 Difference]: Finished difference Result 25055 states and 33571 transitions. [2025-03-04 05:11:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:11:49,589 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-03-04 05:11:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:49,728 INFO L225 Difference]: With dead ends: 25055 [2025-03-04 05:11:49,728 INFO L226 Difference]: Without dead ends: 25053 [2025-03-04 05:11:49,747 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-03-04 05:11:49,749 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 1362 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:49,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 4245 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:11:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25053 states. [2025-03-04 05:11:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25053 to 25053. [2025-03-04 05:11:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25053 states, 18238 states have (on average 1.2298497642285338) internal successors, (22430), 18658 states have internal predecessors, (22430), 5344 states have call successors, (5344), 1503 states have call predecessors, (5344), 1468 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-03-04 05:11:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25053 states to 25053 states and 33569 transitions. [2025-03-04 05:11:51,208 INFO L78 Accepts]: Start accepts. Automaton has 25053 states and 33569 transitions. Word has length 224 [2025-03-04 05:11:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:51,211 INFO L471 AbstractCegarLoop]: Abstraction has 25053 states and 33569 transitions. [2025-03-04 05:11:51,211 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-03-04 05:11:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 25053 states and 33569 transitions. [2025-03-04 05:11:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-04 05:11:51,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:51,216 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-03-04 05:11:51,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:11:51,217 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-03-04 05:11:51,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 453660480, now seen corresponding path program 1 times [2025-03-04 05:11:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:51,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946857728] [2025-03-04 05:11:51,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:51,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:51,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 05:11:51,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 05:11:51,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:51,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2025-03-04 05:11:51,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946857728] [2025-03-04 05:11:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946857728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:51,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:51,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:11:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681380347] [2025-03-04 05:11:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:51,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:11:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:51,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:11:51,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:11:51,478 INFO L87 Difference]: Start difference. First operand 25053 states and 33569 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-03-04 05:11:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:52,201 INFO L93 Difference]: Finished difference Result 25059 states and 33574 transitions. [2025-03-04 05:11:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:11:52,201 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-03-04 05:11:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:52,299 INFO L225 Difference]: With dead ends: 25059 [2025-03-04 05:11:52,300 INFO L226 Difference]: Without dead ends: 25057 [2025-03-04 05:11:52,310 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-03-04 05:11:52,311 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 1361 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:52,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 4245 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:11:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25057 states. [2025-03-04 05:11:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25057 to 25057. [2025-03-04 05:11:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25057 states, 18241 states have (on average 1.2298119620634833) internal successors, (22433), 18661 states have internal predecessors, (22433), 5344 states have call successors, (5344), 1504 states have call predecessors, (5344), 1469 states have return successors, (5795), 5129 states have call predecessors, (5795), 5340 states have call successors, (5795) [2025-03-04 05:11:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25057 states to 25057 states and 33572 transitions. [2025-03-04 05:11:53,148 INFO L78 Accepts]: Start accepts. Automaton has 25057 states and 33572 transitions. Word has length 229 [2025-03-04 05:11:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:53,149 INFO L471 AbstractCegarLoop]: Abstraction has 25057 states and 33572 transitions. [2025-03-04 05:11:53,149 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-03-04 05:11:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 25057 states and 33572 transitions. [2025-03-04 05:11:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-04 05:11:53,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:53,155 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 6, 5, 5, 5, 5, 5, 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] [2025-03-04 05:11:53,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 05:11:53,156 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-03-04 05:11:53,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2111009610, now seen corresponding path program 1 times [2025-03-04 05:11:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:53,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874650793] [2025-03-04 05:11:53,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:53,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-04 05:11:53,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-04 05:11:53,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:53,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:11:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2025-03-04 05:11:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:11:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874650793] [2025-03-04 05:11:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874650793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:11:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:11:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:11:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128568452] [2025-03-04 05:11:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:11:53,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:11:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:11:53,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:11:53,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:11:53,315 INFO L87 Difference]: Start difference. First operand 25057 states and 33572 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 05:11:56,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 05:11:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:11:57,800 INFO L93 Difference]: Finished difference Result 60612 states and 81377 transitions. [2025-03-04 05:11:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:11:57,801 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 245 [2025-03-04 05:11:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:11:57,983 INFO L225 Difference]: With dead ends: 60612 [2025-03-04 05:11:57,983 INFO L226 Difference]: Without dead ends: 36559 [2025-03-04 05:11:58,067 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-03-04 05:11:58,068 INFO L435 NwaCegarLoop]: 2670 mSDtfsCounter, 1287 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 4060 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-04 05:11:58,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 4060 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-04 05:11:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36559 states. [2025-03-04 05:11:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36559 to 36517. [2025-03-04 05:11:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36517 states, 26637 states have (on average 1.2298306866388857) internal successors, (32759), 27217 states have internal predecessors, (32759), 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-03-04 05:11:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36517 states to 36517 states and 48916 transitions. [2025-03-04 05:11:59,851 INFO L78 Accepts]: Start accepts. Automaton has 36517 states and 48916 transitions. Word has length 245 [2025-03-04 05:11:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:11:59,852 INFO L471 AbstractCegarLoop]: Abstraction has 36517 states and 48916 transitions. [2025-03-04 05:11:59,852 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 05:11:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 36517 states and 48916 transitions. [2025-03-04 05:11:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-04 05:11:59,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:11:59,856 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-03-04 05:11:59,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:11:59,856 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-03-04 05:11:59,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:11:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash 457481125, now seen corresponding path program 1 times [2025-03-04 05:11:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:11:59,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131902231] [2025-03-04 05:11:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:11:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:11:59,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-04 05:11:59,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 05:11:59,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:11:59,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:12:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-04 05:12:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:12:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131902231] [2025-03-04 05:12:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131902231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:12:00,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:12:00,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:12:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640201052] [2025-03-04 05:12:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:12:00,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:12:00,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:12:00,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:12:00,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:12:00,138 INFO L87 Difference]: Start difference. First operand 36517 states and 48916 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-03-04 05:12:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:12:01,872 INFO L93 Difference]: Finished difference Result 36523 states and 48921 transitions. [2025-03-04 05:12:01,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:12:01,876 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-03-04 05:12:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:12:01,992 INFO L225 Difference]: With dead ends: 36523 [2025-03-04 05:12:01,992 INFO L226 Difference]: Without dead ends: 36521 [2025-03-04 05:12:02,005 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-03-04 05:12:02,006 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 1360 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:12:02,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 4245 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:12:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36521 states. [2025-03-04 05:12:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36521 to 36521. [2025-03-04 05:12:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36521 states, 26640 states have (on average 1.2298048048048047) internal successors, (32762), 27220 states have internal predecessors, (32762), 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-03-04 05:12:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36521 states to 36521 states and 48919 transitions. [2025-03-04 05:12:03,294 INFO L78 Accepts]: Start accepts. Automaton has 36521 states and 48919 transitions. Word has length 234 [2025-03-04 05:12:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:12:03,295 INFO L471 AbstractCegarLoop]: Abstraction has 36521 states and 48919 transitions. [2025-03-04 05:12:03,295 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-03-04 05:12:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 36521 states and 48919 transitions. [2025-03-04 05:12:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-04 05:12:03,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:12:03,299 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-03-04 05:12:03,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:12:03,299 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-03-04 05:12:03,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:12:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1948897632, now seen corresponding path program 1 times [2025-03-04 05:12:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:12:03,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70790026] [2025-03-04 05:12:03,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:12:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:12:03,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-04 05:12:03,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-04 05:12:03,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:12:03,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:12:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2025-03-04 05:12:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:12:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70790026] [2025-03-04 05:12:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70790026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:12:03,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:12:03,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:12:03,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349746630] [2025-03-04 05:12:03,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:12:03,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:12:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:12:03,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:12:03,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:12:03,498 INFO L87 Difference]: Start difference. First operand 36521 states and 48919 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-03-04 05:12:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:12:04,529 INFO L93 Difference]: Finished difference Result 37043 states and 49354 transitions. [2025-03-04 05:12:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:12:04,530 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-03-04 05:12:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:12:04,681 INFO L225 Difference]: With dead ends: 37043 [2025-03-04 05:12:04,681 INFO L226 Difference]: Without dead ends: 37041 [2025-03-04 05:12:04,704 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-03-04 05:12:04,705 INFO L435 NwaCegarLoop]: 1419 mSDtfsCounter, 1309 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 4291 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:12:04,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 4291 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:12:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37041 states. [2025-03-04 05:12:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37041 to 37041. [2025-03-04 05:12:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37041 states, 27073 states have (on average 1.2261293539688989) internal successors, (33195), 27653 states have internal predecessors, (33195), 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-03-04 05:12:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37041 states to 37041 states and 49352 transitions. [2025-03-04 05:12:06,950 INFO L78 Accepts]: Start accepts. Automaton has 37041 states and 49352 transitions. Word has length 239 [2025-03-04 05:12:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:12:06,950 INFO L471 AbstractCegarLoop]: Abstraction has 37041 states and 49352 transitions. [2025-03-04 05:12:06,950 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-03-04 05:12:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 37041 states and 49352 transitions. [2025-03-04 05:12:06,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-04 05:12:06,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:12:06,953 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-03-04 05:12:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 05:12:06,954 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-03-04 05:12:06,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:12:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1650251579, now seen corresponding path program 1 times [2025-03-04 05:12:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:12:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526672737] [2025-03-04 05:12:06,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:12:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:12:07,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-04 05:12:07,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 05:12:07,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:12:07,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:12:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2025-03-04 05:12:07,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:12:07,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526672737] [2025-03-04 05:12:07,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526672737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:12:07,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:12:07,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:12:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517755882] [2025-03-04 05:12:07,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:12:07,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:12:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:12:07,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:12:07,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:12:07,155 INFO L87 Difference]: Start difference. First operand 37041 states and 49352 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-03-04 05:12:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:12:08,721 INFO L93 Difference]: Finished difference Result 37047 states and 49357 transitions. [2025-03-04 05:12:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:12:08,722 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-03-04 05:12:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:12:08,850 INFO L225 Difference]: With dead ends: 37047 [2025-03-04 05:12:08,850 INFO L226 Difference]: Without dead ends: 37045 [2025-03-04 05:12:08,871 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-03-04 05:12:08,872 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 1358 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 05:12:08,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 4245 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 05:12:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37045 states. [2025-03-04 05:12:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37045 to 37045. [2025-03-04 05:12:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37045 states, 27076 states have (on average 1.2261042990101936) internal successors, (33198), 27656 states have internal predecessors, (33198), 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-03-04 05:12:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37045 states to 37045 states and 49355 transitions. [2025-03-04 05:12:10,583 INFO L78 Accepts]: Start accepts. Automaton has 37045 states and 49355 transitions. Word has length 244 [2025-03-04 05:12:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:12:10,584 INFO L471 AbstractCegarLoop]: Abstraction has 37045 states and 49355 transitions. [2025-03-04 05:12:10,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, (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-03-04 05:12:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 37045 states and 49355 transitions. [2025-03-04 05:12:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 05:12:10,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:12:10,589 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-03-04 05:12:10,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:12:10,589 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-03-04 05:12:10,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:12:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1511479808, now seen corresponding path program 1 times [2025-03-04 05:12:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:12:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079556784] [2025-03-04 05:12:10,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:12:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:12:10,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 05:12:10,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 05:12:10,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:12:10,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:12:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2025-03-04 05:12:10,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:12:10,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079556784] [2025-03-04 05:12:10,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079556784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:12:10,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:12:10,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 05:12:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248054173] [2025-03-04 05:12:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:12:10,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:12:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:12:10,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:12:10,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:12:10,863 INFO L87 Difference]: Start difference. First operand 37045 states and 49355 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)