./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-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-?-551b009-m [2025-01-09 18:06:58,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:06:58,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:06:58,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:06:58,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:06:58,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:06:58,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:06:58,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:06:58,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:06:58,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:06:58,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:06:58,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:06:58,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:06:58,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:06:58,557 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:06:58,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:06:58,558 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:06:58,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:06:58,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:06:58,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:06:58,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:06:58,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:06:58,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:06:58,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:06:58,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:06:58,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:06:58,559 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-01-09 18:06:58,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:06:58,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:06:58,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:06:58,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:06:58,791 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:06:58,793 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-01-09 18:07:00,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29232b205/afb026304f3243179090ac9418026931/FLAG6776eade0 [2025-01-09 18:07:00,451 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:07:00,451 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-01-09 18:07:00,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29232b205/afb026304f3243179090ac9418026931/FLAG6776eade0 [2025-01-09 18:07:00,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29232b205/afb026304f3243179090ac9418026931 [2025-01-09 18:07:00,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:07:00,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:07:00,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:07:00,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:07:00,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:07:00,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:07:00" (1/1) ... [2025-01-09 18:07:00,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@514ee6d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:00, skipping insertion in model container [2025-01-09 18:07:00,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:07:00" (1/1) ... [2025-01-09 18:07:00,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:07:01,741 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-01-09 18:07:01,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:07:01,785 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:07:01,880 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-01-09 18:07:01,881 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-01-09 18:07:01,882 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-01-09 18:07:01,882 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-01-09 18:07:01,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2025-01-09 18:07:01,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2025-01-09 18:07:01,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2025-01-09 18:07:01,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2025-01-09 18:07:01,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] [2025-01-09 18:07:01,901 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-01-09 18:07:01,901 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-01-09 18:07:01,902 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-01-09 18:07:01,902 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-01-09 18:07:01,902 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-01-09 18:07:01,902 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-01-09 18:07:01,905 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-01-09 18:07:01,905 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-01-09 18:07:01,905 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-01-09 18:07:01,906 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-01-09 18:07:01,906 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-01-09 18:07:01,906 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-01-09 18:07:01,906 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-01-09 18:07:01,906 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-01-09 18:07:01,906 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-01-09 18:07:01,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] [2025-01-09 18:07:01,908 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-01-09 18:07:01,908 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-01-09 18:07:01,908 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-01-09 18:07:01,908 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-01-09 18:07:01,909 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-01-09 18:07:01,910 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-01-09 18:07:01,910 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-01-09 18:07:01,910 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-01-09 18:07:01,910 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-01-09 18:07:01,911 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-01-09 18:07:01,911 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-01-09 18:07:01,911 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-01-09 18:07:01,912 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-01-09 18:07:01,912 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-01-09 18:07:01,912 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-01-09 18:07:01,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] [2025-01-09 18:07:01,916 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-01-09 18:07:01,919 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-01-09 18:07:01,919 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-01-09 18:07:01,920 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-01-09 18:07:01,920 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-01-09 18:07:01,920 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-01-09 18:07:01,920 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-01-09 18:07:01,920 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-01-09 18:07:01,921 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-01-09 18:07:01,921 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-01-09 18:07:01,921 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-01-09 18:07:01,988 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-01-09 18:07:01,989 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-01-09 18:07:01,989 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-01-09 18:07:01,989 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-01-09 18:07:01,990 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-01-09 18:07:01,990 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-01-09 18:07:01,990 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-01-09 18:07:01,991 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-01-09 18:07:01,991 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-01-09 18:07:01,992 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-01-09 18:07:01,992 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-01-09 18:07:01,993 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-01-09 18:07:01,993 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-01-09 18:07:01,993 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-01-09 18:07:01,993 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-01-09 18:07:01,994 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-01-09 18:07:01,996 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-01-09 18:07:01,996 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-01-09 18:07:01,996 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-01-09 18:07:01,996 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-01-09 18:07:01,996 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-01-09 18:07:01,997 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-01-09 18:07:01,997 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-01-09 18:07:01,997 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-01-09 18:07:01,997 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-01-09 18:07:01,999 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-01-09 18:07:01,999 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-01-09 18:07:01,999 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-01-09 18:07:01,999 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-01-09 18:07:02,000 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-01-09 18:07:02,025 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-01-09 18:07:02,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:07:02,118 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:07:02,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02 WrapperNode [2025-01-09 18:07:02,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:07:02,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:07:02,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:07:02,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:07:02,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,278 INFO L138 Inliner]: procedures = 156, calls = 821, calls flagged for inlining = 81, calls inlined = 80, statements flattened = 3006 [2025-01-09 18:07:02,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:07:02,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:07:02,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:07:02,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:07:02,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,604 INFO L175 MemorySlicer]: Split 418 memory accesses to 11 slices as follows [334, 2, 12, 2, 1, 4, 36, 1, 1, 22, 3]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [5, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0]. The 177 writes are split as follows [105, 0, 12, 0, 0, 1, 36, 1, 0, 22, 0]. [2025-01-09 18:07:02,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:07:02,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:07:02,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:07:02,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:07:02,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (1/1) ... [2025-01-09 18:07:02,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:07:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:07:02,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:07:02,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:07:02,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:07:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:07:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:07:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:07:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:07:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:07:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-01-09 18:07:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:07:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:07:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:07:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:07:02,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:07:02,856 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-01-09 18:07:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-01-09 18:07:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-01-09 18:07:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-01-09 18:07:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:07:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-01-09 18:07:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-01-09 18:07:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-01-09 18:07:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-01-09 18:07:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:07:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-01-09 18:07:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-01-09 18:07:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-01-09 18:07:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-01-09 18:07:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-01-09 18:07:02,861 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:07:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 18:07:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:07:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-01-09 18:07:02,863 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-01-09 18:07:02,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-01-09 18:07:02,863 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-01-09 18:07:02,863 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:07:02,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:07:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:07:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:07:02,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:07:02,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:07:02,866 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-01-09 18:07:02,866 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-01-09 18:07:02,866 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-01-09 18:07:02,866 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-01-09 18:07:03,288 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:07:03,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:07:09,480 INFO L? ?]: Removed 1462 outVars from TransFormulas that were not future-live. [2025-01-09 18:07:09,480 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:07:09,498 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:07:09,499 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:07:09,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:09 BoogieIcfgContainer [2025-01-09 18:07:09,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:07:09,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:07:09,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:07:09,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:07:09,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:07:00" (1/3) ... [2025-01-09 18:07:09,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5d4580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:09, skipping insertion in model container [2025-01-09 18:07:09,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:07:02" (2/3) ... [2025-01-09 18:07:09,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5d4580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:07:09, skipping insertion in model container [2025-01-09 18:07:09,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:09" (3/3) ... [2025-01-09 18:07:09,505 INFO L128 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2025-01-09 18:07:09,514 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:07:09,516 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-01-09 18:07:09,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:07:09,601 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;@624b1ba9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:07:09,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:07:09,608 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-01-09 18:07:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 18:07:09,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:09,618 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-01-09 18:07:09,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:09,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash -435619044, now seen corresponding path program 1 times [2025-01-09 18:07:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083483469] [2025-01-09 18:07:09,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:09,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 18:07:10,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 18:07:10,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:10,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083483469] [2025-01-09 18:07:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083483469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:10,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:10,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112966784] [2025-01-09 18:07:10,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:10,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:10,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:10,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:10,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:10,397 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-01-09 18:07:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:10,583 INFO L93 Difference]: Finished difference Result 2114 states and 3164 transitions. [2025-01-09 18:07:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:10,589 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-01-09 18:07:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:10,611 INFO L225 Difference]: With dead ends: 2114 [2025-01-09 18:07:10,612 INFO L226 Difference]: Without dead ends: 1016 [2025-01-09 18:07:10,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:10,624 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1565 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:10,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 1560 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-01-09 18:07:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-01-09 18:07:10,702 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-01-09 18:07:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1504 transitions. [2025-01-09 18:07:10,721 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1504 transitions. Word has length 77 [2025-01-09 18:07:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:10,723 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1504 transitions. [2025-01-09 18:07:10,724 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-01-09 18:07:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1504 transitions. [2025-01-09 18:07:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 18:07:10,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:10,727 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-01-09 18:07:10,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:07:10,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:10,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash 125080734, now seen corresponding path program 1 times [2025-01-09 18:07:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:10,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396004246] [2025-01-09 18:07:10,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:10,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:10,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 18:07:11,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 18:07:11,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:11,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396004246] [2025-01-09 18:07:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396004246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:11,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041628038] [2025-01-09 18:07:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:11,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:11,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:11,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:11,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:11,269 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-01-09 18:07:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:11,346 INFO L93 Difference]: Finished difference Result 1020 states and 1508 transitions. [2025-01-09 18:07:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:11,347 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-01-09 18:07:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:11,352 INFO L225 Difference]: With dead ends: 1020 [2025-01-09 18:07:11,352 INFO L226 Difference]: Without dead ends: 1018 [2025-01-09 18:07:11,352 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-01-09 18:07:11,353 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4499 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:11,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4499 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-01-09 18:07:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-01-09 18:07:11,378 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-01-09 18:07:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1506 transitions. [2025-01-09 18:07:11,383 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1506 transitions. Word has length 77 [2025-01-09 18:07:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:11,383 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1506 transitions. [2025-01-09 18:07:11,384 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-01-09 18:07:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1506 transitions. [2025-01-09 18:07:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 18:07:11,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:11,386 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-01-09 18:07:11,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:07:11,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2090450252, now seen corresponding path program 1 times [2025-01-09 18:07:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:11,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237142355] [2025-01-09 18:07:11,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:11,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 18:07:11,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 18:07:11,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:11,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:11,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:11,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237142355] [2025-01-09 18:07:11,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237142355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:11,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:11,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624972605] [2025-01-09 18:07:11,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:11,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:11,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:11,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:11,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:11,901 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-01-09 18:07:15,911 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-01-09 18:07:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:16,556 INFO L93 Difference]: Finished difference Result 2016 states and 2986 transitions. [2025-01-09 18:07:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:16,556 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-01-09 18:07:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:16,561 INFO L225 Difference]: With dead ends: 2016 [2025-01-09 18:07:16,561 INFO L226 Difference]: Without dead ends: 1029 [2025-01-09 18:07:16,563 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-01-09 18:07:16,564 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 1487 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:16,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 2536 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 18:07:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-01-09 18:07:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1019. [2025-01-09 18:07:16,586 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-01-09 18:07:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1507 transitions. [2025-01-09 18:07:16,591 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1507 transitions. Word has length 87 [2025-01-09 18:07:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:16,591 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1507 transitions. [2025-01-09 18:07:16,591 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-01-09 18:07:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1507 transitions. [2025-01-09 18:07:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 18:07:16,593 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:16,593 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-01-09 18:07:16,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:07:16,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -203642219, now seen corresponding path program 1 times [2025-01-09 18:07:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962497526] [2025-01-09 18:07:16,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:16,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:16,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 18:07:16,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 18:07:16,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:16,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 18:07:17,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:17,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962497526] [2025-01-09 18:07:17,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962497526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:07:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002550276] [2025-01-09 18:07:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:17,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:07:17,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:17,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:07:17,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:07:17,011 INFO L87 Difference]: Start difference. First operand 1019 states and 1507 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-01-09 18:07:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:17,078 INFO L93 Difference]: Finished difference Result 1036 states and 1530 transitions. [2025-01-09 18:07:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:07:17,078 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-01-09 18:07:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:17,086 INFO L225 Difference]: With dead ends: 1036 [2025-01-09 18:07:17,086 INFO L226 Difference]: Without dead ends: 1034 [2025-01-09 18:07:17,086 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-01-09 18:07:17,087 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 120 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 5853 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:17,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 5853 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-01-09 18:07:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1021. [2025-01-09 18:07:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 750 states have (on average 1.4133333333333333) internal successors, (1060), 784 states have internal predecessors, (1060), 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-01-09 18:07:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1510 transitions. [2025-01-09 18:07:17,117 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1510 transitions. Word has length 89 [2025-01-09 18:07:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:17,117 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1510 transitions. [2025-01-09 18:07:17,117 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-01-09 18:07:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1510 transitions. [2025-01-09 18:07:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 18:07:17,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:17,121 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-01-09 18:07:17,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:07:17,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:17,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1220669769, now seen corresponding path program 1 times [2025-01-09 18:07:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:17,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907052250] [2025-01-09 18:07:17,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:17,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 18:07:17,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 18:07:17,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:17,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 18:07:17,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:17,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907052250] [2025-01-09 18:07:17,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907052250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:17,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:17,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:17,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108505496] [2025-01-09 18:07:17,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:17,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:17,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:17,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:17,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:17,433 INFO L87 Difference]: Start difference. First operand 1021 states and 1510 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-01-09 18:07:21,442 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-01-09 18:07:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:21,560 INFO L93 Difference]: Finished difference Result 2974 states and 4404 transitions. [2025-01-09 18:07:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:21,561 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-01-09 18:07:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:21,568 INFO L225 Difference]: With dead ends: 2974 [2025-01-09 18:07:21,568 INFO L226 Difference]: Without dead ends: 1984 [2025-01-09 18:07:21,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:21,571 INFO L435 NwaCegarLoop]: 1756 mSDtfsCounter, 1438 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:21,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 3193 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:07:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2025-01-09 18:07:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1982. [2025-01-09 18:07:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1457 states have (on average 1.4172958133150309) internal successors, (2065), 1524 states have internal predecessors, (2065), 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-01-09 18:07:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2935 transitions. [2025-01-09 18:07:21,657 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2935 transitions. Word has length 121 [2025-01-09 18:07:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:21,657 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2935 transitions. [2025-01-09 18:07:21,657 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-01-09 18:07:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2935 transitions. [2025-01-09 18:07:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 18:07:21,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:21,664 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-01-09 18:07:21,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:07:21,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:21,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash 892087083, now seen corresponding path program 1 times [2025-01-09 18:07:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639708363] [2025-01-09 18:07:21,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:21,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 18:07:21,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 18:07:21,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:21,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 18:07:21,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:21,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639708363] [2025-01-09 18:07:21,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639708363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:21,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331125118] [2025-01-09 18:07:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:21,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:21,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:21,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:21,991 INFO L87 Difference]: Start difference. First operand 1982 states and 2935 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-01-09 18:07:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:22,061 INFO L93 Difference]: Finished difference Result 2995 states and 4422 transitions. [2025-01-09 18:07:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:22,062 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-01-09 18:07:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:22,067 INFO L225 Difference]: With dead ends: 2995 [2025-01-09 18:07:22,067 INFO L226 Difference]: Without dead ends: 1042 [2025-01-09 18:07:22,070 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-01-09 18:07:22,070 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 0 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4502 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:22,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4502 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-01-09 18:07:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2025-01-09 18:07:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 765 states have (on average 1.4039215686274509) internal successors, (1074), 799 states have internal predecessors, (1074), 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-01-09 18:07:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1526 transitions. [2025-01-09 18:07:22,109 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1526 transitions. Word has length 123 [2025-01-09 18:07:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:22,109 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1526 transitions. [2025-01-09 18:07:22,110 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-01-09 18:07:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1526 transitions. [2025-01-09 18:07:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 18:07:22,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:22,113 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-01-09 18:07:22,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:07:22,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:22,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:22,114 INFO L85 PathProgramCache]: Analyzing trace with hash 658349635, now seen corresponding path program 1 times [2025-01-09 18:07:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:22,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604861354] [2025-01-09 18:07:22,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:22,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:22,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 18:07:22,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 18:07:22,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:22,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 18:07:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604861354] [2025-01-09 18:07:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604861354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:22,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:22,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148286133] [2025-01-09 18:07:22,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:22,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:22,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:22,477 INFO L87 Difference]: Start difference. First operand 1042 states and 1526 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-01-09 18:07:26,489 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-01-09 18:07:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:27,193 INFO L93 Difference]: Finished difference Result 2059 states and 3033 transitions. [2025-01-09 18:07:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:27,193 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-01-09 18:07:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:27,201 INFO L225 Difference]: With dead ends: 2059 [2025-01-09 18:07:27,202 INFO L226 Difference]: Without dead ends: 1069 [2025-01-09 18:07:27,204 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-01-09 18:07:27,205 INFO L435 NwaCegarLoop]: 1486 mSDtfsCounter, 1498 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:27,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 2522 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 18:07:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-09 18:07:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1046. [2025-01-09 18:07:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 769 states have (on average 1.4031209362808843) internal successors, (1079), 803 states have internal predecessors, (1079), 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-01-09 18:07:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1531 transitions. [2025-01-09 18:07:27,245 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1531 transitions. Word has length 123 [2025-01-09 18:07:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:27,245 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1531 transitions. [2025-01-09 18:07:27,245 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-01-09 18:07:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1531 transitions. [2025-01-09 18:07:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 18:07:27,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:27,249 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-01-09 18:07:27,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:07:27,249 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:27,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1659160610, now seen corresponding path program 1 times [2025-01-09 18:07:27,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482959972] [2025-01-09 18:07:27,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:27,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 18:07:27,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 18:07:27,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:27,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 18:07:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482959972] [2025-01-09 18:07:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482959972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831502047] [2025-01-09 18:07:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:27,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:27,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:27,658 INFO L87 Difference]: Start difference. First operand 1046 states and 1531 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-01-09 18:07:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:27,705 INFO L93 Difference]: Finished difference Result 2040 states and 3010 transitions. [2025-01-09 18:07:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:27,706 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-01-09 18:07:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:27,710 INFO L225 Difference]: With dead ends: 2040 [2025-01-09 18:07:27,710 INFO L226 Difference]: Without dead ends: 1046 [2025-01-09 18:07:27,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:27,713 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 0 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:27,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2980 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-01-09 18:07:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-01-09 18:07:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 769 states have (on average 1.399219765929779) internal successors, (1076), 803 states have internal predecessors, (1076), 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-01-09 18:07:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1528 transitions. [2025-01-09 18:07:27,753 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1528 transitions. Word has length 126 [2025-01-09 18:07:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:27,754 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1528 transitions. [2025-01-09 18:07:27,754 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-01-09 18:07:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1528 transitions. [2025-01-09 18:07:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 18:07:27,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:27,757 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-01-09 18:07:27,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:07:27,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:27,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash 337306595, now seen corresponding path program 1 times [2025-01-09 18:07:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113028897] [2025-01-09 18:07:27,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:27,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 18:07:27,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 18:07:27,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:27,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 18:07:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:28,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113028897] [2025-01-09 18:07:28,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113028897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:28,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:28,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:07:28,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065788365] [2025-01-09 18:07:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:07:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:28,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:07:28,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:07:28,146 INFO L87 Difference]: Start difference. First operand 1046 states and 1528 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-01-09 18:07:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:28,194 INFO L93 Difference]: Finished difference Result 1050 states and 1532 transitions. [2025-01-09 18:07:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:07:28,196 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-01-09 18:07:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:28,200 INFO L225 Difference]: With dead ends: 1050 [2025-01-09 18:07:28,200 INFO L226 Difference]: Without dead ends: 1048 [2025-01-09 18:07:28,201 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-01-09 18:07:28,201 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 0 mSDsluCounter, 2982 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:28,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4478 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-01-09 18:07:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1046. [2025-01-09 18:07:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 769 states have (on average 1.399219765929779) internal successors, (1076), 803 states have internal predecessors, (1076), 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-01-09 18:07:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1528 transitions. [2025-01-09 18:07:28,240 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1528 transitions. Word has length 129 [2025-01-09 18:07:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:28,241 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1528 transitions. [2025-01-09 18:07:28,241 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-01-09 18:07:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1528 transitions. [2025-01-09 18:07:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 18:07:28,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:28,245 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-01-09 18:07:28,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:07:28,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:28,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:28,248 INFO L85 PathProgramCache]: Analyzing trace with hash -478664874, now seen corresponding path program 1 times [2025-01-09 18:07:28,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:28,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712262046] [2025-01-09 18:07:28,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:28,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:28,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 18:07:28,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 18:07:28,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:28,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:07:28,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712262046] [2025-01-09 18:07:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712262046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:07:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251105479] [2025-01-09 18:07:28,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:28,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:07:28,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:07:28,655 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-01-09 18:07:28,658 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-01-09 18:07:29,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 18:07:29,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 18:07:29,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:29,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:29,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:07:29,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:07:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 18:07:29,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:07:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 18:07:30,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251105479] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:07:30,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:07:30,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-01-09 18:07:30,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678951055] [2025-01-09 18:07:30,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:07:30,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 18:07:30,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:30,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 18:07:30,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:07:30,013 INFO L87 Difference]: Start difference. First operand 1046 states and 1528 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-01-09 18:07:34,022 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-01-09 18:07:38,039 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-01-09 18:07:42,054 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-01-09 18:07:46,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-01-09 18:07:50,068 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-01-09 18:07:54,086 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-01-09 18:07:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:56,479 INFO L93 Difference]: Finished difference Result 2120 states and 3117 transitions. [2025-01-09 18:07:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 18:07:56,480 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-01-09 18:07:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:56,486 INFO L225 Difference]: With dead ends: 2120 [2025-01-09 18:07:56,486 INFO L226 Difference]: Without dead ends: 1126 [2025-01-09 18:07:56,488 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-01-09 18:07:56,489 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 2647 mSDsluCounter, 3122 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 495 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:56,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 4616 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1435 Invalid, 6 Unknown, 0 Unchecked, 26.3s Time] [2025-01-09 18:07:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-01-09 18:07:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1053. [2025-01-09 18:07:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 776 states have (on average 1.3981958762886597) internal successors, (1085), 810 states have internal predecessors, (1085), 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-01-09 18:07:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1537 transitions. [2025-01-09 18:07:56,527 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1537 transitions. Word has length 168 [2025-01-09 18:07:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:56,527 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1537 transitions. [2025-01-09 18:07:56,527 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-01-09 18:07:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1537 transitions. [2025-01-09 18:07:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 18:07:56,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:56,531 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:07:56,546 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-01-09 18:07:56,736 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,SelfDestructingSolverStorable9 [2025-01-09 18:07:56,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:56,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash 428208698, now seen corresponding path program 1 times [2025-01-09 18:07:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381074482] [2025-01-09 18:07:56,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:56,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 18:07:57,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 18:07:57,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:57,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 18:07:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381074482] [2025-01-09 18:07:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381074482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:57,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:57,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 18:07:57,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960254298] [2025-01-09 18:07:57,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:57,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 18:07:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:57,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 18:07:57,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:07:57,391 INFO L87 Difference]: Start difference. First operand 1053 states and 1537 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:07:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:57,504 INFO L93 Difference]: Finished difference Result 1070 states and 1561 transitions. [2025-01-09 18:07:57,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 18:07:57,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-01-09 18:07:57,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:57,509 INFO L225 Difference]: With dead ends: 1070 [2025-01-09 18:07:57,509 INFO L226 Difference]: Without dead ends: 1068 [2025-01-09 18:07:57,510 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-01-09 18:07:57,510 INFO L435 NwaCegarLoop]: 1488 mSDtfsCounter, 121 mSDsluCounter, 10259 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 11747 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:57,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 11747 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-01-09 18:07:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1055. [2025-01-09 18:07:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 777 states have (on average 1.3976833976833978) internal successors, (1086), 811 states have internal predecessors, (1086), 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-01-09 18:07:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1540 transitions. [2025-01-09 18:07:57,547 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1540 transitions. Word has length 178 [2025-01-09 18:07:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:57,547 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1540 transitions. [2025-01-09 18:07:57,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:07:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1540 transitions. [2025-01-09 18:07:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 18:07:57,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:57,552 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 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] [2025-01-09 18:07:57,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:07:57,552 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:57,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash -404756383, now seen corresponding path program 1 times [2025-01-09 18:07:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:57,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327134667] [2025-01-09 18:07:57,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:57,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 18:07:57,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 18:07:57,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:57,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 18:07:57,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:57,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327134667] [2025-01-09 18:07:57,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327134667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:57,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:57,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378535263] [2025-01-09 18:07:57,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:57,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:57,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:57,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:57,994 INFO L87 Difference]: Start difference. First operand 1055 states and 1540 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:07:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:58,041 INFO L93 Difference]: Finished difference Result 2058 states and 3022 transitions. [2025-01-09 18:07:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:58,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 220 [2025-01-09 18:07:58,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:58,047 INFO L225 Difference]: With dead ends: 2058 [2025-01-09 18:07:58,047 INFO L226 Difference]: Without dead ends: 1055 [2025-01-09 18:07:58,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:58,051 INFO L435 NwaCegarLoop]: 1490 mSDtfsCounter, 0 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:58,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2974 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-01-09 18:07:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2025-01-09 18:07:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 777 states have (on average 1.393822393822394) internal successors, (1083), 811 states have internal predecessors, (1083), 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-01-09 18:07:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1537 transitions. [2025-01-09 18:07:58,093 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1537 transitions. Word has length 220 [2025-01-09 18:07:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:58,093 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1537 transitions. [2025-01-09 18:07:58,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:07:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1537 transitions. [2025-01-09 18:07:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 18:07:58,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:58,099 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 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, 1] [2025-01-09 18:07:58,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:07:58,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1923946514, now seen corresponding path program 1 times [2025-01-09 18:07:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558953351] [2025-01-09 18:07:58,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:58,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 18:07:58,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 18:07:58,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:58,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 18:07:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558953351] [2025-01-09 18:07:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558953351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152019442] [2025-01-09 18:07:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:58,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:58,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:58,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:58,634 INFO L87 Difference]: Start difference. First operand 1055 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:07:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:58,696 INFO L93 Difference]: Finished difference Result 2058 states and 3016 transitions. [2025-01-09 18:07:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:58,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 223 [2025-01-09 18:07:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:58,709 INFO L225 Difference]: With dead ends: 2058 [2025-01-09 18:07:58,716 INFO L226 Difference]: Without dead ends: 1055 [2025-01-09 18:07:58,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:58,725 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 0 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:58,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2968 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-01-09 18:07:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2025-01-09 18:07:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 777 states have (on average 1.38996138996139) internal successors, (1080), 811 states have internal predecessors, (1080), 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-01-09 18:07:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1534 transitions. [2025-01-09 18:07:58,865 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1534 transitions. Word has length 223 [2025-01-09 18:07:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:58,869 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1534 transitions. [2025-01-09 18:07:58,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:07:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1534 transitions. [2025-01-09 18:07:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 18:07:58,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:58,884 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 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, 1, 1, 1, 1] [2025-01-09 18:07:58,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:07:58,884 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:58,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash 31761306, now seen corresponding path program 1 times [2025-01-09 18:07:58,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:58,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786122004] [2025-01-09 18:07:58,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:58,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:59,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 18:07:59,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 18:07:59,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:59,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 18:07:59,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:59,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786122004] [2025-01-09 18:07:59,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786122004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:59,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:59,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717488150] [2025-01-09 18:07:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:59,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:59,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:59,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:59,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:59,351 INFO L87 Difference]: Start difference. First operand 1055 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:07:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:59,396 INFO L93 Difference]: Finished difference Result 2058 states and 3010 transitions. [2025-01-09 18:07:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:59,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 226 [2025-01-09 18:07:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:59,405 INFO L225 Difference]: With dead ends: 2058 [2025-01-09 18:07:59,405 INFO L226 Difference]: Without dead ends: 1055 [2025-01-09 18:07:59,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:59,409 INFO L435 NwaCegarLoop]: 1484 mSDtfsCounter, 0 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2962 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:59,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2962 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-01-09 18:07:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2025-01-09 18:07:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 777 states have (on average 1.386100386100386) internal successors, (1077), 811 states have internal predecessors, (1077), 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-01-09 18:07:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1531 transitions. [2025-01-09 18:07:59,457 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1531 transitions. Word has length 226 [2025-01-09 18:07:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:59,458 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1531 transitions. [2025-01-09 18:07:59,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:07:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1531 transitions. [2025-01-09 18:07:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 18:07:59,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:59,467 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:07:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:07:59,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:59,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1012856021, now seen corresponding path program 1 times [2025-01-09 18:07:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211379257] [2025-01-09 18:07:59,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:07:59,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 18:07:59,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 18:07:59,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:07:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:07:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 18:07:59,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:07:59,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211379257] [2025-01-09 18:07:59,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211379257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:07:59,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:07:59,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:07:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383621176] [2025-01-09 18:07:59,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:07:59,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:07:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:07:59,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:07:59,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:59,874 INFO L87 Difference]: Start difference. First operand 1055 states and 1531 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:07:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:07:59,919 INFO L93 Difference]: Finished difference Result 2058 states and 3004 transitions. [2025-01-09 18:07:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:07:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 229 [2025-01-09 18:07:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:07:59,930 INFO L225 Difference]: With dead ends: 2058 [2025-01-09 18:07:59,932 INFO L226 Difference]: Without dead ends: 1055 [2025-01-09 18:07:59,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:07:59,936 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 0 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:07:59,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2956 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:07:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-01-09 18:07:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2025-01-09 18:07:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 777 states have (on average 1.3822393822393821) internal successors, (1074), 811 states have internal predecessors, (1074), 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-01-09 18:07:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1528 transitions. [2025-01-09 18:07:59,981 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1528 transitions. Word has length 229 [2025-01-09 18:07:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:07:59,982 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1528 transitions. [2025-01-09 18:07:59,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:07:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1528 transitions. [2025-01-09 18:07:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 18:07:59,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:07:59,989 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:07:59,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:07:59,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:07:59,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:07:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1881233747, now seen corresponding path program 1 times [2025-01-09 18:07:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:07:59,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70603232] [2025-01-09 18:07:59,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:07:59,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:08:00,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 18:08:00,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 18:08:00,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:08:00,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:08:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-01-09 18:08:00,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:08:00,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70603232] [2025-01-09 18:08:00,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70603232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:08:00,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:08:00,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 18:08:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264226513] [2025-01-09 18:08:00,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:08:00,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 18:08:00,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:08:00,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 18:08:00,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:08:00,789 INFO L87 Difference]: Start difference. First operand 1055 states and 1528 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:08:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:08:00,907 INFO L93 Difference]: Finished difference Result 1068 states and 1547 transitions. [2025-01-09 18:08:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 18:08:00,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 232 [2025-01-09 18:08:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:08:00,910 INFO L225 Difference]: With dead ends: 1068 [2025-01-09 18:08:00,911 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 18:08:00,913 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-01-09 18:08:00,914 INFO L435 NwaCegarLoop]: 1477 mSDtfsCounter, 121 mSDsluCounter, 10179 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 11656 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:08:00,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 11656 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:08:00,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 18:08:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 18:08:00,916 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-01-09 18:08:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 18:08:00,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2025-01-09 18:08:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:08:00,918 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 18:08:00,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 18:08:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 18:08:00,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 18:08:00,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 18:08:00,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 18:08:00,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:08:00,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 18:08:04,878 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 18:08:04,893 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,893 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,897 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,898 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,898 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,898 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,898 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,898 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,899 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,900 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,900 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,900 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,900 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~err~2 [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,901 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,902 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset [2025-01-09 18:08:04,902 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base [2025-01-09 18:08:04,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:08:04 BoogieIcfgContainer [2025-01-09 18:08:04,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 18:08:04,903 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 18:08:04,903 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 18:08:04,903 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 18:08:04,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:07:09" (3/4) ... [2025-01-09 18:08:04,908 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#10 [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#7 [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#6 [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#9 [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure consume_skb [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#8 [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure slip_close [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __xchg_wrong_size [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_running [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_tx_start_queue [2025-01-09 18:08:04,916 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure del_timer_sync [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure add_timer [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure slhc_free [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure get_current [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure mod_timer [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure sl_ioctl [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure constant_test_bit [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tty_hangup [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive_int [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure rtnl_unlock [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_queue_stopped [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure init_timer_key [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tty_devnum [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure sl_free_bufs [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure might_fault [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_lock [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_return_value [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_alloc_skb [2025-01-09 18:08:04,917 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure clear_bit [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_priv [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure netdev_get_tx_queue [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure set_bit [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_unlock [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_unlock_bh [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure netif_stop_queue [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#1 [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure del_timer [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#0 [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure test_and_clear_bit [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#3 [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#2 [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure unregister_netdev [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#5 [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#4 [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure sl_bump [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure sl_unlock [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure slip_ioctl [2025-01-09 18:08:04,918 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_lock_bh [2025-01-09 18:08:04,956 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 221 nodes and edges [2025-01-09 18:08:04,961 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2025-01-09 18:08:04,966 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 18:08:04,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 18:08:04,975 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 18:08:04,983 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 18:08:05,238 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 18:08:05,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 18:08:05,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 18:08:05,240 INFO L158 Benchmark]: Toolchain (without parser) took 64605.90ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.7MB in the beginning and 172.4MB in the end (delta: -48.8MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2025-01-09 18:08:05,240 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 209.7MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 18:08:05,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1485.99ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 111.4MB in the end (delta: 12.3MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. [2025-01-09 18:08:05,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 158.24ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 94.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 18:08:05,241 INFO L158 Benchmark]: Boogie Preprocessor took 515.04ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 93.9MB in the end (delta: 689.8kB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2025-01-09 18:08:05,241 INFO L158 Benchmark]: RCFGBuilder took 6703.48ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 93.9MB in the beginning and 196.7MB in the end (delta: -102.8MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. [2025-01-09 18:08:05,241 INFO L158 Benchmark]: TraceAbstraction took 55402.04ms. Allocated memory is still 335.5MB. Free memory was 194.7MB in the beginning and 218.3MB in the end (delta: -23.5MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. [2025-01-09 18:08:05,241 INFO L158 Benchmark]: Witness Printer took 336.07ms. Allocated memory is still 335.5MB. Free memory was 218.3MB in the beginning and 172.4MB in the end (delta: 45.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 18:08:05,242 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.26ms. Allocated memory is still 209.7MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1485.99ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 111.4MB in the end (delta: 12.3MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 158.24ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 94.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 515.04ms. Allocated memory is still 167.8MB. Free memory was 94.6MB in the beginning and 93.9MB in the end (delta: 689.8kB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * RCFGBuilder took 6703.48ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 93.9MB in the beginning and 196.7MB in the end (delta: -102.8MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB. * TraceAbstraction took 55402.04ms. Allocated memory is still 335.5MB. Free memory was 194.7MB in the beginning and 218.3MB in the end (delta: -23.5MB). Peak memory consumption was 182.1MB. Max. memory is 16.1GB. * Witness Printer took 336.07ms. Allocated memory is still 335.5MB. Free memory was 218.3MB in the beginning and 172.4MB in the end (delta: 45.8MB). Peak memory consumption was 41.9MB. 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: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~slip_devs~0!base - 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: 51.4s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 41.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 9103 SdHoareTripleChecker+Valid, 39.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8997 mSDsluCounter, 72002 SdHoareTripleChecker+Invalid, 39.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47808 mSDsCounter, 538 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2688 IncrementalHoareTripleChecker+Invalid, 3235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 538 mSolverCounterUnsat, 24194 mSDtfsCounter, 2688 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1982occurred in iteration=5, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 136 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2746 ConstructedInterpolants, 0 QuantifiedInterpolants, 3741 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1417 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 807/810 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: 6211]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 5340]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 5661]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 6877]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 7081]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 6846]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 6648]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 5376]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 5271]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 5215]: Location Invariant Derived location invariant: ((((long) err + 17) <= 0) && (256 <= slip_maxdev)) - InvariantResult [Line: 5500]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 6009]: Loop Invariant Derived loop invariant: ((((long) i + 1) <= slip_maxdev) && (256 <= slip_maxdev)) - InvariantResult [Line: 5294]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 6043]: Location Invariant Derived location invariant: ((err <= 0) && (256 <= slip_maxdev)) - InvariantResult [Line: 5317]: Location Invariant Derived location invariant: (256 <= slip_maxdev) - InvariantResult [Line: 6103]: Location Invariant Derived location invariant: ((err <= 0) && (256 <= slip_maxdev)) RESULT: Ultimate proved your program to be correct! [2025-01-09 18:08:05,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE