./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 992655552ae218ee7e8c394eee3a8415ead8a3964b9945bcb1a5e6ecd929382d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:01:16,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:01:16,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:01:16,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:01:16,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:01:16,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:01:16,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:01:16,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:01:16,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:01:16,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:01:16,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:01:16,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:01:16,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:01:16,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:01:16,532 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:01:16,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:01:16,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:01:16,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:01:16,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:01:16,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:01:16,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:01:16,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:01:16,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:01:16,535 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 992655552ae218ee7e8c394eee3a8415ead8a3964b9945bcb1a5e6ecd929382d [2025-02-06 06:01:16,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:01:16,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:01:16,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:01:16,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:01:16,769 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:01:16,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2025-02-06 06:01:18,258 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/192ced388/dba502d53d7845c4b2904c0444162a05/FLAG85f9af89e [2025-02-06 06:01:18,768 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:01:18,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2025-02-06 06:01:18,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/192ced388/dba502d53d7845c4b2904c0444162a05/FLAG85f9af89e [2025-02-06 06:01:18,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/192ced388/dba502d53d7845c4b2904c0444162a05 [2025-02-06 06:01:18,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:01:18,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:01:18,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:01:18,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:01:18,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:01:18,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:18" (1/1) ... [2025-02-06 06:01:18,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f43ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:18, skipping insertion in model container [2025-02-06 06:01:18,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:18" (1/1) ... [2025-02-06 06:01:18,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:01:20,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2025-02-06 06:01:20,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:01:20,105 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:01:20,176 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"); [4703] [2025-02-06 06:01:20,178 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)); [4710] [2025-02-06 06:01:20,178 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"); [4718-4719] [2025-02-06 06:01:20,179 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"); [4727-4728] [2025-02-06 06:01:20,180 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2025-02-06 06:01:20,180 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2025-02-06 06:01:20,180 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2025-02-06 06:01:20,180 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2025-02-06 06:01:20,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] [2025-02-06 06:01:20,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5127] [2025-02-06 06:01:20,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5131] [2025-02-06 06:01:20,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5135] [2025-02-06 06:01:20,199 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"); [5146] [2025-02-06 06:01:20,199 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"); [5150] [2025-02-06 06:01:20,199 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"); [5154] [2025-02-06 06:01:20,199 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"); [5158] [2025-02-06 06:01:20,201 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"); [5169] [2025-02-06 06:01:20,201 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"); [5173] [2025-02-06 06:01:20,201 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"); [5177] [2025-02-06 06:01:20,201 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"); [5181] [2025-02-06 06:01:20,202 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"); [5192] [2025-02-06 06:01:20,203 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"); [5196] [2025-02-06 06:01:20,203 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"); [5200] [2025-02-06 06:01:20,204 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"); [5204] [2025-02-06 06:01:20,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] [2025-02-06 06:01:20,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5258] [2025-02-06 06:01:20,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5262] [2025-02-06 06:01:20,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5266] [2025-02-06 06:01:20,206 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"); [5277] [2025-02-06 06:01:20,206 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"); [5281] [2025-02-06 06:01:20,206 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"); [5285] [2025-02-06 06:01:20,207 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"); [5289] [2025-02-06 06:01:20,207 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"); [5300] [2025-02-06 06:01:20,207 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"); [5304] [2025-02-06 06:01:20,207 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"); [5308] [2025-02-06 06:01:20,207 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"); [5312] [2025-02-06 06:01:20,208 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"); [5323] [2025-02-06 06:01:20,208 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"); [5327] [2025-02-06 06:01:20,208 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"); [5331] [2025-02-06 06:01:20,209 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"); [5335] [2025-02-06 06:01:20,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] [2025-02-06 06:01:20,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5413] [2025-02-06 06:01:20,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5417] [2025-02-06 06:01:20,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5421] [2025-02-06 06:01:20,217 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"); [5432] [2025-02-06 06:01:20,217 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"); [5436] [2025-02-06 06:01:20,217 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"); [5440] [2025-02-06 06:01:20,217 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"); [5444] [2025-02-06 06:01:20,217 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"); [5455] [2025-02-06 06:01:20,217 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"); [5459] [2025-02-06 06:01:20,218 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"); [5463] [2025-02-06 06:01:20,218 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"); [5467] [2025-02-06 06:01:20,281 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"); [6408] [2025-02-06 06:01:20,281 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"); [6411] [2025-02-06 06:01:20,282 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"); [6414] [2025-02-06 06:01:20,282 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"); [6417] [2025-02-06 06:01:20,282 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"); [6420] [2025-02-06 06:01:20,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6433] [2025-02-06 06:01:20,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6436] [2025-02-06 06:01:20,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6439] [2025-02-06 06:01:20,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6442] [2025-02-06 06:01:20,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6445] [2025-02-06 06:01:20,284 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)); [6467] [2025-02-06 06:01:20,285 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)); [6470] [2025-02-06 06:01:20,285 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)); [6473] [2025-02-06 06:01:20,285 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)); [6476] [2025-02-06 06:01:20,286 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)); [6479] [2025-02-06 06:01:20,288 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"); [6512-6513] [2025-02-06 06:01:20,288 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"); [6516-6517] [2025-02-06 06:01:20,288 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"); [6520-6521] [2025-02-06 06:01:20,288 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"); [6524-6525] [2025-02-06 06:01:20,292 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"); [6528-6529] [2025-02-06 06:01:20,292 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)); [6542] [2025-02-06 06:01:20,292 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)); [6545] [2025-02-06 06:01:20,292 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)); [6548] [2025-02-06 06:01:20,292 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)); [6551] [2025-02-06 06:01:20,292 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)); [6554] [2025-02-06 06:01:20,294 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"); [6587-6588] [2025-02-06 06:01:20,294 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"); [6591-6592] [2025-02-06 06:01:20,294 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"); [6595-6596] [2025-02-06 06:01:20,294 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"); [6599-6600] [2025-02-06 06:01:20,295 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"); [6603-6604] [2025-02-06 06:01:20,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2025-02-06 06:01:20,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:01:20,426 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:01:20,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20 WrapperNode [2025-02-06 06:01:20,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:01:20,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:01:20,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:01:20,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:01:20,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,557 INFO L138 Inliner]: procedures = 156, calls = 821, calls flagged for inlining = 81, calls inlined = 80, statements flattened = 3006 [2025-02-06 06:01:20,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:01:20,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:01:20,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:01:20,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:01:20,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,847 INFO L175 MemorySlicer]: Split 418 memory accesses to 11 slices as follows [2, 1, 2, 12, 4, 1, 36, 22, 334, 1, 3]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0]. The 177 writes are split as follows [0, 0, 0, 12, 1, 1, 36, 22, 105, 0, 0]. [2025-02-06 06:01:20,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,901 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:01:20,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:01:20,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:01:20,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:01:20,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (1/1) ... [2025-02-06 06:01:20,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:01:21,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:01:21,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:01:21,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 06:01:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-02-06 06:01:21,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:01:21,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:01:21,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:01:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:01:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:01:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:01:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:01:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:01:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:01:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-02-06 06:01:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-02-06 06:01:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-02-06 06:01:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-02-06 06:01:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-02-06 06:01:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-02-06 06:01:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:01:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-02-06 06:01:21,050 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-02-06 06:01:21,050 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:01:21,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-02-06 06:01:21,055 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 06:01:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-02-06 06:01:21,056 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:01:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-02-06 06:01:21,057 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-02-06 06:01:21,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-02-06 06:01:21,057 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-02-06 06:01:21,057 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-06 06:01:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:01:21,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:01:21,060 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-02-06 06:01:21,060 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-02-06 06:01:21,060 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-02-06 06:01:21,060 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-02-06 06:01:21,627 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:01:21,629 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:01:21,700 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7183: havoc #t~nondet526; [2025-02-06 06:01:21,728 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4847: havoc ~res~0#1.base, ~res~0#1.offset; [2025-02-06 06:01:21,754 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4735: havoc #t~mem2;havoc #t~bitwise3; [2025-02-06 06:01:21,760 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop_returnLabel#1: assume { :end_inline_ldv_stop } true; [2025-02-06 06:01:21,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7186: havoc #t~ret527.base, #t~ret527.offset; [2025-02-06 06:01:21,887 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7179: havoc #t~nondet525; [2025-02-06 06:01:22,143 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7268: havoc slhc_uncompress_#t~nondet542#1; [2025-02-06 06:01:22,143 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7264: havoc slhc_remember_#t~nondet541#1; [2025-02-06 06:01:22,143 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7227: havoc netif_rx_#t~nondet532#1; [2025-02-06 06:01:22,295 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7150: havoc _copy_to_user_#t~nondet522#1; [2025-02-06 06:01:22,296 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7283: havoc tty_mode_ioctl_#t~nondet545#1; [2025-02-06 06:01:22,452 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7219: havoc #t~nondet530; [2025-02-06 06:01:22,527 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7276: havoc #t~nondet544; [2025-02-06 06:01:22,530 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7235: havoc #t~nondet534; [2025-02-06 06:01:22,535 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4857: havoc __kmalloc_#t~ret46#1.base, __kmalloc_#t~ret46#1.offset; [2025-02-06 06:01:22,543 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4897: havoc #t~mem56.base, #t~mem56.offset; [2025-02-06 06:01:28,023 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7172: havoc capable_#t~nondet524#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7239: havoc register_netdevice_#t~nondet535#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6843: call ULTIMATE.dealloc(sl_outfill_~#s~0#1.base, sl_outfill_~#s~0#1.offset);havoc sl_outfill_~#s~0#1.base, sl_outfill_~#s~0#1.offset; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7112-1: ldv_register_netdevice_2_#res#1 := ldv_register_netdevice_2_~ldv_func_res~1#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5593: call ULTIMATE.dealloc(sl_encaps_~#p~0#1.base, sl_encaps_~#p~0#1.offset);havoc sl_encaps_~#p~0#1.base, sl_encaps_~#p~0#1.offset; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6917: call ULTIMATE.dealloc(main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset);havoc main_~#var_group3~0#1.base, main_~#var_group3~0#1.offset;call ULTIMATE.dealloc(main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset);havoc main_~#var_group4~0#1.base, main_~#var_group4~0#1.offset;call ULTIMATE.dealloc(main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset);havoc main_~#var_group5~0#1.base, main_~#var_group5~0#1.offset; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7254: havoc slhc_compress_#t~nondet539#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7190: havoc dev_close_#t~nondet528#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7194: havoc dev_trans_start_#t~nondet529#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7260: havoc slhc_init_#t~ret540#1.base, slhc_init_#t~ret540#1.offset; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7272: havoc tty_chars_in_buffer_#t~nondet543#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7287: havoc tty_register_ldisc_#t~nondet546#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5966: 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;call ULTIMATE.dealloc(sl_alloc_~#__key___0~0#1.base, sl_alloc_~#__key___0~0#1.offset);havoc sl_alloc_~#__key___0~0#1.base, sl_alloc_~#__key___0~0#1.offset;call ULTIMATE.dealloc(sl_alloc_~#__key___1~0#1.base, sl_alloc_~#__key___1~0#1.offset);havoc sl_alloc_~#__key___1~0#1.base, sl_alloc_~#__key___1~0#1.offset; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7223: havoc msleep_interruptible_#t~nondet531#1; [2025-02-06 06:01:28,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7291: havoc tty_unregister_ldisc_#t~nondet547#1; [2025-02-06 06:01:28,025 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7099-1: ldv_sl_alloc_bufs_1_#res#1 := ldv_sl_alloc_bufs_1_~ldv_func_res~0#1; [2025-02-06 06:01:28,025 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7168: havoc alloc_netdev_mqs_#t~ret523#1.base, alloc_netdev_mqs_#t~ret523#1.offset; [2025-02-06 06:01:28,063 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7231: havoc netpoll_trap_#t~nondet533#1; [2025-02-06 06:01:28,399 INFO L? ?]: Removed 1462 outVars from TransFormulas that were not future-live. [2025-02-06 06:01:28,400 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:01:28,463 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:01:28,464 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 06:01:28,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:28 BoogieIcfgContainer [2025-02-06 06:01:28,464 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:01:28,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:01:28,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:01:28,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:01:28,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:01:18" (1/3) ... [2025-02-06 06:01:28,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf87bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:28, skipping insertion in model container [2025-02-06 06:01:28,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:20" (2/3) ... [2025-02-06 06:01:28,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf87bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:28, skipping insertion in model container [2025-02-06 06:01:28,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:28" (3/3) ... [2025-02-06 06:01:28,481 INFO L128 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2025-02-06 06:01:28,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:01:28,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i that has 56 procedures, 1109 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-02-06 06:01:28,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:01:28,590 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;@22bc930c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:01:28,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:01:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 1059 states, 778 states have (on average 1.4254498714652957) internal successors, (1109), 816 states have internal predecessors, (1109), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2025-02-06 06:01:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 06:01:28,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:28,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:28,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash -463452318, now seen corresponding path program 1 times [2025-02-06 06:01:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:28,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952989492] [2025-02-06 06:01:28,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:29,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 06:01:29,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 06:01:29,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:29,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 06:01:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952989492] [2025-02-06 06:01:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952989492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:29,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:01:29,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998299175] [2025-02-06 06:01:29,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:01:29,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:29,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:01:29,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:01:29,913 INFO L87 Difference]: Start difference. First operand has 1059 states, 778 states have (on average 1.4254498714652957) internal successors, (1109), 816 states have internal predecessors, (1109), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 06:01:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:30,121 INFO L93 Difference]: Finished difference Result 2114 states and 3164 transitions. [2025-02-06 06:01:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:01:30,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2025-02-06 06:01:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:30,150 INFO L225 Difference]: With dead ends: 2114 [2025-02-06 06:01:30,151 INFO L226 Difference]: Without dead ends: 1016 [2025-02-06 06:01:30,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:01:30,166 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 1565 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:30,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 1545 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:01:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-02-06 06:01:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-02-06 06:01:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 746 states have (on average 1.415549597855228) internal successors, (1056), 781 states have internal predecessors, (1056), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-02-06 06:01:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1504 transitions. [2025-02-06 06:01:30,312 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1504 transitions. Word has length 77 [2025-02-06 06:01:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:30,314 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1504 transitions. [2025-02-06 06:01:30,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 06:01:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1504 transitions. [2025-02-06 06:01:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 06:01:30,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:30,322 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:30,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:01:30,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:30,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash -183102429, now seen corresponding path program 1 times [2025-02-06 06:01:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651447335] [2025-02-06 06:01:30,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:30,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 06:01:30,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 06:01:30,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:30,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 06:01:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651447335] [2025-02-06 06:01:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651447335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:31,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:01:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052125938] [2025-02-06 06:01:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:01:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:31,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:01:31,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:31,121 INFO L87 Difference]: Start difference. First operand 1016 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 06:01:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:31,242 INFO L93 Difference]: Finished difference Result 1020 states and 1508 transitions. [2025-02-06 06:01:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:01:31,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 77 [2025-02-06 06:01:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:31,249 INFO L225 Difference]: With dead ends: 1020 [2025-02-06 06:01:31,250 INFO L226 Difference]: Without dead ends: 1018 [2025-02-06 06:01:31,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:31,251 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 0 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:31,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4454 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:01:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-02-06 06:01:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-02-06 06:01:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 748 states have (on average 1.414438502673797) internal successors, (1058), 783 states have internal predecessors, (1058), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-02-06 06:01:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1506 transitions. [2025-02-06 06:01:31,304 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1506 transitions. Word has length 77 [2025-02-06 06:01:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:31,304 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1506 transitions. [2025-02-06 06:01:31,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 06:01:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1506 transitions. [2025-02-06 06:01:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 06:01:31,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:31,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:31,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:01:31,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:31,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1262745602, now seen corresponding path program 1 times [2025-02-06 06:01:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:31,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874303551] [2025-02-06 06:01:31,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:31,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 06:01:31,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 06:01:31,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:31,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 06:01:31,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:31,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874303551] [2025-02-06 06:01:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874303551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:31,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:01:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081262815] [2025-02-06 06:01:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:31,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:01:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:31,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:01:31,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:31,842 INFO L87 Difference]: Start difference. First operand 1018 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 06:01:35,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:01:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:36,755 INFO L93 Difference]: Finished difference Result 2016 states and 2986 transitions. [2025-02-06 06:01:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:01:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-02-06 06:01:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:36,768 INFO L225 Difference]: With dead ends: 2016 [2025-02-06 06:01:36,769 INFO L226 Difference]: Without dead ends: 1029 [2025-02-06 06:01:36,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:36,773 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 1487 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:36,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 2506 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-02-06 06:01:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-02-06 06:01:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1019. [2025-02-06 06:01:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 749 states have (on average 1.4138851802403205) internal successors, (1059), 784 states have internal predecessors, (1059), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-02-06 06:01:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1507 transitions. [2025-02-06 06:01:36,842 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1507 transitions. Word has length 87 [2025-02-06 06:01:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:36,843 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1507 transitions. [2025-02-06 06:01:36,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 06:01:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1507 transitions. [2025-02-06 06:01:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 06:01:36,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:36,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:36,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:01:36,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:36,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1101956415, now seen corresponding path program 1 times [2025-02-06 06:01:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159611140] [2025-02-06 06:01:36,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:37,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 06:01:37,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 06:01:37,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:37,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 06:01:37,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:37,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159611140] [2025-02-06 06:01:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159611140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:37,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:37,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:01:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228676579] [2025-02-06 06:01:37,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:37,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:01:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:37,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:01:37,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:01:37,272 INFO L87 Difference]: Start difference. First operand 1019 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 06:01:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:37,379 INFO L93 Difference]: Finished difference Result 2008 states and 2973 transitions. [2025-02-06 06:01:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:01:37,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-02-06 06:01:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:37,392 INFO L225 Difference]: With dead ends: 2008 [2025-02-06 06:01:37,392 INFO L226 Difference]: Without dead ends: 1020 [2025-02-06 06:01:37,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:01:37,397 INFO L435 NwaCegarLoop]: 1488 mSDtfsCounter, 0 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:37,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2970 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:01:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-02-06 06:01:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2025-02-06 06:01:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 750 states have (on average 1.4133333333333333) internal successors, (1060), 785 states have internal predecessors, (1060), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-02-06 06:01:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1508 transitions. [2025-02-06 06:01:37,453 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1508 transitions. Word has length 89 [2025-02-06 06:01:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:37,453 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1508 transitions. [2025-02-06 06:01:37,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 06:01:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1508 transitions. [2025-02-06 06:01:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 06:01:37,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:37,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:37,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:01:37,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1385556418, now seen corresponding path program 1 times [2025-02-06 06:01:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444416616] [2025-02-06 06:01:37,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:37,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 06:01:37,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 06:01:37,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:37,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 06:01:38,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:38,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444416616] [2025-02-06 06:01:38,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444416616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:38,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:38,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:01:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115011931] [2025-02-06 06:01:38,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:38,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:01:38,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:38,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:01:38,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:01:38,015 INFO L87 Difference]: Start difference. First operand 1020 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 06:01:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:38,153 INFO L93 Difference]: Finished difference Result 1037 states and 1531 transitions. [2025-02-06 06:01:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:01:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-02-06 06:01:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:38,159 INFO L225 Difference]: With dead ends: 1037 [2025-02-06 06:01:38,159 INFO L226 Difference]: Without dead ends: 1035 [2025-02-06 06:01:38,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:01:38,161 INFO L435 NwaCegarLoop]: 1489 mSDtfsCounter, 120 mSDsluCounter, 4304 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 5793 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:38,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 5793 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:01:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-02-06 06:01:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1022. [2025-02-06 06:01:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 751 states have (on average 1.4127829560585885) internal successors, (1061), 785 states have internal predecessors, (1061), 225 states have call successors, (225), 45 states have call predecessors, (225), 45 states have return successors, (225), 223 states have call predecessors, (225), 225 states have call successors, (225) [2025-02-06 06:01:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1511 transitions. [2025-02-06 06:01:38,201 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1511 transitions. Word has length 89 [2025-02-06 06:01:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:38,201 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1511 transitions. [2025-02-06 06:01:38,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 06:01:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1511 transitions. [2025-02-06 06:01:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 06:01:38,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:38,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:38,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:01:38,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:38,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1297209911, now seen corresponding path program 1 times [2025-02-06 06:01:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:38,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190655852] [2025-02-06 06:01:38,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:38,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 06:01:38,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 06:01:38,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:38,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 06:01:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190655852] [2025-02-06 06:01:38,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190655852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:38,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:01:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029671147] [2025-02-06 06:01:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:38,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:01:38,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:38,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:01:38,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:01:38,701 INFO L87 Difference]: Start difference. First operand 1022 states and 1511 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 06:01:42,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:01:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:42,901 INFO L93 Difference]: Finished difference Result 2977 states and 4407 transitions. [2025-02-06 06:01:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:01:42,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-02-06 06:01:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:42,911 INFO L225 Difference]: With dead ends: 2977 [2025-02-06 06:01:42,912 INFO L226 Difference]: Without dead ends: 1986 [2025-02-06 06:01:42,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:01:42,916 INFO L435 NwaCegarLoop]: 1754 mSDtfsCounter, 1438 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:42,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 3176 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:01:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2025-02-06 06:01:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1984. [2025-02-06 06:01:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1459 states have (on average 1.4167237834132969) internal successors, (2067), 1526 states have internal predecessors, (2067), 435 states have call successors, (435), 89 states have call predecessors, (435), 89 states have return successors, (435), 431 states have call predecessors, (435), 435 states have call successors, (435) [2025-02-06 06:01:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2937 transitions. [2025-02-06 06:01:43,019 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2937 transitions. Word has length 121 [2025-02-06 06:01:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:43,020 INFO L471 AbstractCegarLoop]: Abstraction has 1984 states and 2937 transitions. [2025-02-06 06:01:43,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 06:01:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2937 transitions. [2025-02-06 06:01:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 06:01:43,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:43,027 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-02-06 06:01:43,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:01:43,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:43,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash 717931083, now seen corresponding path program 1 times [2025-02-06 06:01:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728358174] [2025-02-06 06:01:43,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:43,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 06:01:43,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 06:01:43,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:43,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 06:01:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:43,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728358174] [2025-02-06 06:01:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728358174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:43,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:01:43,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269800467] [2025-02-06 06:01:43,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:43,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:01:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:43,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:01:43,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:43,373 INFO L87 Difference]: Start difference. First operand 1984 states and 2937 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 06:01:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:43,501 INFO L93 Difference]: Finished difference Result 2998 states and 4425 transitions. [2025-02-06 06:01:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:01:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-02-06 06:01:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:43,509 INFO L225 Difference]: With dead ends: 2998 [2025-02-06 06:01:43,509 INFO L226 Difference]: Without dead ends: 1043 [2025-02-06 06:01:43,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:43,514 INFO L435 NwaCegarLoop]: 1488 mSDtfsCounter, 0 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4457 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:43,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4457 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:01:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2025-02-06 06:01:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2025-02-06 06:01:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 766 states have (on average 1.4033942558746737) internal successors, (1075), 800 states have internal predecessors, (1075), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-02-06 06:01:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1527 transitions. [2025-02-06 06:01:43,569 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1527 transitions. Word has length 123 [2025-02-06 06:01:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1527 transitions. [2025-02-06 06:01:43,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 06:01:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1527 transitions. [2025-02-06 06:01:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 06:01:43,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:43,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:43,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:01:43,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:43,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1137834777, now seen corresponding path program 1 times [2025-02-06 06:01:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:43,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148417677] [2025-02-06 06:01:43,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 06:01:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 06:01:43,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:43,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 06:01:44,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:44,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148417677] [2025-02-06 06:01:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148417677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:44,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:44,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:01:44,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290410337] [2025-02-06 06:01:44,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:44,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:01:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:44,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:01:44,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:44,046 INFO L87 Difference]: Start difference. First operand 1043 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 06:01:48,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:01:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:48,894 INFO L93 Difference]: Finished difference Result 2061 states and 3035 transitions. [2025-02-06 06:01:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:01:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-02-06 06:01:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:48,901 INFO L225 Difference]: With dead ends: 2061 [2025-02-06 06:01:48,901 INFO L226 Difference]: Without dead ends: 1070 [2025-02-06 06:01:48,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:48,905 INFO L435 NwaCegarLoop]: 1474 mSDtfsCounter, 1496 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:48,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 2495 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 513 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-02-06 06:01:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-02-06 06:01:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1047. [2025-02-06 06:01:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 770 states have (on average 1.4025974025974026) internal successors, (1080), 804 states have internal predecessors, (1080), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-02-06 06:01:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1532 transitions. [2025-02-06 06:01:48,951 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1532 transitions. Word has length 123 [2025-02-06 06:01:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:48,952 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1532 transitions. [2025-02-06 06:01:48,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 06:01:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1532 transitions. [2025-02-06 06:01:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 06:01:48,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:48,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:48,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:01:48,957 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:48,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1217888444, now seen corresponding path program 1 times [2025-02-06 06:01:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:48,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218871269] [2025-02-06 06:01:48,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:49,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 06:01:49,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 06:01:49,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:49,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 06:01:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218871269] [2025-02-06 06:01:49,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218871269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:49,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:49,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:01:49,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645431582] [2025-02-06 06:01:49,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:49,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:01:49,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:49,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:01:49,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:01:49,298 INFO L87 Difference]: Start difference. First operand 1047 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:01:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:49,387 INFO L93 Difference]: Finished difference Result 2042 states and 3012 transitions. [2025-02-06 06:01:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:01:49,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2025-02-06 06:01:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:49,394 INFO L225 Difference]: With dead ends: 2042 [2025-02-06 06:01:49,395 INFO L226 Difference]: Without dead ends: 1047 [2025-02-06 06:01:49,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:01:49,400 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 0 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:49,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2950 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:01:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-02-06 06:01:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2025-02-06 06:01:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 770 states have (on average 1.3987012987012988) internal successors, (1077), 804 states have internal predecessors, (1077), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-02-06 06:01:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1529 transitions. [2025-02-06 06:01:49,449 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1529 transitions. Word has length 126 [2025-02-06 06:01:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:49,450 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1529 transitions. [2025-02-06 06:01:49,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:01:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1529 transitions. [2025-02-06 06:01:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 06:01:49,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:49,454 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:01:49,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:01:49,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:49,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash -448381509, now seen corresponding path program 1 times [2025-02-06 06:01:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:49,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028525212] [2025-02-06 06:01:49,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:49,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 06:01:49,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 06:01:49,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:49,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 06:01:49,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:49,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028525212] [2025-02-06 06:01:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028525212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:01:49,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:01:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:01:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710652700] [2025-02-06 06:01:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:01:49,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:01:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:49,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:01:49,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:49,943 INFO L87 Difference]: Start difference. First operand 1047 states and 1529 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 06:01:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:01:50,036 INFO L93 Difference]: Finished difference Result 1051 states and 1533 transitions. [2025-02-06 06:01:50,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:01:50,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 129 [2025-02-06 06:01:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:01:50,043 INFO L225 Difference]: With dead ends: 1051 [2025-02-06 06:01:50,043 INFO L226 Difference]: Without dead ends: 1049 [2025-02-06 06:01:50,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:01:50,044 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 0 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:01:50,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4433 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:01:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-02-06 06:01:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1047. [2025-02-06 06:01:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 770 states have (on average 1.3987012987012988) internal successors, (1077), 804 states have internal predecessors, (1077), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-02-06 06:01:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1529 transitions. [2025-02-06 06:01:50,094 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1529 transitions. Word has length 129 [2025-02-06 06:01:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:01:50,094 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1529 transitions. [2025-02-06 06:01:50,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 06:01:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1529 transitions. [2025-02-06 06:01:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 06:01:50,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:01:50,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 06:01:50,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:01:50,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:01:50,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:01:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1688406616, now seen corresponding path program 1 times [2025-02-06 06:01:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:01:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731828640] [2025-02-06 06:01:50,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:01:50,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 06:01:50,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 06:01:50,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:50,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 06:01:50,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:01:50,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731828640] [2025-02-06 06:01:50,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731828640] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:01:50,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313392297] [2025-02-06 06:01:50,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:01:50,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:01:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:01:50,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:01:50,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:01:51,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 06:01:51,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 06:01:51,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:01:51,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:01:51,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 06:01:51,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:01:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 06:01:51,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:01:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 06:01:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313392297] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:01:51,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:01:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-02-06 06:01:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459394104] [2025-02-06 06:01:51,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:01:51,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 06:01:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:01:51,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 06:01:51,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-06 06:01:51,806 INFO L87 Difference]: Start difference. First operand 1047 states and 1529 transitions. Second operand has 10 states, 10 states have (on average 20.3) internal successors, (203), 10 states have internal predecessors, (203), 4 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2025-02-06 06:01:55,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:01:59,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:02:03,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:02:07,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-02-06 06:02:11,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:02:15,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:02:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:02:16,755 INFO L93 Difference]: Finished difference Result 2122 states and 3119 transitions. [2025-02-06 06:02:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 06:02:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 20.3) internal successors, (203), 10 states have internal predecessors, (203), 4 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) Word has length 168 [2025-02-06 06:02:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:02:16,762 INFO L225 Difference]: With dead ends: 2122 [2025-02-06 06:02:16,763 INFO L226 Difference]: Without dead ends: 1127 [2025-02-06 06:02:16,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-06 06:02:16,766 INFO L435 NwaCegarLoop]: 1479 mSDtfsCounter, 1599 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 49 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 2571 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2025-02-06 06:02:16,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 2571 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 571 Invalid, 6 Unknown, 0 Unchecked, 24.8s Time] [2025-02-06 06:02:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-02-06 06:02:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1054. [2025-02-06 06:02:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 777 states have (on average 1.3976833976833978) internal successors, (1086), 811 states have internal predecessors, (1086), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-02-06 06:02:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1538 transitions. [2025-02-06 06:02:16,824 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1538 transitions. Word has length 168 [2025-02-06 06:02:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:02:16,824 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1538 transitions. [2025-02-06 06:02:16,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.3) internal successors, (203), 10 states have internal predecessors, (203), 4 states have call successors, (49), 3 states have call predecessors, (49), 3 states have return successors, (49), 4 states have call predecessors, (49), 4 states have call successors, (49) [2025-02-06 06:02:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1538 transitions. [2025-02-06 06:02:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 06:02:16,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:02:16,829 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 06:02:16,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:02:17,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 06:02:17,034 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:02:17,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:02:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1415046099, now seen corresponding path program 2 times [2025-02-06 06:02:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:02:17,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243601092] [2025-02-06 06:02:17,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:02:17,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:02:17,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 177 statements into 2 equivalence classes. [2025-02-06 06:02:17,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 177 statements. [2025-02-06 06:02:17,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 06:02:17,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:02:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-06 06:02:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:02:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243601092] [2025-02-06 06:02:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243601092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:02:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:02:17,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 06:02:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787708091] [2025-02-06 06:02:17,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:02:17,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 06:02:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:02:17,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 06:02:17,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 06:02:17,701 INFO L87 Difference]: Start difference. First operand 1054 states and 1538 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:02:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:02:17,936 INFO L93 Difference]: Finished difference Result 1071 states and 1562 transitions. [2025-02-06 06:02:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 06:02:17,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 177 [2025-02-06 06:02:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:02:17,943 INFO L225 Difference]: With dead ends: 1071 [2025-02-06 06:02:17,944 INFO L226 Difference]: Without dead ends: 1069 [2025-02-06 06:02:17,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 06:02:17,945 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 121 mSDsluCounter, 10154 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 11627 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:02:17,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 11627 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:02:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-02-06 06:02:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1056. [2025-02-06 06:02:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 778 states have (on average 1.3971722365038561) internal successors, (1087), 812 states have internal predecessors, (1087), 227 states have call successors, (227), 50 states have call predecessors, (227), 50 states have return successors, (227), 225 states have call predecessors, (227), 227 states have call successors, (227) [2025-02-06 06:02:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1541 transitions. [2025-02-06 06:02:18,002 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1541 transitions. Word has length 177 [2025-02-06 06:02:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:02:18,003 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1541 transitions. [2025-02-06 06:02:18,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:02:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1541 transitions. [2025-02-06 06:02:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-06 06:02:18,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:02:18,009 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:02:18,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 06:02:18,010 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:02:18,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:02:18,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1962454410, now seen corresponding path program 1 times [2025-02-06 06:02:18,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:02:18,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869250885] [2025-02-06 06:02:18,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:02:18,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:02:18,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-06 06:02:18,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-06 06:02:18,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:02:18,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:02:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-06 06:02:18,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:02:18,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869250885] [2025-02-06 06:02:18,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869250885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:02:18,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:02:18,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:02:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991089714] [2025-02-06 06:02:18,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:02:18,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:02:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:02:18,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:02:18,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:02:18,496 INFO L87 Difference]: Start difference. First operand 1056 states and 1541 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:02:18,572 INFO L93 Difference]: Finished difference Result 2060 states and 3024 transitions. [2025-02-06 06:02:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:02:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 219 [2025-02-06 06:02:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:02:18,581 INFO L225 Difference]: With dead ends: 2060 [2025-02-06 06:02:18,582 INFO L226 Difference]: Without dead ends: 1056 [2025-02-06 06:02:18,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:02:18,585 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 0 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:02:18,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2944 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:02:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-02-06 06:02:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2025-02-06 06:02:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 778 states have (on average 1.3933161953727506) internal successors, (1084), 812 states have internal predecessors, (1084), 227 states have call successors, (227), 50 states have call predecessors, (227), 50 states have return successors, (227), 225 states have call predecessors, (227), 227 states have call successors, (227) [2025-02-06 06:02:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1538 transitions. [2025-02-06 06:02:18,634 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1538 transitions. Word has length 219 [2025-02-06 06:02:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:02:18,635 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1538 transitions. [2025-02-06 06:02:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1538 transitions. [2025-02-06 06:02:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-06 06:02:18,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:02:18,707 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:02:18,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 06:02:18,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:02:18,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:02:18,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1052559349, now seen corresponding path program 1 times [2025-02-06 06:02:18,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:02:18,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629728190] [2025-02-06 06:02:18,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:02:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:02:19,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-06 06:02:19,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-06 06:02:19,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:02:19,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:02:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-06 06:02:19,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:02:19,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629728190] [2025-02-06 06:02:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629728190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:02:19,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:02:19,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:02:19,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936737482] [2025-02-06 06:02:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:02:19,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:02:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:02:19,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:02:19,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:02:19,269 INFO L87 Difference]: Start difference. First operand 1056 states and 1538 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:02:19,341 INFO L93 Difference]: Finished difference Result 2060 states and 3018 transitions. [2025-02-06 06:02:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:02:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 222 [2025-02-06 06:02:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:02:19,347 INFO L225 Difference]: With dead ends: 2060 [2025-02-06 06:02:19,348 INFO L226 Difference]: Without dead ends: 1056 [2025-02-06 06:02:19,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:02:19,351 INFO L435 NwaCegarLoop]: 1472 mSDtfsCounter, 0 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:02:19,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2938 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:02:19,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-02-06 06:02:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2025-02-06 06:02:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 778 states have (on average 1.3894601542416452) internal successors, (1081), 812 states have internal predecessors, (1081), 227 states have call successors, (227), 50 states have call predecessors, (227), 50 states have return successors, (227), 225 states have call predecessors, (227), 227 states have call successors, (227) [2025-02-06 06:02:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1535 transitions. [2025-02-06 06:02:19,396 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1535 transitions. Word has length 222 [2025-02-06 06:02:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:02:19,397 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1535 transitions. [2025-02-06 06:02:19,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1535 transitions. [2025-02-06 06:02:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-06 06:02:19,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:02:19,413 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:02:19,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 06:02:19,413 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:02:19,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:02:19,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1618914402, now seen corresponding path program 1 times [2025-02-06 06:02:19,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:02:19,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154221592] [2025-02-06 06:02:19,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:02:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:02:19,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-06 06:02:19,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-06 06:02:19,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:02:19,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:02:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-06 06:02:19,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:02:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154221592] [2025-02-06 06:02:19,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154221592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:02:19,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:02:19,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:02:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206731226] [2025-02-06 06:02:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:02:19,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:02:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:02:19,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:02:19,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:02:19,815 INFO L87 Difference]: Start difference. First operand 1056 states and 1535 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:02:19,890 INFO L93 Difference]: Finished difference Result 2060 states and 3012 transitions. [2025-02-06 06:02:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:02:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 225 [2025-02-06 06:02:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:02:19,897 INFO L225 Difference]: With dead ends: 2060 [2025-02-06 06:02:19,897 INFO L226 Difference]: Without dead ends: 1056 [2025-02-06 06:02:19,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:02:19,901 INFO L435 NwaCegarLoop]: 1469 mSDtfsCounter, 0 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2932 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:02:19,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2932 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:02:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-02-06 06:02:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2025-02-06 06:02:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 778 states have (on average 1.3856041131105399) internal successors, (1078), 812 states have internal predecessors, (1078), 227 states have call successors, (227), 50 states have call predecessors, (227), 50 states have return successors, (227), 225 states have call predecessors, (227), 227 states have call successors, (227) [2025-02-06 06:02:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1532 transitions. [2025-02-06 06:02:19,942 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1532 transitions. Word has length 225 [2025-02-06 06:02:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:02:19,943 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1532 transitions. [2025-02-06 06:02:19,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1532 transitions. [2025-02-06 06:02:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-06 06:02:19,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:02:19,948 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:02:19,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 06:02:19,948 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:02:19,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:02:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 696258999, now seen corresponding path program 1 times [2025-02-06 06:02:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:02:19,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432312066] [2025-02-06 06:02:19,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:02:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:02:20,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-06 06:02:20,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-06 06:02:20,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:02:20,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:02:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-06 06:02:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:02:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432312066] [2025-02-06 06:02:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432312066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:02:20,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:02:20,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:02:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114075822] [2025-02-06 06:02:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:02:20,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:02:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:02:20,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:02:20,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:02:20,533 INFO L87 Difference]: Start difference. First operand 1056 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:02:20,642 INFO L93 Difference]: Finished difference Result 2060 states and 3006 transitions. [2025-02-06 06:02:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:02:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 228 [2025-02-06 06:02:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:02:20,648 INFO L225 Difference]: With dead ends: 2060 [2025-02-06 06:02:20,648 INFO L226 Difference]: Without dead ends: 1056 [2025-02-06 06:02:20,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:02:20,651 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 0 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:02:20,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2926 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:02:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-02-06 06:02:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2025-02-06 06:02:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 778 states have (on average 1.3817480719794344) internal successors, (1075), 812 states have internal predecessors, (1075), 227 states have call successors, (227), 50 states have call predecessors, (227), 50 states have return successors, (227), 225 states have call predecessors, (227), 227 states have call successors, (227) [2025-02-06 06:02:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1529 transitions. [2025-02-06 06:02:20,691 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1529 transitions. Word has length 228 [2025-02-06 06:02:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:02:20,692 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1529 transitions. [2025-02-06 06:02:20,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1529 transitions. [2025-02-06 06:02:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-06 06:02:20,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:02:20,697 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:02:20,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 06:02:20,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:02:20,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:02:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash 348703822, now seen corresponding path program 1 times [2025-02-06 06:02:20,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:02:20,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130837072] [2025-02-06 06:02:20,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:02:20,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:02:20,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-06 06:02:20,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-06 06:02:20,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:02:20,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:02:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-06 06:02:21,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:02:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130837072] [2025-02-06 06:02:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130837072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:02:21,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:02:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 06:02:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20142777] [2025-02-06 06:02:21,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:02:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 06:02:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:02:21,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 06:02:21,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 06:02:21,627 INFO L87 Difference]: Start difference. First operand 1056 states and 1529 transitions. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 8 states have internal predecessors, (138), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:02:21,809 INFO L93 Difference]: Finished difference Result 1069 states and 1548 transitions. [2025-02-06 06:02:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 06:02:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 8 states have internal predecessors, (138), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) Word has length 231 [2025-02-06 06:02:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:02:21,814 INFO L225 Difference]: With dead ends: 1069 [2025-02-06 06:02:21,814 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 06:02:21,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 06:02:21,818 INFO L435 NwaCegarLoop]: 1462 mSDtfsCounter, 121 mSDsluCounter, 10074 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 11536 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:02:21,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 11536 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:02:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 06:02:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 06:02:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:02:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 06:02:21,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2025-02-06 06:02:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:02:21,821 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 06:02:21,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 8 states have internal predecessors, (138), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 3 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:02:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 06:02:21,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 06:02:21,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 06:02:21,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 06:02:21,831 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:02:21,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 06:02:25,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 06:02:25,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~err~2 [2025-02-06 06:02:25,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-02-06 06:02:25,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-02-06 06:02:25,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:02:25 BoogieIcfgContainer [2025-02-06 06:02:25,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 06:02:25,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 06:02:25,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 06:02:25,345 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 06:02:25,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:28" (3/4) ... [2025-02-06 06:02:25,347 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 06:02:25,352 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#10 [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#7 [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#6 [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#9 [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure consume_skb [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#8 [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure slip_close [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __xchg_wrong_size [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netif_running [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netif_tx_start_queue [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure del_timer_sync [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure add_timer [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure slhc_free [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_current [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mod_timer [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sl_ioctl [2025-02-06 06:02:25,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure constant_test_bit [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tty_hangup [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive_int [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure rtnl_unlock [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netif_queue_stopped [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure init_timer_key [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tty_devnum [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sl_free_bufs [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure might_fault [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_lock [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_check_return_value [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_alloc_skb [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure clear_bit [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netdev_priv [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netdev_get_tx_queue [2025-02-06 06:02:25,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure set_bit [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_unlock [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_unlock_bh [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netif_stop_queue [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#1 [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure del_timer [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#0 [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure test_and_clear_bit [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#3 [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#2 [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure unregister_netdev [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#5 [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#4 [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sl_bump [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sl_unlock [2025-02-06 06:02:25,355 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure slip_ioctl [2025-02-06 06:02:25,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_lock_bh [2025-02-06 06:02:25,399 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 219 nodes and edges [2025-02-06 06:02:25,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 66 nodes and edges [2025-02-06 06:02:25,406 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-06 06:02:25,409 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 06:02:25,412 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 06:02:25,420 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 06:02:25,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 06:02:25,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 06:02:25,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 06:02:25,613 INFO L158 Benchmark]: Toolchain (without parser) took 66786.68ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 101.4MB in the beginning and 206.5MB in the end (delta: -105.1MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2025-02-06 06:02:25,613 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 06:02:25,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1596.91ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 101.4MB in the beginning and 77.6MB in the end (delta: 23.8MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. [2025-02-06 06:02:25,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.19ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 60.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 06:02:25,614 INFO L158 Benchmark]: Boogie Preprocessor took 425.83ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 60.1MB in the beginning and 233.4MB in the end (delta: -173.4MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2025-02-06 06:02:25,614 INFO L158 Benchmark]: IcfgBuilder took 7479.22ms. Allocated memory is still 318.8MB. Free memory was 233.4MB in the beginning and 105.2MB in the end (delta: 128.2MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. [2025-02-06 06:02:25,614 INFO L158 Benchmark]: TraceAbstraction took 56873.36ms. Allocated memory was 318.8MB in the beginning and 369.1MB in the end (delta: 50.3MB). Free memory was 105.2MB in the beginning and 252.9MB in the end (delta: -147.7MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2025-02-06 06:02:25,614 INFO L158 Benchmark]: Witness Printer took 268.11ms. Allocated memory is still 369.1MB. Free memory was 252.9MB in the beginning and 206.5MB in the end (delta: 46.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 06:02:25,615 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1596.91ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 101.4MB in the beginning and 77.6MB in the end (delta: 23.8MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.19ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 60.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 425.83ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 60.1MB in the beginning and 233.4MB in the end (delta: -173.4MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * IcfgBuilder took 7479.22ms. Allocated memory is still 318.8MB. Free memory was 233.4MB in the beginning and 105.2MB in the end (delta: 128.2MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. * TraceAbstraction took 56873.36ms. Allocated memory was 318.8MB in the beginning and 369.1MB in the end (delta: 50.3MB). Free memory was 105.2MB in the beginning and 252.9MB in the end (delta: -147.7MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. * Witness Printer took 268.11ms. Allocated memory is still 369.1MB. Free memory was 252.9MB in the beginning and 206.5MB in the end (delta: 46.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4703]: 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"); [4703] - GenericResultAtLocation [Line: 4710]: 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)); [4710] - GenericResultAtLocation [Line: 4718]: 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"); [4718-4719] - GenericResultAtLocation [Line: 4727]: 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"); [4727-4728] - GenericResultAtLocation [Line: 4750]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] - GenericResultAtLocation [Line: 4753]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] - GenericResultAtLocation [Line: 4756]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] - GenericResultAtLocation [Line: 4759]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] - GenericResultAtLocation [Line: 5123]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] - GenericResultAtLocation [Line: 5127]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5127] - GenericResultAtLocation [Line: 5131]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5131] - GenericResultAtLocation [Line: 5135]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5135] - GenericResultAtLocation [Line: 5146]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5146] - GenericResultAtLocation [Line: 5150]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5150] - GenericResultAtLocation [Line: 5154]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5154] - GenericResultAtLocation [Line: 5158]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5158] - GenericResultAtLocation [Line: 5169]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5169] - GenericResultAtLocation [Line: 5173]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5173] - GenericResultAtLocation [Line: 5177]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5177] - GenericResultAtLocation [Line: 5181]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5181] - GenericResultAtLocation [Line: 5192]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5192] - GenericResultAtLocation [Line: 5196]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5196] - GenericResultAtLocation [Line: 5200]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5200] - GenericResultAtLocation [Line: 5204]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5204] - GenericResultAtLocation [Line: 5254]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] - GenericResultAtLocation [Line: 5258]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5258] - GenericResultAtLocation [Line: 5262]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5262] - GenericResultAtLocation [Line: 5266]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5266] - GenericResultAtLocation [Line: 5277]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5277] - GenericResultAtLocation [Line: 5281]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5281] - GenericResultAtLocation [Line: 5285]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5285] - GenericResultAtLocation [Line: 5289]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5289] - GenericResultAtLocation [Line: 5300]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5300] - GenericResultAtLocation [Line: 5304]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5304] - GenericResultAtLocation [Line: 5308]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5308] - GenericResultAtLocation [Line: 5312]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5312] - GenericResultAtLocation [Line: 5323]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5323] - GenericResultAtLocation [Line: 5327]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5327] - GenericResultAtLocation [Line: 5331]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5331] - GenericResultAtLocation [Line: 5335]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5335] - GenericResultAtLocation [Line: 5409]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] - GenericResultAtLocation [Line: 5413]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5413] - GenericResultAtLocation [Line: 5417]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5417] - GenericResultAtLocation [Line: 5421]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5421] - GenericResultAtLocation [Line: 5432]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5432] - GenericResultAtLocation [Line: 5436]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5436] - GenericResultAtLocation [Line: 5440]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5440] - GenericResultAtLocation [Line: 5444]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5444] - GenericResultAtLocation [Line: 5455]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5455] - GenericResultAtLocation [Line: 5459]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5459] - GenericResultAtLocation [Line: 5463]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5463] - GenericResultAtLocation [Line: 5467]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5467] - GenericResultAtLocation [Line: 6408]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6408] - GenericResultAtLocation [Line: 6411]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6411] - GenericResultAtLocation [Line: 6414]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6414] - GenericResultAtLocation [Line: 6417]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6417] - GenericResultAtLocation [Line: 6420]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6420] - GenericResultAtLocation [Line: 6433]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6433] - GenericResultAtLocation [Line: 6436]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6436] - GenericResultAtLocation [Line: 6439]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6439] - GenericResultAtLocation [Line: 6442]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6442] - GenericResultAtLocation [Line: 6445]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6445] - GenericResultAtLocation [Line: 6467]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6467] - GenericResultAtLocation [Line: 6470]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6470] - GenericResultAtLocation [Line: 6473]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6473] - GenericResultAtLocation [Line: 6476]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6476] - GenericResultAtLocation [Line: 6479]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6479] - GenericResultAtLocation [Line: 6512]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6512-6513] - GenericResultAtLocation [Line: 6516]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6516-6517] - GenericResultAtLocation [Line: 6520]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6520-6521] - GenericResultAtLocation [Line: 6524]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6524-6525] - GenericResultAtLocation [Line: 6528]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6528-6529] - GenericResultAtLocation [Line: 6542]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6542] - GenericResultAtLocation [Line: 6545]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6545] - GenericResultAtLocation [Line: 6548]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6548] - GenericResultAtLocation [Line: 6551]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6551] - GenericResultAtLocation [Line: 6554]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6554] - GenericResultAtLocation [Line: 6587]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6587-6588] - GenericResultAtLocation [Line: 6591]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6591-6592] - GenericResultAtLocation [Line: 6595]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6595-6596] - GenericResultAtLocation [Line: 6599]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6599-6600] - GenericResultAtLocation [Line: 6603]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6603-6604] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~err~2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7129]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 56 procedures, 1109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.3s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 40.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 8053 SdHoareTripleChecker+Valid, 39.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7947 mSDsluCounter, 72253 SdHoareTripleChecker+Invalid, 38.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46795 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2555 IncrementalHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 25458 mSDtfsCounter, 2555 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1984occurred in iteration=6, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 136 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2679 NumberOfCodeBlocks, 2544 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2828 ConstructedInterpolants, 0 QuantifiedInterpolants, 3824 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1414 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 882/885 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6009]: Location Invariant Derived location invariant: ((((long) i + 1) <= slip_maxdev) && (256 <= slip_maxdev)) RESULT: Ultimate proved your program to be correct! [2025-02-06 06:02:25,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE