./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e2f48ab037d80d8f09964fc14a08b090a2ac957ba1c26211e43b888a860dc78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:08:42,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:08:42,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:08:42,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:08:42,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:08:42,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:08:42,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:08:42,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:08:42,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:08:42,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:08:42,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:08:42,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:08:42,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:08:42,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:08:42,740 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:08:42,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:08:42,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:08:42,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:08:42,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:08:42,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:08:42,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:08:42,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:08:42,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:08:42,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:08:42,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:08:42,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:08:42,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:08:42,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:08:42,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:08:42,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:08:42,743 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e2f48ab037d80d8f09964fc14a08b090a2ac957ba1c26211e43b888a860dc78 [2025-03-04 04:08:42,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:08:42,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:08:42,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:08:42,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:08:42,993 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:08:42,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-04 04:08:44,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee7f8d57/06b64498a7814c20a104de1c47a7ce72/FLAG5766a6ba5 [2025-03-04 04:08:44,563 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:08:44,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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-03-04 04:08:44,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee7f8d57/06b64498a7814c20a104de1c47a7ce72/FLAG5766a6ba5 [2025-03-04 04:08:44,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bee7f8d57/06b64498a7814c20a104de1c47a7ce72 [2025-03-04 04:08:44,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:08:44,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:08:44,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:08:44,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:08:44,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:08:44,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:08:44" (1/1) ... [2025-03-04 04:08:44,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c604e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:44, skipping insertion in model container [2025-03-04 04:08:44,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:08:44" (1/1) ... [2025-03-04 04:08:44,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:08:45,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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-03-04 04:08:45,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:08:45,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:08:45,678 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-03-04 04:08:45,681 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-03-04 04:08:45,681 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-03-04 04:08:45,681 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-03-04 04:08:45,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4843] [2025-03-04 04:08:45,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4846] [2025-03-04 04:08:45,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4849] [2025-03-04 04:08:45,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4852] [2025-03-04 04:08:45,699 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5234] [2025-03-04 04:08:45,702 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-03-04 04:08:45,702 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-03-04 04:08:45,702 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-03-04 04:08:45,703 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-03-04 04:08:45,703 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-03-04 04:08:45,703 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-03-04 04:08:45,703 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-03-04 04:08:45,703 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-03-04 04:08:45,704 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-03-04 04:08:45,704 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-03-04 04:08:45,704 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-03-04 04:08:45,705 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-03-04 04:08:45,706 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-03-04 04:08:45,706 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-03-04 04:08:45,706 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-03-04 04:08:45,707 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5365] [2025-03-04 04:08:45,707 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-03-04 04:08:45,707 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-03-04 04:08:45,708 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-03-04 04:08:45,708 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-03-04 04:08:45,708 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-03-04 04:08:45,708 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-03-04 04:08:45,708 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-03-04 04:08:45,710 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-03-04 04:08:45,711 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-03-04 04:08:45,711 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-03-04 04:08:45,711 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-03-04 04:08:45,711 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-03-04 04:08:45,711 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-03-04 04:08:45,712 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-03-04 04:08:45,712 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-03-04 04:08:45,716 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5520] [2025-03-04 04:08:45,716 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-03-04 04:08:45,716 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-03-04 04:08:45,717 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-03-04 04:08:45,717 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-03-04 04:08:45,717 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-03-04 04:08:45,717 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-03-04 04:08:45,718 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-03-04 04:08:45,718 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-03-04 04:08:45,718 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-03-04 04:08:45,719 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-03-04 04:08:45,719 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-03-04 04:08:45,771 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-03-04 04:08:45,772 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-03-04 04:08:45,772 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-03-04 04:08:45,772 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-03-04 04:08:45,772 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-03-04 04:08:45,773 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-03-04 04:08:45,773 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-03-04 04:08:45,773 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-03-04 04:08:45,773 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-03-04 04:08:45,774 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-03-04 04:08:45,775 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-03-04 04:08:45,776 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-03-04 04:08:45,776 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-03-04 04:08:45,777 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-03-04 04:08:45,777 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-03-04 04:08:45,778 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-03-04 04:08:45,779 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-03-04 04:08:45,779 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-03-04 04:08:45,779 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-03-04 04:08:45,779 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-03-04 04:08:45,780 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-03-04 04:08:45,780 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-03-04 04:08:45,780 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-03-04 04:08:45,780 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-03-04 04:08:45,780 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-03-04 04:08:45,781 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-03-04 04:08:45,781 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-03-04 04:08:45,782 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-03-04 04:08:45,782 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-03-04 04:08:45,782 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-03-04 04:08:45,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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-03-04 04:08:45,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:08:45,912 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:08:45,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45 WrapperNode [2025-03-04 04:08:45,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:08:45,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:08:45,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:08:45,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:08:45,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:45,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,059 INFO L138 Inliner]: procedures = 186, calls = 884, calls flagged for inlining = 94, calls inlined = 92, statements flattened = 3448 [2025-03-04 04:08:46,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:08:46,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:08:46,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:08:46,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:08:46,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,333 INFO L175 MemorySlicer]: Split 434 memory accesses to 10 slices as follows [2, 2, 16, 3, 4, 36, 1, 347, 22, 1]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 5, 0, 0]. The 182 writes are split as follows [0, 0, 2, 0, 1, 36, 1, 120, 22, 0]. [2025-03-04 04:08:46,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:08:46,463 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:08:46,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:08:46,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:08:46,464 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (1/1) ... [2025-03-04 04:08:46,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:08:46,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:08:46,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:08:46,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:08:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2025-03-04 04:08:46,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2025-03-04 04:08:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2025-03-04 04:08:46,510 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2025-03-04 04:08:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:08:46,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:08:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:08:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:08:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:08:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:08:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:08:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:08:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:08:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:08:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-03-04 04:08:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-03-04 04:08:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2025-03-04 04:08:46,512 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2025-03-04 04:08:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:08:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:08:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:08:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:08:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:08:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:08:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:08:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:08:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:08:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-04 04:08:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-04 04:08:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-03-04 04:08:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-03-04 04:08:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-03-04 04:08:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-03-04 04:08:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:08:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:08:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:08:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:08:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:08:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:08:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:08:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:08:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:08:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-04 04:08:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-03-04 04:08:46,517 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2025-03-04 04:08:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:08:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-03-04 04:08:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-03-04 04:08:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-04 04:08:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-03-04 04:08:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2025-03-04 04:08:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2025-03-04 04:08:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2025-03-04 04:08:46,518 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-03-04 04:08:46,521 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2025-03-04 04:08:46,521 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:08:46,521 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:08:46,522 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-04 04:08:46,522 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-03-04 04:08:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-03-04 04:08:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:08:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-03-04 04:08:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-03-04 04:08:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-04 04:08:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-04 04:08:46,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:08:46,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:08:47,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7786: havoc tty_chars_in_buffer_#t~nondet613#1; [2025-03-04 04:08:47,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7717: havoc dev_trans_start_#t~nondet599#1; [2025-03-04 04:08:47,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:08:47,093 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7706: havoc #t~nondet596; [2025-03-04 04:08:47,147 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4722: havoc #t~mem1;havoc #t~bitwise2; [2025-03-04 04:08:47,319 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7702: havoc #t~nondet595; [2025-03-04 04:08:47,593 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7782: havoc slhc_uncompress_#t~nondet612#1; [2025-03-04 04:08:47,593 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7778: havoc slhc_remember_#t~nondet611#1; [2025-03-04 04:08:47,593 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7741: havoc netif_rx_#t~nondet602#1; [2025-03-04 04:08:47,593 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7709: havoc dev_alloc_skb_#t~ret597#1.base, dev_alloc_skb_#t~ret597#1.offset; [2025-03-04 04:08:47,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7673: havoc _copy_to_user_#t~nondet592#1; [2025-03-04 04:08:47,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7797: havoc tty_mode_ioctl_#t~nondet615#1; [2025-03-04 04:08:49,157 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7733: havoc #t~nondet600; [2025-03-04 04:08:49,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7790: havoc #t~nondet614; [2025-03-04 04:08:49,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7749: havoc #t~nondet604; [2025-03-04 04:08:49,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4927: havoc __kmalloc_#t~ret40#1.base, __kmalloc_#t~ret40#1.offset; [2025-03-04 04:08:49,417 INFO L1325 $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-03-04 04:08:49,421 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5008: havoc #t~mem65.base, #t~mem65.offset; [2025-03-04 04:08:54,168 INFO L1325 $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-03-04 04:08:54,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7768: havoc slhc_compress_#t~nondet609#1; [2025-03-04 04:08:54,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7801: havoc tty_register_ldisc_#t~nondet616#1; [2025-03-04 04:08:54,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7737: havoc msleep_interruptible_#t~nondet601#1; [2025-03-04 04:08:54,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7805: havoc tty_unregister_ldisc_#t~nondet617#1; [2025-03-04 04:08:54,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7774: havoc slhc_init_#t~ret610#1.base, slhc_init_#t~ret610#1.offset; [2025-03-04 04:08:54,169 INFO L1325 $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-03-04 04:08:54,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7713: havoc dev_close_#t~nondet598#1; [2025-03-04 04:08:54,169 INFO L1325 $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-03-04 04:08:54,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7753: havoc register_netdevice_#t~nondet605#1; [2025-03-04 04:08:54,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7491-1: ldv_register_netdevice_4_#res#1 := ldv_register_netdevice_4_~ldv_func_res~3#1; [2025-03-04 04:08:54,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7691: havoc alloc_netdev_mqs_#t~ret593#1.base, alloc_netdev_mqs_#t~ret593#1.offset; [2025-03-04 04:08:54,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc capable_#t~nondet594#1; [2025-03-04 04:08:54,170 INFO L1325 $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-03-04 04:08:54,170 INFO L1325 $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-03-04 04:08:54,183 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7745: havoc netpoll_trap_#t~nondet603#1; [2025-03-04 04:08:54,517 INFO L? ?]: Removed 1548 outVars from TransFormulas that were not future-live. [2025-03-04 04:08:54,518 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:08:54,552 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:08:54,553 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 04:08:54,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:08:54 BoogieIcfgContainer [2025-03-04 04:08:54,553 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:08:54,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:08:54,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:08:54,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:08:54,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:08:44" (1/3) ... [2025-03-04 04:08:54,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fbeee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:08:54, skipping insertion in model container [2025-03-04 04:08:54,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:08:45" (2/3) ... [2025-03-04 04:08:54,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fbeee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:08:54, skipping insertion in model container [2025-03-04 04:08:54,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:08:54" (3/3) ... [2025-03-04 04:08:54,561 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-03-04 04:08:54,571 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:08:54,576 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-03-04 04:08:54,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:08:54,650 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;@415d1823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:08:54,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:08:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 1201 states, 882 states have (on average 1.4195011337868482) internal successors, (1252), 925 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-03-04 04:08:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 04:08:54,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:54,675 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-03-04 04:08:54,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:54,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 731721563, now seen corresponding path program 1 times [2025-03-04 04:08:54,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:54,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385073862] [2025-03-04 04:08:54,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 04:08:55,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 04:08:55,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:55,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-04 04:08:55,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385073862] [2025-03-04 04:08:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385073862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:08:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277489881] [2025-03-04 04:08:55,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:08:55,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:08:55,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:08:55,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:08:56,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 04:08:56,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 04:08:56,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:56,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:08:56,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:08:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2025-03-04 04:08:56,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:08:56,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277489881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:56,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:08:56,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:08:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238418756] [2025-03-04 04:08:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:56,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:08:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:56,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:08:56,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:08:56,365 INFO L87 Difference]: Start difference. First operand has 1201 states, 882 states have (on average 1.4195011337868482) internal successors, (1252), 925 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-03-04 04:08:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:56,529 INFO L93 Difference]: Finished difference Result 2398 states and 3567 transitions. [2025-03-04 04:08:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:08:56,531 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-03-04 04:08:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:56,553 INFO L225 Difference]: With dead ends: 2398 [2025-03-04 04:08:56,553 INFO L226 Difference]: Without dead ends: 1155 [2025-03-04 04:08:56,564 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-03-04 04:08:56,566 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-03-04 04:08:56,566 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-03-04 04:08:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-03-04 04:08:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2025-03-04 04:08:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 851 states have (on average 1.4112808460634547) internal successors, (1201), 886 states have internal predecessors, (1201), 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-03-04 04:08:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1699 transitions. [2025-03-04 04:08:56,674 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1699 transitions. Word has length 161 [2025-03-04 04:08:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:56,676 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1699 transitions. [2025-03-04 04:08:56,676 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-03-04 04:08:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1699 transitions. [2025-03-04 04:08:56,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 04:08:56,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:56,681 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-03-04 04:08:56,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:08:56,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 04:08:56,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:56,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2069806454, now seen corresponding path program 1 times [2025-03-04 04:08:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:56,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688029781] [2025-03-04 04:08:56,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:57,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 04:08:57,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 04:08:57,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:57,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-04 04:08:57,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:57,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688029781] [2025-03-04 04:08:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688029781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:57,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:08:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855062488] [2025-03-04 04:08:57,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:57,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:08:57,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:57,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:08:57,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:08:57,372 INFO L87 Difference]: Start difference. First operand 1155 states and 1699 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-03-04 04:08:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:57,557 INFO L93 Difference]: Finished difference Result 2886 states and 4211 transitions. [2025-03-04 04:08:57,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:08:57,558 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-03-04 04:08:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:57,570 INFO L225 Difference]: With dead ends: 2886 [2025-03-04 04:08:57,570 INFO L226 Difference]: Without dead ends: 1767 [2025-03-04 04:08:57,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:08:57,575 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 904 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:08:57,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 3304 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:08:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2025-03-04 04:08:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2025-03-04 04:08:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1287 states have (on average 1.393162393162393) internal successors, (1793), 1338 states have internal predecessors, (1793), 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-03-04 04:08:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2561 transitions. [2025-03-04 04:08:57,652 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2561 transitions. Word has length 161 [2025-03-04 04:08:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:57,653 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2561 transitions. [2025-03-04 04:08:57,653 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-03-04 04:08:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2561 transitions. [2025-03-04 04:08:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-04 04:08:57,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:57,661 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-03-04 04:08:57,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:08:57,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:57,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1693372606, now seen corresponding path program 1 times [2025-03-04 04:08:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:57,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354139628] [2025-03-04 04:08:57,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:57,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 04:08:57,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 04:08:57,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:57,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 04:08:58,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:58,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354139628] [2025-03-04 04:08:58,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354139628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:58,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:58,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:08:58,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477320105] [2025-03-04 04:08:58,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:58,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:08:58,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:58,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:08:58,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:08:58,172 INFO L87 Difference]: Start difference. First operand 1767 states and 2561 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-03-04 04:08:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:58,292 INFO L93 Difference]: Finished difference Result 3488 states and 5062 transitions. [2025-03-04 04:08:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:08:58,293 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-03-04 04:08:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:58,303 INFO L225 Difference]: With dead ends: 3488 [2025-03-04 04:08:58,303 INFO L226 Difference]: Without dead ends: 1767 [2025-03-04 04:08:58,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:08:58,309 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1659 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 1675 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-03-04 04:08:58,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 1675 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:08:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2025-03-04 04:08:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2025-03-04 04:08:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1287 states have (on average 1.3916083916083917) internal successors, (1791), 1338 states have internal predecessors, (1791), 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-03-04 04:08:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2559 transitions. [2025-03-04 04:08:58,369 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2559 transitions. Word has length 240 [2025-03-04 04:08:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:58,370 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 2559 transitions. [2025-03-04 04:08:58,370 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-03-04 04:08:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2559 transitions. [2025-03-04 04:08:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-04 04:08:58,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:58,374 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-03-04 04:08:58,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:08:58,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:58,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash -951457891, now seen corresponding path program 1 times [2025-03-04 04:08:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:58,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720770873] [2025-03-04 04:08:58,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:58,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:58,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-04 04:08:58,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-04 04:08:58,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:58,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-04 04:08:59,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720770873] [2025-03-04 04:08:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720770873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:59,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:59,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:08:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312050061] [2025-03-04 04:08:59,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:59,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:08:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:59,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:08:59,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:08:59,117 INFO L87 Difference]: Start difference. First operand 1767 states and 2559 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-03-04 04:08:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:08:59,228 INFO L93 Difference]: Finished difference Result 1771 states and 2563 transitions. [2025-03-04 04:08:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:08:59,229 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-03-04 04:08:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:08:59,239 INFO L225 Difference]: With dead ends: 1771 [2025-03-04 04:08:59,239 INFO L226 Difference]: Without dead ends: 1769 [2025-03-04 04:08:59,240 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-03-04 04:08:59,241 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 0 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5036 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-03-04 04:08:59,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5036 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:08:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2025-03-04 04:08:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2025-03-04 04:08:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1289 states have (on average 1.39100077579519) internal successors, (1793), 1340 states have internal predecessors, (1793), 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-03-04 04:08:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2561 transitions. [2025-03-04 04:08:59,299 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2561 transitions. Word has length 240 [2025-03-04 04:08:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:08:59,300 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2561 transitions. [2025-03-04 04:08:59,300 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-03-04 04:08:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2561 transitions. [2025-03-04 04:08:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 04:08:59,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:08:59,307 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-03-04 04:08:59,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:08:59,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:08:59,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:08:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -626602641, now seen corresponding path program 1 times [2025-03-04 04:08:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:08:59,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652718495] [2025-03-04 04:08:59,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:08:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:08:59,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 04:08:59,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 04:08:59,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:08:59,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:08:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-04 04:08:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:08:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652718495] [2025-03-04 04:08:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652718495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:08:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:08:59,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:08:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547759363] [2025-03-04 04:08:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:08:59,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:08:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:08:59,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:08:59,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:08:59,858 INFO L87 Difference]: Start difference. First operand 1769 states and 2561 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-03-04 04:09:03,868 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-03-04 04:09:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:04,743 INFO L93 Difference]: Finished difference Result 3503 states and 5079 transitions. [2025-03-04 04:09:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:04,744 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-03-04 04:09:04,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:04,753 INFO L225 Difference]: With dead ends: 3503 [2025-03-04 04:09:04,753 INFO L226 Difference]: Without dead ends: 1780 [2025-03-04 04:09:04,757 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-03-04 04:09:04,758 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 1649 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:04,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 2844 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 550 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-04 04:09:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-03-04 04:09:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1770. [2025-03-04 04:09:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1290 states have (on average 1.3906976744186046) internal successors, (1794), 1341 states have internal predecessors, (1794), 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-03-04 04:09:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2562 transitions. [2025-03-04 04:09:04,805 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2562 transitions. Word has length 250 [2025-03-04 04:09:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:04,805 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2562 transitions. [2025-03-04 04:09:04,805 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-03-04 04:09:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2562 transitions. [2025-03-04 04:09:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 04:09:04,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:04,810 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-03-04 04:09:04,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:09:04,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:04,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -186746804, now seen corresponding path program 1 times [2025-03-04 04:09:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:04,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506144184] [2025-03-04 04:09:04,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:04,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 04:09:05,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 04:09:05,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:05,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-04 04:09:05,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:05,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506144184] [2025-03-04 04:09:05,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506144184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:05,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:05,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:09:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062901514] [2025-03-04 04:09:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:05,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:09:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:05,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:09:05,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:09:05,468 INFO L87 Difference]: Start difference. First operand 1770 states and 2562 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-03-04 04:09:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:05,590 INFO L93 Difference]: Finished difference Result 1787 states and 2585 transitions. [2025-03-04 04:09:05,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:09:05,591 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-03-04 04:09:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:05,602 INFO L225 Difference]: With dead ends: 1787 [2025-03-04 04:09:05,602 INFO L226 Difference]: Without dead ends: 1785 [2025-03-04 04:09:05,603 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-03-04 04:09:05,604 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 120 mSDsluCounter, 4886 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 6569 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-03-04 04:09:05,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 6569 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2025-03-04 04:09:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1772. [2025-03-04 04:09:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1291 states have (on average 1.3903950426026337) internal successors, (1795), 1341 states have internal predecessors, (1795), 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-03-04 04:09:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2565 transitions. [2025-03-04 04:09:05,668 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2565 transitions. Word has length 252 [2025-03-04 04:09:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:05,671 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2565 transitions. [2025-03-04 04:09:05,671 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-03-04 04:09:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2565 transitions. [2025-03-04 04:09:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-04 04:09:05,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:05,679 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-03-04 04:09:05,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:09:05,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:05,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1711947363, now seen corresponding path program 1 times [2025-03-04 04:09:05,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:05,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912570754] [2025-03-04 04:09:05,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:05,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-04 04:09:05,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-04 04:09:05,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:05,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-04 04:09:06,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:06,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912570754] [2025-03-04 04:09:06,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912570754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:06,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:06,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:06,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157393375] [2025-03-04 04:09:06,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:06,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:06,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:06,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:06,147 INFO L87 Difference]: Start difference. First operand 1772 states and 2565 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-03-04 04:09:10,156 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-03-04 04:09:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:10,340 INFO L93 Difference]: Finished difference Result 5180 states and 7507 transitions. [2025-03-04 04:09:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:10,341 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-03-04 04:09:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:10,359 INFO L225 Difference]: With dead ends: 5180 [2025-03-04 04:09:10,359 INFO L226 Difference]: Without dead ends: 3454 [2025-03-04 04:09:10,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:10,367 INFO L435 NwaCegarLoop]: 2493 mSDtfsCounter, 1605 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 4120 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-03-04 04:09:10,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 4120 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:09:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2025-03-04 04:09:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3448. [2025-03-04 04:09:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3448 states, 2518 states have (on average 1.3947577442414614) internal successors, (3512), 2618 states have internal predecessors, (3512), 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-03-04 04:09:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 4996 transitions. [2025-03-04 04:09:10,506 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 4996 transitions. Word has length 284 [2025-03-04 04:09:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:10,507 INFO L471 AbstractCegarLoop]: Abstraction has 3448 states and 4996 transitions. [2025-03-04 04:09:10,507 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-03-04 04:09:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 4996 transitions. [2025-03-04 04:09:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 04:09:10,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:10,521 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-03-04 04:09:10,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:09:10,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash 766421839, now seen corresponding path program 1 times [2025-03-04 04:09:10,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650251247] [2025-03-04 04:09:10,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 04:09:10,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 04:09:10,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:10,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-04 04:09:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650251247] [2025-03-04 04:09:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650251247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:11,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:11,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:09:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831416583] [2025-03-04 04:09:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:11,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:11,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:11,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:09:11,121 INFO L87 Difference]: Start difference. First operand 3448 states and 4996 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-03-04 04:09:15,130 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-03-04 04:09:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:15,336 INFO L93 Difference]: Finished difference Result 5769 states and 8337 transitions. [2025-03-04 04:09:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:15,336 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-03-04 04:09:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:15,353 INFO L225 Difference]: With dead ends: 5769 [2025-03-04 04:09:15,353 INFO L226 Difference]: Without dead ends: 2356 [2025-03-04 04:09:15,365 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-03-04 04:09:15,365 INFO L435 NwaCegarLoop]: 1682 mSDtfsCounter, 0 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5037 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-03-04 04:09:15,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5037 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:09:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2025-03-04 04:09:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2356. [2025-03-04 04:09:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1708 states have (on average 1.3823185011709602) internal successors, (2361), 1774 states have internal predecessors, (2361), 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-03-04 04:09:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3387 transitions. [2025-03-04 04:09:15,494 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3387 transitions. Word has length 286 [2025-03-04 04:09:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:15,494 INFO L471 AbstractCegarLoop]: Abstraction has 2356 states and 3387 transitions. [2025-03-04 04:09:15,494 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-03-04 04:09:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3387 transitions. [2025-03-04 04:09:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 04:09:15,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:15,507 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-03-04 04:09:15,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:09:15,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:15,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1725769435, now seen corresponding path program 1 times [2025-03-04 04:09:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228082035] [2025-03-04 04:09:15,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:15,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 04:09:15,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 04:09:15,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-03-04 04:09:16,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:16,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228082035] [2025-03-04 04:09:16,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228082035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:16,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:16,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:09:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425116039] [2025-03-04 04:09:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:16,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:16,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:16,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:16,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:09:16,105 INFO L87 Difference]: Start difference. First operand 2356 states and 3387 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-03-04 04:09:20,114 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-03-04 04:09:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:21,416 INFO L93 Difference]: Finished difference Result 4105 states and 5924 transitions. [2025-03-04 04:09:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:21,416 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-03-04 04:09:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:21,430 INFO L225 Difference]: With dead ends: 4105 [2025-03-04 04:09:21,430 INFO L226 Difference]: Without dead ends: 2383 [2025-03-04 04:09:21,436 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-03-04 04:09:21,437 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 1634 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:21,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 2828 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 562 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-04 04:09:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-04 04:09:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2360. [2025-03-04 04:09:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 1712 states have (on average 1.3820093457943925) internal successors, (2366), 1778 states have internal predecessors, (2366), 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-03-04 04:09:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3392 transitions. [2025-03-04 04:09:21,528 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3392 transitions. Word has length 286 [2025-03-04 04:09:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:21,530 INFO L471 AbstractCegarLoop]: Abstraction has 2360 states and 3392 transitions. [2025-03-04 04:09:21,530 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-03-04 04:09:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3392 transitions. [2025-03-04 04:09:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-04 04:09:21,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:21,539 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-03-04 04:09:21,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:09:21,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:21,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash -62184577, now seen corresponding path program 1 times [2025-03-04 04:09:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:21,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854359445] [2025-03-04 04:09:21,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:21,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-04 04:09:21,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-04 04:09:21,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:21,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-03-04 04:09:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:21,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854359445] [2025-03-04 04:09:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854359445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:21,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927840493] [2025-03-04 04:09:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:21,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:21,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:21,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:21,949 INFO L87 Difference]: Start difference. First operand 2360 states and 3392 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-03-04 04:09:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:22,097 INFO L93 Difference]: Finished difference Result 4674 states and 6756 transitions. [2025-03-04 04:09:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:22,098 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-03-04 04:09:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:22,113 INFO L225 Difference]: With dead ends: 4674 [2025-03-04 04:09:22,113 INFO L226 Difference]: Without dead ends: 2360 [2025-03-04 04:09:22,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:22,123 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 0 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3338 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:22,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3338 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2025-03-04 04:09:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2360. [2025-03-04 04:09:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 1712 states have (on average 1.376752336448598) internal successors, (2357), 1778 states have internal predecessors, (2357), 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-03-04 04:09:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3383 transitions. [2025-03-04 04:09:22,243 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3383 transitions. Word has length 289 [2025-03-04 04:09:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:22,244 INFO L471 AbstractCegarLoop]: Abstraction has 2360 states and 3383 transitions. [2025-03-04 04:09:22,245 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-03-04 04:09:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3383 transitions. [2025-03-04 04:09:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-04 04:09:22,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:22,258 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-03-04 04:09:22,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:09:22,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:22,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1537511566, now seen corresponding path program 1 times [2025-03-04 04:09:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:22,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538619478] [2025-03-04 04:09:22,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:22,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 04:09:22,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 04:09:22,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:22,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-03-04 04:09:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538619478] [2025-03-04 04:09:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538619478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140701126] [2025-03-04 04:09:22,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:22,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:09:22,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:09:23,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 04:09:24,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 04:09:24,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:24,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:24,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 2115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 04:09:24,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-04 04:09:24,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:09:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2025-03-04 04:09:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140701126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:09:24,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:09:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-03-04 04:09:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051589207] [2025-03-04 04:09:24,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:09:24,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 04:09:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:24,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 04:09:24,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:24,859 INFO L87 Difference]: Start difference. First operand 2360 states and 3383 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-03-04 04:09:28,869 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-03-04 04:09:32,885 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-03-04 04:09:36,895 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-03-04 04:09:40,906 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-03-04 04:09:44,912 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-03-04 04:09:48,923 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-03-04 04:09:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:50,516 INFO L93 Difference]: Finished difference Result 4166 states and 5999 transitions. [2025-03-04 04:09:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:09:50,517 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-03-04 04:09:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:50,529 INFO L225 Difference]: With dead ends: 4166 [2025-03-04 04:09:50,529 INFO L226 Difference]: Without dead ends: 2440 [2025-03-04 04:09:50,534 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-03-04 04:09:50,534 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1687 mSDsluCounter, 3524 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 38 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 5197 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:50,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 5197 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1672 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time] [2025-03-04 04:09:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2025-03-04 04:09:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2367. [2025-03-04 04:09:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 1719 states have (on average 1.3763816172193135) internal successors, (2366), 1785 states have internal predecessors, (2366), 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-03-04 04:09:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3392 transitions. [2025-03-04 04:09:50,606 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3392 transitions. Word has length 292 [2025-03-04 04:09:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:50,607 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 3392 transitions. [2025-03-04 04:09:50,607 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-03-04 04:09:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3392 transitions. [2025-03-04 04:09:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-04 04:09:50,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:50,617 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-03-04 04:09:50,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 04:09:50,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 04:09:50,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:50,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1432494719, now seen corresponding path program 1 times [2025-03-04 04:09:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:50,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482699659] [2025-03-04 04:09:50,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:51,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 04:09:51,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 04:09:51,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:51,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-04 04:09:52,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482699659] [2025-03-04 04:09:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482699659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442318325] [2025-03-04 04:09:52,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:52,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:52,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:52,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:09:52,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:09:52,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-04 04:09:53,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-04 04:09:53,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:53,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:53,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 2177 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 04:09:53,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-04 04:09:53,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:53,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442318325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:53,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:53,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 04:09:53,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180520151] [2025-03-04 04:09:53,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:53,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:53,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:53,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:53,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:53,400 INFO L87 Difference]: Start difference. First operand 2367 states and 3392 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:09:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:53,498 INFO L93 Difference]: Finished difference Result 4117 states and 5914 transitions. [2025-03-04 04:09:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 302 [2025-03-04 04:09:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:53,511 INFO L225 Difference]: With dead ends: 4117 [2025-03-04 04:09:53,511 INFO L226 Difference]: Without dead ends: 2367 [2025-03-04 04:09:53,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 04:09:53,517 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 2 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:53,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3343 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:09:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2025-03-04 04:09:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2025-03-04 04:09:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 1719 states have (on average 1.3746364165212333) internal successors, (2363), 1785 states have internal predecessors, (2363), 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-03-04 04:09:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3389 transitions. [2025-03-04 04:09:53,599 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3389 transitions. Word has length 302 [2025-03-04 04:09:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:53,599 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 3389 transitions. [2025-03-04 04:09:53,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:09:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3389 transitions. [2025-03-04 04:09:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-04 04:09:53,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:53,609 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, 1, 1] [2025-03-04 04:09:53,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 04:09:53,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:53,810 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:53,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash 43092048, now seen corresponding path program 1 times [2025-03-04 04:09:53,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:53,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021554720] [2025-03-04 04:09:53,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:53,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:54,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-04 04:09:54,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-04 04:09:54,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:54,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2025-03-04 04:09:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021554720] [2025-03-04 04:09:54,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021554720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:54,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243524243] [2025-03-04 04:09:54,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:54,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:54,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:09:54,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 04:09:55,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-04 04:09:55,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-04 04:09:55,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:55,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:56,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 2180 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 04:09:56,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-04 04:09:56,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243524243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:56,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:56,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-04 04:09:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017817122] [2025-03-04 04:09:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:56,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:56,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:56,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:09:56,070 INFO L87 Difference]: Start difference. First operand 2367 states and 3389 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 04:09:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:56,234 INFO L93 Difference]: Finished difference Result 4102 states and 5894 transitions. [2025-03-04 04:09:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 304 [2025-03-04 04:09:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:56,250 INFO L225 Difference]: With dead ends: 4102 [2025-03-04 04:09:56,250 INFO L226 Difference]: Without dead ends: 2369 [2025-03-04 04:09:56,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:09:56,260 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 0 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4997 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:56,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4997 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-04 04:09:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2369. [2025-03-04 04:09:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 1721 states have (on average 1.3742010459035445) internal successors, (2365), 1787 states have internal predecessors, (2365), 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-03-04 04:09:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3391 transitions. [2025-03-04 04:09:56,341 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3391 transitions. Word has length 304 [2025-03-04 04:09:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:56,343 INFO L471 AbstractCegarLoop]: Abstraction has 2369 states and 3391 transitions. [2025-03-04 04:09:56,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 04:09:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3391 transitions. [2025-03-04 04:09:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 04:09:56,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:56,352 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:09:56,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 04:09:56,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:56,552 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:56,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1062054153, now seen corresponding path program 1 times [2025-03-04 04:09:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011663324] [2025-03-04 04:09:56,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:56,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 04:09:56,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 04:09:56,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:56,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-03-04 04:09:56,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011663324] [2025-03-04 04:09:56,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011663324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:56,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:56,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704543234] [2025-03-04 04:09:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:56,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:56,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:56,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:56,925 INFO L87 Difference]: Start difference. First operand 2369 states and 3391 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:09:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:57,036 INFO L93 Difference]: Finished difference Result 4106 states and 5899 transitions. [2025-03-04 04:09:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:57,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 312 [2025-03-04 04:09:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:57,046 INFO L225 Difference]: With dead ends: 4106 [2025-03-04 04:09:57,046 INFO L226 Difference]: Without dead ends: 2371 [2025-03-04 04:09:57,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:57,051 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 2 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:57,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3329 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2025-03-04 04:09:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2371. [2025-03-04 04:09:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1723 states have (on average 1.3737666860127684) internal successors, (2367), 1789 states have internal predecessors, (2367), 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-03-04 04:09:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3393 transitions. [2025-03-04 04:09:57,123 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3393 transitions. Word has length 312 [2025-03-04 04:09:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:57,123 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3393 transitions. [2025-03-04 04:09:57,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:09:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3393 transitions. [2025-03-04 04:09:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-04 04:09:57,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:57,130 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:09:57,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 04:09:57,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:57,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash 739647017, now seen corresponding path program 1 times [2025-03-04 04:09:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:57,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340646648] [2025-03-04 04:09:57,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:57,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-04 04:09:57,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-04 04:09:57,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:57,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-04 04:09:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:58,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340646648] [2025-03-04 04:09:58,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340646648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:58,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037385371] [2025-03-04 04:09:58,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:58,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:58,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:58,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:09:58,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 04:09:59,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-04 04:09:59,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-04 04:09:59,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:59,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:59,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 2408 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 04:09:59,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-04 04:09:59,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037385371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2025-03-04 04:09:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941437917] [2025-03-04 04:09:59,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:59,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 04:09:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:59,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 04:09:59,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:09:59,421 INFO L87 Difference]: Start difference. First operand 2371 states and 3393 transitions. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-04 04:09:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:59,740 INFO L93 Difference]: Finished difference Result 4136 states and 5944 transitions. [2025-03-04 04:09:59,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 04:09:59,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) Word has length 321 [2025-03-04 04:09:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:59,758 INFO L225 Difference]: With dead ends: 4136 [2025-03-04 04:09:59,758 INFO L226 Difference]: Without dead ends: 2391 [2025-03-04 04:09:59,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 04:09:59,764 INFO L435 NwaCegarLoop]: 1697 mSDtfsCounter, 891 mSDsluCounter, 11786 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 13483 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:59,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 13483 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:09:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2025-03-04 04:09:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2389. [2025-03-04 04:09:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 1735 states have (on average 1.3711815561959655) internal successors, (2379), 1804 states have internal predecessors, (2379), 513 states have call successors, (513), 134 states have call predecessors, (513), 140 states have return successors, (533), 511 states have call predecessors, (533), 513 states have call successors, (533) [2025-03-04 04:09:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3425 transitions. [2025-03-04 04:09:59,846 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3425 transitions. Word has length 321 [2025-03-04 04:09:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:59,846 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 3425 transitions. [2025-03-04 04:09:59,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 7 states have internal predecessors, (152), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-04 04:09:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3425 transitions. [2025-03-04 04:09:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-04 04:09:59,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:59,855 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:09:59,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 04:10:00,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 04:10:00,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:10:00,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:10:00,057 INFO L85 PathProgramCache]: Analyzing trace with hash -702944480, now seen corresponding path program 1 times [2025-03-04 04:10:00,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:10:00,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934308484] [2025-03-04 04:10:00,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:10:00,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:10:00,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 04:10:00,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 04:10:00,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:10:00,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:10:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2025-03-04 04:10:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:10:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934308484] [2025-03-04 04:10:00,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934308484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:10:00,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:10:00,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:10:00,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524006032] [2025-03-04 04:10:00,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:10:00,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:10:00,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:10:00,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:10:00,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:10:00,793 INFO L87 Difference]: Start difference. First operand 2389 states and 3425 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:10:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:10:01,014 INFO L93 Difference]: Finished difference Result 4142 states and 5958 transitions. [2025-03-04 04:10:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:10:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 327 [2025-03-04 04:10:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:10:01,027 INFO L225 Difference]: With dead ends: 4142 [2025-03-04 04:10:01,027 INFO L226 Difference]: Without dead ends: 2393 [2025-03-04 04:10:01,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:10:01,035 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 2 mSDsluCounter, 6669 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8341 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:10:01,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8341 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:10:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2025-03-04 04:10:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2392. [2025-03-04 04:10:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 1738 states have (on average 1.3705408515535098) internal successors, (2382), 1806 states have internal predecessors, (2382), 513 states have call successors, (513), 134 states have call predecessors, (513), 140 states have return successors, (533), 512 states have call predecessors, (533), 513 states have call successors, (533) [2025-03-04 04:10:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3428 transitions. [2025-03-04 04:10:01,147 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3428 transitions. Word has length 327 [2025-03-04 04:10:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:10:01,148 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3428 transitions. [2025-03-04 04:10:01,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 5 states have internal predecessors, (139), 2 states have call successors, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:10:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3428 transitions. [2025-03-04 04:10:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-04 04:10:01,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:10:01,155 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:10:01,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 04:10:01,156 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:10:01,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:10:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1209631287, now seen corresponding path program 2 times [2025-03-04 04:10:01,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:10:01,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687569481] [2025-03-04 04:10:01,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:10:01,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:10:01,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 333 statements into 2 equivalence classes. [2025-03-04 04:10:01,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 333 of 333 statements. [2025-03-04 04:10:01,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 04:10:01,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:10:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 04:10:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:10:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687569481] [2025-03-04 04:10:02,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687569481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:10:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86210531] [2025-03-04 04:10:02,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:10:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:10:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:10:02,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:10:02,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 04:10:03,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 333 statements into 2 equivalence classes.