./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e2f48ab037d80d8f09964fc14a08b090a2ac957ba1c26211e43b888a860dc78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:32:49,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:32:49,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:32:49,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:32:49,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:32:49,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:32:49,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:32:49,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:32:49,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:32:49,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:32:49,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:32:49,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:32:49,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:32:49,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:32:49,402 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:32:49,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:32:49,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:32:49,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:32:49,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:32:49,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:32:49,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:32:49,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:32:49,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:32:49,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:32:49,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:32:49,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:32:49,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:32:49,405 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e2f48ab037d80d8f09964fc14a08b090a2ac957ba1c26211e43b888a860dc78 [2025-02-06 06:32:49,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:32:49,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:32:49,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:32:49,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:32:49,752 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:32:49,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-02-06 06:32:51,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8a2f8075/07a5031a75d14d748e0e1cf8e7eabd2e/FLAG028cf468f [2025-02-06 06:32:51,718 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:32:51,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-02-06 06:32:51,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8a2f8075/07a5031a75d14d748e0e1cf8e7eabd2e/FLAG028cf468f [2025-02-06 06:32:51,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8a2f8075/07a5031a75d14d748e0e1cf8e7eabd2e [2025-02-06 06:32:51,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:32:51,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:32:51,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:32:51,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:32:51,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:32:51,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:32:51" (1/1) ... [2025-02-06 06:32:51,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a736df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:51, skipping insertion in model container [2025-02-06 06:32:51,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:32:51" (1/1) ... [2025-02-06 06:32:51,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:32:53,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2025-02-06 06:32:53,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:32:53,661 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:32:53,762 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4690] [2025-02-06 06:32:53,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4697] [2025-02-06 06:32:53,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4705-4706] [2025-02-06 06:32:53,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4714-4715] [2025-02-06 06:32:53,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4843] [2025-02-06 06:32:53,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4846] [2025-02-06 06:32:53,771 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4849] [2025-02-06 06:32:53,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4852] [2025-02-06 06:32:53,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5234] [2025-02-06 06:32:53,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5238] [2025-02-06 06:32:53,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5242] [2025-02-06 06:32:53,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5246] [2025-02-06 06:32:53,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5257] [2025-02-06 06:32:53,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5261] [2025-02-06 06:32:53,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5265] [2025-02-06 06:32:53,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5269] [2025-02-06 06:32:53,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5280] [2025-02-06 06:32:53,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5284] [2025-02-06 06:32:53,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5288] [2025-02-06 06:32:53,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5292] [2025-02-06 06:32:53,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5303] [2025-02-06 06:32:53,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5307] [2025-02-06 06:32:53,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5311] [2025-02-06 06:32:53,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5315] [2025-02-06 06:32:53,804 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5365] [2025-02-06 06:32:53,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5369] [2025-02-06 06:32:53,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5373] [2025-02-06 06:32:53,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5377] [2025-02-06 06:32:53,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5388] [2025-02-06 06:32:53,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5392] [2025-02-06 06:32:53,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5396] [2025-02-06 06:32:53,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5400] [2025-02-06 06:32:53,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5411] [2025-02-06 06:32:53,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5415] [2025-02-06 06:32:53,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5419] [2025-02-06 06:32:53,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5423] [2025-02-06 06:32:53,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5434] [2025-02-06 06:32:53,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5438] [2025-02-06 06:32:53,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5442] [2025-02-06 06:32:53,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5446] [2025-02-06 06:32:53,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5520] [2025-02-06 06:32:53,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5524] [2025-02-06 06:32:53,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5528] [2025-02-06 06:32:53,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5532] [2025-02-06 06:32:53,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5543] [2025-02-06 06:32:53,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5547] [2025-02-06 06:32:53,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5551] [2025-02-06 06:32:53,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5555] [2025-02-06 06:32:53,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5566] [2025-02-06 06:32:53,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5570] [2025-02-06 06:32:53,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5574] [2025-02-06 06:32:53,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5578] [2025-02-06 06:32:53,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6518] [2025-02-06 06:32:53,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6521] [2025-02-06 06:32:53,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6524] [2025-02-06 06:32:53,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6527] [2025-02-06 06:32:53,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6530] [2025-02-06 06:32:53,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6543] [2025-02-06 06:32:53,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6546] [2025-02-06 06:32:53,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6549] [2025-02-06 06:32:53,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6552] [2025-02-06 06:32:53,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6555] [2025-02-06 06:32:53,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6577] [2025-02-06 06:32:53,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6580] [2025-02-06 06:32:53,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6583] [2025-02-06 06:32:53,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6586] [2025-02-06 06:32:53,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6589] [2025-02-06 06:32:53,915 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6622-6623] [2025-02-06 06:32:53,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6626-6627] [2025-02-06 06:32:53,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6630-6631] [2025-02-06 06:32:53,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6634-6635] [2025-02-06 06:32:53,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6638-6639] [2025-02-06 06:32:53,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6652] [2025-02-06 06:32:53,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6655] [2025-02-06 06:32:53,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6658] [2025-02-06 06:32:53,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6661] [2025-02-06 06:32:53,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6664] [2025-02-06 06:32:53,921 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6697-6698] [2025-02-06 06:32:53,921 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6701-6702] [2025-02-06 06:32:53,921 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6705-6706] [2025-02-06 06:32:53,921 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6709-6710] [2025-02-06 06:32:53,922 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6713-6714] [2025-02-06 06:32:54,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2025-02-06 06:32:54,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:32:54,120 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:32:54,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54 WrapperNode [2025-02-06 06:32:54,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:32:54,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:32:54,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:32:54,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:32:54,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:54,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:54,335 INFO L138 Inliner]: procedures = 186, calls = 884, calls flagged for inlining = 94, calls inlined = 92, statements flattened = 3448 [2025-02-06 06:32:54,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:32:54,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:32:54,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:32:54,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:32:54,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:54,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:54,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:54,891 INFO L175 MemorySlicer]: Split 434 memory accesses to 10 slices as follows [2, 1, 36, 347, 2, 22, 1, 4, 3, 16]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 5, 0, 0, 0, 0, 0, 0]. The 182 writes are split as follows [0, 1, 36, 120, 0, 22, 0, 1, 0, 2]. [2025-02-06 06:32:54,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:54,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:55,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:55,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:55,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:55,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:55,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:32:55,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:32:55,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:32:55,113 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:32:55,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (1/1) ... [2025-02-06 06:32:55,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:32:55,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:32:55,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:32:55,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:32:55,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2025-02-06 06:32:55,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2025-02-06 06:32:55,190 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2025-02-06 06:32:55,191 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2025-02-06 06:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:32:55,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:32:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:32:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:32:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 06:32:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 06:32:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-02-06 06:32:55,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-02-06 06:32:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2025-02-06 06:32:55,193 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2025-02-06 06:32:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 06:32:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 06:32:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 06:32:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 06:32:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 06:32:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 06:32:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 06:32:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:32:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:32:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:32:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 06:32:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 06:32:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:32:55,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:32:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 06:32:55,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-02-06 06:32:55,196 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-02-06 06:32:55,196 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-02-06 06:32:55,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-02-06 06:32:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-02-06 06:32:55,199 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-02-06 06:32:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:32:55,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:32:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-02-06 06:32:55,199 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-02-06 06:32:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-02-06 06:32:55,199 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2025-02-06 06:32:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-02-06 06:32:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-02-06 06:32:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-02-06 06:32:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-02-06 06:32:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-02-06 06:32:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2025-02-06 06:32:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2025-02-06 06:32:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-02-06 06:32:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2025-02-06 06:32:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:32:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:32:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:32:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:32:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:32:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:32:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:32:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:32:55,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2025-02-06 06:32:55,206 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-02-06 06:32:55,206 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-02-06 06:32:55,207 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 06:32:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:32:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-02-06 06:32:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-02-06 06:32:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-02-06 06:32:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-02-06 06:32:55,814 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:32:55,818 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:32:55,952 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7786: havoc tty_chars_in_buffer_#t~nondet613#1; [2025-02-06 06:32:55,952 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7717: havoc dev_trans_start_#t~nondet599#1; [2025-02-06 06:32:55,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:32:56,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7706: havoc #t~nondet596; [2025-02-06 06:32:56,087 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4722: havoc #t~mem1;havoc #t~bitwise2; [2025-02-06 06:32:56,343 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7702: havoc #t~nondet595; [2025-02-06 06:32:56,720 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7782: havoc slhc_uncompress_#t~nondet612#1; [2025-02-06 06:32:56,720 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7778: havoc slhc_remember_#t~nondet611#1; [2025-02-06 06:32:56,720 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7741: havoc netif_rx_#t~nondet602#1; [2025-02-06 06:32:56,720 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7709: havoc dev_alloc_skb_#t~ret597#1.base, dev_alloc_skb_#t~ret597#1.offset; [2025-02-06 06:32:56,965 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7673: havoc _copy_to_user_#t~nondet592#1; [2025-02-06 06:32:56,965 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7797: havoc tty_mode_ioctl_#t~nondet615#1; [2025-02-06 06:32:57,518 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7733: havoc #t~nondet600; [2025-02-06 06:32:57,625 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7790: havoc #t~nondet614; [2025-02-06 06:32:57,628 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7749: havoc #t~nondet604; [2025-02-06 06:32:57,641 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4927: havoc __kmalloc_#t~ret40#1.base, __kmalloc_#t~ret40#1.offset; [2025-02-06 06:32:57,883 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6953: call ULTIMATE.dealloc(sl_outfill_~#s~0#1.base, sl_outfill_~#s~0#1.offset);havoc sl_outfill_~#s~0#1.base, sl_outfill_~#s~0#1.offset; [2025-02-06 06:32:57,889 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5008: havoc #t~mem65.base, #t~mem65.offset; [2025-02-06 06:33:03,204 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7139: call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset);havoc main_~#ldvarg11~0#1.base, main_~#ldvarg11~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset);havoc main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset);havoc main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7768: havoc slhc_compress_#t~nondet609#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7801: havoc tty_register_ldisc_#t~nondet616#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7737: havoc msleep_interruptible_#t~nondet601#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7805: havoc tty_unregister_ldisc_#t~nondet617#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7774: havoc slhc_init_#t~ret610#1.base, slhc_init_#t~ret610#1.offset; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7478-1: ldv_sl_alloc_bufs_3_#res#1 := ldv_sl_alloc_bufs_3_~ldv_func_res~2#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7713: havoc dev_close_#t~nondet598#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5704: call ULTIMATE.dealloc(sl_encaps_~#p~3#1.base, sl_encaps_~#p~3#1.offset);havoc sl_encaps_~#p~3#1.base, sl_encaps_~#p~3#1.offset; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7753: havoc register_netdevice_#t~nondet605#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7491-1: ldv_register_netdevice_4_#res#1 := ldv_register_netdevice_4_~ldv_func_res~3#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7691: havoc alloc_netdev_mqs_#t~ret593#1.base, alloc_netdev_mqs_#t~ret593#1.offset; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc capable_#t~nondet594#1; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6077: call ULTIMATE.dealloc(sl_alloc_~#name~0#1.base, sl_alloc_~#name~0#1.offset);havoc sl_alloc_~#name~0#1.base, sl_alloc_~#name~0#1.offset;call ULTIMATE.dealloc(sl_alloc_~#__key~0#1.base, sl_alloc_~#__key~0#1.offset);havoc sl_alloc_~#__key~0#1.base, sl_alloc_~#__key~0#1.offset; [2025-02-06 06:33:03,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6212: havoc slip_open_#t~mem340#1.base, slip_open_#t~mem340#1.offset;havoc slip_open_#t~mem341#1; [2025-02-06 06:33:03,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7745: havoc netpoll_trap_#t~nondet603#1; [2025-02-06 06:33:03,692 INFO L? ?]: Removed 1548 outVars from TransFormulas that were not future-live. [2025-02-06 06:33:03,692 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:33:03,760 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:33:03,765 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 06:33:03,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:33:03 BoogieIcfgContainer [2025-02-06 06:33:03,765 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:33:03,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:33:03,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:33:03,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:33:03,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:32:51" (1/3) ... [2025-02-06 06:33:03,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f39a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:33:03, skipping insertion in model container [2025-02-06 06:33:03,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:32:54" (2/3) ... [2025-02-06 06:33:03,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f39a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:33:03, skipping insertion in model container [2025-02-06 06:33:03,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:33:03" (3/3) ... [2025-02-06 06:33:03,777 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-02-06 06:33:03,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:33:03,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i that has 65 procedures, 1247 locations, 1 initial locations, 22 loop locations, and 1 error locations. [2025-02-06 06:33:03,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:33:03,927 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;@5c3de022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:33:03,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:33:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 1204 states, 882 states have (on average 1.4195011337868482) internal successors, (1252), 928 states have internal predecessors, (1252), 263 states have call successors, (263), 55 states have call predecessors, (263), 54 states have return successors, (258), 256 states have call predecessors, (258), 258 states have call successors, (258) [2025-02-06 06:33:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 06:33:03,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:03,960 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-02-06 06:33:03,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:03,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash 731721563, now seen corresponding path program 1 times [2025-02-06 06:33:03,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395557553] [2025-02-06 06:33:03,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:03,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:04,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 06:33:04,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 06:33:04,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:04,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-06 06:33:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395557553] [2025-02-06 06:33:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395557553] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:05,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905029057] [2025-02-06 06:33:05,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:05,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:05,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:05,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:05,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:33:05,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 06:33:06,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 06:33:06,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:06,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:06,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 06:33:06,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-02-06 06:33:06,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:33:06,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905029057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:06,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:33:06,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 06:33:06,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926282872] [2025-02-06 06:33:06,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:06,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 06:33:06,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:06,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 06:33:06,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:33:06,259 INFO L87 Difference]: Start difference. First operand has 1204 states, 882 states have (on average 1.4195011337868482) internal successors, (1252), 928 states have internal predecessors, (1252), 263 states have call successors, (263), 55 states have call predecessors, (263), 54 states have return successors, (258), 256 states have call predecessors, (258), 258 states have call successors, (258) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:33:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:06,444 INFO L93 Difference]: Finished difference Result 2404 states and 3567 transitions. [2025-02-06 06:33:06,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 06:33:06,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-02-06 06:33:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:06,472 INFO L225 Difference]: With dead ends: 2404 [2025-02-06 06:33:06,472 INFO L226 Difference]: Without dead ends: 1155 [2025-02-06 06:33:06,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:33:06,486 INFO L435 NwaCegarLoop]: 1754 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:06,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1754 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-02-06 06:33:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2025-02-06 06:33:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 851 states have (on average 1.4077555816686251) internal successors, (1198), 886 states have internal predecessors, (1198), 249 states have call successors, (249), 54 states have call predecessors, (249), 54 states have return successors, (249), 247 states have call predecessors, (249), 249 states have call successors, (249) [2025-02-06 06:33:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1696 transitions. [2025-02-06 06:33:06,646 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1696 transitions. Word has length 161 [2025-02-06 06:33:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:06,646 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1696 transitions. [2025-02-06 06:33:06,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:33:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1696 transitions. [2025-02-06 06:33:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-06 06:33:06,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:06,653 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-02-06 06:33:06,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:33:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 06:33:06,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2069806454, now seen corresponding path program 1 times [2025-02-06 06:33:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:06,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750344957] [2025-02-06 06:33:06,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:07,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 06:33:07,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 06:33:07,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:07,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-02-06 06:33:07,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:07,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750344957] [2025-02-06 06:33:07,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750344957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:07,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:07,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343900832] [2025-02-06 06:33:07,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:07,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:07,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:07,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:07,803 INFO L87 Difference]: Start difference. First operand 1155 states and 1696 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 06:33:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:08,072 INFO L93 Difference]: Finished difference Result 2886 states and 4202 transitions. [2025-02-06 06:33:08,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:08,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 161 [2025-02-06 06:33:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:08,094 INFO L225 Difference]: With dead ends: 2886 [2025-02-06 06:33:08,094 INFO L226 Difference]: Without dead ends: 1766 [2025-02-06 06:33:08,100 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-02-06 06:33:08,102 INFO L435 NwaCegarLoop]: 1701 mSDtfsCounter, 901 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:08,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 3300 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:33:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-02-06 06:33:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2025-02-06 06:33:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1286 states have (on average 1.3888024883359253) internal successors, (1786), 1337 states have internal predecessors, (1786), 384 states have call successors, (384), 95 states have call predecessors, (384), 95 states have return successors, (384), 381 states have call predecessors, (384), 384 states have call successors, (384) [2025-02-06 06:33:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2554 transitions. [2025-02-06 06:33:08,230 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2554 transitions. Word has length 161 [2025-02-06 06:33:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:08,231 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2554 transitions. [2025-02-06 06:33:08,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 06:33:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2554 transitions. [2025-02-06 06:33:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-06 06:33:08,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:08,241 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:08,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:33:08,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:08,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1693372606, now seen corresponding path program 1 times [2025-02-06 06:33:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:08,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968912731] [2025-02-06 06:33:08,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:08,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 06:33:08,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 06:33:08,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:08,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 06:33:09,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:09,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968912731] [2025-02-06 06:33:09,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968912731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:09,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:09,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:09,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267186768] [2025-02-06 06:33:09,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:09,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:09,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:09,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:09,144 INFO L87 Difference]: Start difference. First operand 1766 states and 2554 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 06:33:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:09,279 INFO L93 Difference]: Finished difference Result 3486 states and 5048 transitions. [2025-02-06 06:33:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:09,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 240 [2025-02-06 06:33:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:09,295 INFO L225 Difference]: With dead ends: 3486 [2025-02-06 06:33:09,295 INFO L226 Difference]: Without dead ends: 1766 [2025-02-06 06:33:09,302 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-02-06 06:33:09,304 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 1656 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:09,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 1672 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-02-06 06:33:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2025-02-06 06:33:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1286 states have (on average 1.3872472783825816) internal successors, (1784), 1337 states have internal predecessors, (1784), 384 states have call successors, (384), 95 states have call predecessors, (384), 95 states have return successors, (384), 381 states have call predecessors, (384), 384 states have call successors, (384) [2025-02-06 06:33:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2552 transitions. [2025-02-06 06:33:09,400 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2552 transitions. Word has length 240 [2025-02-06 06:33:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:09,400 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2552 transitions. [2025-02-06 06:33:09,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 06:33:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2552 transitions. [2025-02-06 06:33:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-06 06:33:09,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:09,407 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:09,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:33:09,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash -951457891, now seen corresponding path program 1 times [2025-02-06 06:33:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:09,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029304095] [2025-02-06 06:33:09,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:09,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 06:33:09,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 06:33:09,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:09,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-02-06 06:33:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029304095] [2025-02-06 06:33:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029304095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:10,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:10,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:33:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904820574] [2025-02-06 06:33:10,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:10,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:10,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:10,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:10,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:10,463 INFO L87 Difference]: Start difference. First operand 1766 states and 2552 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 06:33:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:10,646 INFO L93 Difference]: Finished difference Result 1770 states and 2556 transitions. [2025-02-06 06:33:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:10,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 240 [2025-02-06 06:33:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:10,660 INFO L225 Difference]: With dead ends: 1770 [2025-02-06 06:33:10,661 INFO L226 Difference]: Without dead ends: 1768 [2025-02-06 06:33:10,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:10,664 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 0 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:10,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5027 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:33:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2025-02-06 06:33:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1768. [2025-02-06 06:33:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1288 states have (on average 1.3866459627329193) internal successors, (1786), 1339 states have internal predecessors, (1786), 384 states have call successors, (384), 95 states have call predecessors, (384), 95 states have return successors, (384), 381 states have call predecessors, (384), 384 states have call successors, (384) [2025-02-06 06:33:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2554 transitions. [2025-02-06 06:33:10,768 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2554 transitions. Word has length 240 [2025-02-06 06:33:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:10,769 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 2554 transitions. [2025-02-06 06:33:10,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 06:33:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2554 transitions. [2025-02-06 06:33:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-06 06:33:10,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:10,780 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:10,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:33:10,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -626602641, now seen corresponding path program 1 times [2025-02-06 06:33:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204283917] [2025-02-06 06:33:10,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:11,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-06 06:33:11,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-06 06:33:11,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:11,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-02-06 06:33:11,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:11,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204283917] [2025-02-06 06:33:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204283917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:11,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:33:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320251380] [2025-02-06 06:33:11,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:11,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:11,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:11,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:11,581 INFO L87 Difference]: Start difference. First operand 1768 states and 2554 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-06 06:33:15,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:17,063 INFO L93 Difference]: Finished difference Result 2900 states and 4218 transitions. [2025-02-06 06:33:17,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:17,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 250 [2025-02-06 06:33:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:17,079 INFO L225 Difference]: With dead ends: 2900 [2025-02-06 06:33:17,080 INFO L226 Difference]: Without dead ends: 1779 [2025-02-06 06:33:17,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:17,087 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 1633 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 2838 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:17,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 2838 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 550 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-02-06 06:33:17,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-02-06 06:33:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1769. [2025-02-06 06:33:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1289 states have (on average 1.386346004654771) internal successors, (1787), 1340 states have internal predecessors, (1787), 384 states have call successors, (384), 95 states have call predecessors, (384), 95 states have return successors, (384), 381 states have call predecessors, (384), 384 states have call successors, (384) [2025-02-06 06:33:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2555 transitions. [2025-02-06 06:33:17,209 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2555 transitions. Word has length 250 [2025-02-06 06:33:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2555 transitions. [2025-02-06 06:33:17,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-06 06:33:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2555 transitions. [2025-02-06 06:33:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-06 06:33:17,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:17,220 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:17,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:33:17,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:17,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash -186746804, now seen corresponding path program 1 times [2025-02-06 06:33:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:17,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600537220] [2025-02-06 06:33:17,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:17,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-06 06:33:17,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-06 06:33:17,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:17,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-02-06 06:33:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:18,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600537220] [2025-02-06 06:33:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600537220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:18,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:18,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:33:18,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787329850] [2025-02-06 06:33:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:18,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:33:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:18,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:33:18,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:18,250 INFO L87 Difference]: Start difference. First operand 1769 states and 2555 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 06:33:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:18,418 INFO L93 Difference]: Finished difference Result 1786 states and 2578 transitions. [2025-02-06 06:33:18,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:33:18,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 252 [2025-02-06 06:33:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:18,433 INFO L225 Difference]: With dead ends: 1786 [2025-02-06 06:33:18,434 INFO L226 Difference]: Without dead ends: 1784 [2025-02-06 06:33:18,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:18,436 INFO L435 NwaCegarLoop]: 1680 mSDtfsCounter, 120 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 6557 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:18,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 6557 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:33:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-02-06 06:33:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1771. [2025-02-06 06:33:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1290 states have (on average 1.386046511627907) internal successors, (1788), 1340 states have internal predecessors, (1788), 385 states have call successors, (385), 95 states have call predecessors, (385), 95 states have return successors, (385), 382 states have call predecessors, (385), 385 states have call successors, (385) [2025-02-06 06:33:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2558 transitions. [2025-02-06 06:33:18,515 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2558 transitions. Word has length 252 [2025-02-06 06:33:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:18,517 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2558 transitions. [2025-02-06 06:33:18,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 06:33:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2558 transitions. [2025-02-06 06:33:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-02-06 06:33:18,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:18,531 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:18,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:33:18,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:18,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:18,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1711947363, now seen corresponding path program 1 times [2025-02-06 06:33:18,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:18,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137085308] [2025-02-06 06:33:18,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:18,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-02-06 06:33:18,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-02-06 06:33:18,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:18,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-02-06 06:33:19,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:19,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137085308] [2025-02-06 06:33:19,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137085308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:19,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:19,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419799933] [2025-02-06 06:33:19,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:19,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:19,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:19,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:19,210 INFO L87 Difference]: Start difference. First operand 1771 states and 2558 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-02-06 06:33:23,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:23,506 INFO L93 Difference]: Finished difference Result 4576 states and 6639 transitions. [2025-02-06 06:33:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:23,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 284 [2025-02-06 06:33:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:23,529 INFO L225 Difference]: With dead ends: 4576 [2025-02-06 06:33:23,530 INFO L226 Difference]: Without dead ends: 3452 [2025-02-06 06:33:23,536 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-02-06 06:33:23,537 INFO L435 NwaCegarLoop]: 2486 mSDtfsCounter, 1602 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 4110 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:23,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 4110 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:33:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2025-02-06 06:33:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3446. [2025-02-06 06:33:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 2516 states have (on average 1.390302066772655) internal successors, (3498), 2616 states have internal predecessors, (3498), 742 states have call successors, (742), 187 states have call predecessors, (742), 187 states have return successors, (742), 734 states have call predecessors, (742), 742 states have call successors, (742) [2025-02-06 06:33:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4982 transitions. [2025-02-06 06:33:23,780 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4982 transitions. Word has length 284 [2025-02-06 06:33:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:23,781 INFO L471 AbstractCegarLoop]: Abstraction has 3446 states and 4982 transitions. [2025-02-06 06:33:23,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-02-06 06:33:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4982 transitions. [2025-02-06 06:33:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 06:33:23,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:23,802 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:23,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:33:23,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:23,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 766421839, now seen corresponding path program 1 times [2025-02-06 06:33:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180961783] [2025-02-06 06:33:23,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:24,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 06:33:24,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 06:33:24,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:24,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-02-06 06:33:24,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180961783] [2025-02-06 06:33:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180961783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:24,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:24,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:33:24,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081577722] [2025-02-06 06:33:24,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:24,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:24,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:24,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:24,550 INFO L87 Difference]: Start difference. First operand 3446 states and 4982 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 06:33:28,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:28,808 INFO L93 Difference]: Finished difference Result 5765 states and 8312 transitions. [2025-02-06 06:33:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:28,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 286 [2025-02-06 06:33:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:28,828 INFO L225 Difference]: With dead ends: 5765 [2025-02-06 06:33:28,828 INFO L226 Difference]: Without dead ends: 2354 [2025-02-06 06:33:28,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:28,841 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 0 mSDsluCounter, 3349 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5028 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:28,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5028 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:33:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2025-02-06 06:33:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2025-02-06 06:33:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 1706 states have (on average 1.3774912075029309) internal successors, (2350), 1772 states have internal predecessors, (2350), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-06 06:33:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 3376 transitions. [2025-02-06 06:33:28,994 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 3376 transitions. Word has length 286 [2025-02-06 06:33:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:28,998 INFO L471 AbstractCegarLoop]: Abstraction has 2354 states and 3376 transitions. [2025-02-06 06:33:28,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 06:33:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3376 transitions. [2025-02-06 06:33:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-06 06:33:29,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:29,020 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:29,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:33:29,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:29,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:29,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1725769435, now seen corresponding path program 1 times [2025-02-06 06:33:29,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:29,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284741442] [2025-02-06 06:33:29,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:29,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:29,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-06 06:33:29,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-06 06:33:29,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:29,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-02-06 06:33:29,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:29,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284741442] [2025-02-06 06:33:29,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284741442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:29,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:29,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:33:29,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560386354] [2025-02-06 06:33:29,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:29,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:29,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:29,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:29,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:29,874 INFO L87 Difference]: Start difference. First operand 2354 states and 3376 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-02-06 06:33:33,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:35,373 INFO L93 Difference]: Finished difference Result 3503 states and 5063 transitions. [2025-02-06 06:33:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 286 [2025-02-06 06:33:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:35,392 INFO L225 Difference]: With dead ends: 3503 [2025-02-06 06:33:35,393 INFO L226 Difference]: Without dead ends: 2381 [2025-02-06 06:33:35,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:35,400 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 1630 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:35,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 2832 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 563 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-02-06 06:33:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2025-02-06 06:33:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2358. [2025-02-06 06:33:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1710 states have (on average 1.3771929824561404) internal successors, (2355), 1776 states have internal predecessors, (2355), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-06 06:33:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3381 transitions. [2025-02-06 06:33:35,563 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3381 transitions. Word has length 286 [2025-02-06 06:33:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:35,564 INFO L471 AbstractCegarLoop]: Abstraction has 2358 states and 3381 transitions. [2025-02-06 06:33:35,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-02-06 06:33:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3381 transitions. [2025-02-06 06:33:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-02-06 06:33:35,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:35,579 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:35,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:33:35,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:35,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash -62184577, now seen corresponding path program 1 times [2025-02-06 06:33:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956120910] [2025-02-06 06:33:35,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:36,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-06 06:33:36,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-06 06:33:36,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:36,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-02-06 06:33:36,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:36,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956120910] [2025-02-06 06:33:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956120910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:36,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:36,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:36,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949072180] [2025-02-06 06:33:36,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:36,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:36,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:36,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:36,304 INFO L87 Difference]: Start difference. First operand 2358 states and 3381 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 06:33:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:36,450 INFO L93 Difference]: Finished difference Result 4670 states and 6734 transitions. [2025-02-06 06:33:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 289 [2025-02-06 06:33:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:36,471 INFO L225 Difference]: With dead ends: 4670 [2025-02-06 06:33:36,471 INFO L226 Difference]: Without dead ends: 2358 [2025-02-06 06:33:36,481 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-02-06 06:33:36,482 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 0 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:36,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3332 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2025-02-06 06:33:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2358. [2025-02-06 06:33:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1710 states have (on average 1.3719298245614036) internal successors, (2346), 1776 states have internal predecessors, (2346), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-06 06:33:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3372 transitions. [2025-02-06 06:33:36,608 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3372 transitions. Word has length 289 [2025-02-06 06:33:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:36,609 INFO L471 AbstractCegarLoop]: Abstraction has 2358 states and 3372 transitions. [2025-02-06 06:33:36,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 06:33:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3372 transitions. [2025-02-06 06:33:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-02-06 06:33:36,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:36,623 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:33:36,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:33:36,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1537511566, now seen corresponding path program 1 times [2025-02-06 06:33:36,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:36,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009291356] [2025-02-06 06:33:36,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:36,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-06 06:33:37,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-06 06:33:37,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:37,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-02-06 06:33:37,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:37,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009291356] [2025-02-06 06:33:37,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009291356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:37,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650584397] [2025-02-06 06:33:37,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:37,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:37,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:37,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:37,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:33:38,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-06 06:33:38,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-06 06:33:38,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:38,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:38,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 2115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 06:33:38,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-02-06 06:33:39,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:33:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-02-06 06:33:39,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650584397] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:33:39,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:33:39,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-02-06 06:33:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444962019] [2025-02-06 06:33:39,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:33:39,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 06:33:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:39,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 06:33:39,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-06 06:33:39,608 INFO L87 Difference]: Start difference. First operand 2358 states and 3372 transitions. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 4 states have call successors, (77), 3 states have call predecessors, (77), 3 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-02-06 06:33:43,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:47,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:51,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:55,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:59,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:34:03,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:34:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:34:05,405 INFO L93 Difference]: Finished difference Result 3564 states and 5141 transitions. [2025-02-06 06:34:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 06:34:05,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 4 states have call successors, (77), 3 states have call predecessors, (77), 3 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) Word has length 292 [2025-02-06 06:34:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:34:05,425 INFO L225 Difference]: With dead ends: 3564 [2025-02-06 06:34:05,425 INFO L226 Difference]: Without dead ends: 2438 [2025-02-06 06:34:05,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-06 06:34:05,432 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 1772 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 56 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:34:05,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 2889 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 614 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time] [2025-02-06 06:34:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2025-02-06 06:34:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2365. [2025-02-06 06:34:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 1717 states have (on average 1.3715783343040187) internal successors, (2355), 1783 states have internal predecessors, (2355), 513 states have call successors, (513), 134 states have call predecessors, (513), 134 states have return successors, (513), 508 states have call predecessors, (513), 513 states have call successors, (513) [2025-02-06 06:34:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3381 transitions. [2025-02-06 06:34:05,542 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3381 transitions. Word has length 292 [2025-02-06 06:34:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:34:05,543 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 3381 transitions. [2025-02-06 06:34:05,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 4 states have call successors, (77), 3 states have call predecessors, (77), 3 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-02-06 06:34:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3381 transitions. [2025-02-06 06:34:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-06 06:34:05,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:34:05,558 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 06:34:05,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 06:34:05,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:34:05,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:34:05,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:34:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1432494719, now seen corresponding path program 1 times [2025-02-06 06:34:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:34:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507200804] [2025-02-06 06:34:05,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:34:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:34:06,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-06 06:34:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-06 06:34:06,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:34:06,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat