./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.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-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0992725f389f0adb842356ba35094ebe66d38080cd0511ed76d42d3b12708c0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:37:47,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:37:47,305 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:37:47,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:37:47,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:37:47,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:37:47,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:37:47,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:37:47,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:37:47,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:37:47,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:37:47,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:37:47,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:37:47,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:37:47,326 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:37:47,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:37:47,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:37:47,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:37:47,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:37:47,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:37:47,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:37:47,329 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:37:47,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:37:47,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:37:47,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:37:47,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:37:47,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:37:47,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:37:47,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:37:47,329 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 -> 0992725f389f0adb842356ba35094ebe66d38080cd0511ed76d42d3b12708c0b [2025-01-09 18:37:47,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:37:47,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:37:47,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:37:47,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:37:47,539 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:37:47,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2025-01-09 18:37:48,760 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c22cc43f/0e0d521322654d4a9c9a6d7c31c6cd4a/FLAG384682e41 [2025-01-09 18:37:49,293 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:37:49,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2025-01-09 18:37:49,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c22cc43f/0e0d521322654d4a9c9a6d7c31c6cd4a/FLAG384682e41 [2025-01-09 18:37:49,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9c22cc43f/0e0d521322654d4a9c9a6d7c31c6cd4a [2025-01-09 18:37:49,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:37:49,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:37:49,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:37:49,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:37:49,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:37:49,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:37:49" (1/1) ... [2025-01-09 18:37:49,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639c91e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:49, skipping insertion in model container [2025-01-09 18:37:49,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:37:49" (1/1) ... [2025-01-09 18:37:49,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:37:50,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2025-01-09 18:37:50,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:37:50,711 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:37:50,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4690] [2025-01-09 18:37:50,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4697] [2025-01-09 18:37:50,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4705-4706] [2025-01-09 18:37:50,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4714-4715] [2025-01-09 18:37:50,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2025-01-09 18:37:50,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4838] [2025-01-09 18:37:50,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4841] [2025-01-09 18:37:50,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4844] [2025-01-09 18:37:50,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4847] [2025-01-09 18:37:50,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5229] [2025-01-09 18:37:50,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5233] [2025-01-09 18:37:50,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5237] [2025-01-09 18:37:50,855 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5241] [2025-01-09 18:37:50,857 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"); [5252] [2025-01-09 18:37:50,858 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"); [5256] [2025-01-09 18:37:50,858 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"); [5260] [2025-01-09 18:37:50,858 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"); [5264] [2025-01-09 18:37:50,859 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"); [5275] [2025-01-09 18:37:50,859 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"); [5279] [2025-01-09 18:37:50,859 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"); [5283] [2025-01-09 18:37:50,861 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"); [5287] [2025-01-09 18:37:50,861 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"); [5298] [2025-01-09 18:37:50,862 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"); [5302] [2025-01-09 18:37:50,862 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"); [5306] [2025-01-09 18:37:50,862 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"); [5310] [2025-01-09 18:37:50,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5360] [2025-01-09 18:37:50,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5364] [2025-01-09 18:37:50,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5368] [2025-01-09 18:37:50,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5372] [2025-01-09 18:37:50,865 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"); [5383] [2025-01-09 18:37:50,865 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"); [5387] [2025-01-09 18:37:50,865 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"); [5391] [2025-01-09 18:37:50,865 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"); [5395] [2025-01-09 18:37:50,866 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"); [5406] [2025-01-09 18:37:50,866 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"); [5410] [2025-01-09 18:37:50,866 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"); [5414] [2025-01-09 18:37:50,868 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"); [5418] [2025-01-09 18:37:50,868 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"); [5429] [2025-01-09 18:37:50,868 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"); [5433] [2025-01-09 18:37:50,868 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"); [5437] [2025-01-09 18:37:50,869 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"); [5441] [2025-01-09 18:37:50,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5515] [2025-01-09 18:37:50,872 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5519] [2025-01-09 18:37:50,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5523] [2025-01-09 18:37:50,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5527] [2025-01-09 18:37:50,873 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"); [5538] [2025-01-09 18:37:50,873 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"); [5542] [2025-01-09 18:37:50,873 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"); [5546] [2025-01-09 18:37:50,874 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"); [5550] [2025-01-09 18:37:50,874 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"); [5561] [2025-01-09 18:37:50,874 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"); [5565] [2025-01-09 18:37:50,875 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"); [5569] [2025-01-09 18:37:50,875 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"); [5573] [2025-01-09 18:37:50,928 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"); [6512] [2025-01-09 18:37:50,928 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"); [6515] [2025-01-09 18:37:50,928 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"); [6518] [2025-01-09 18:37:50,929 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"); [6521] [2025-01-09 18:37:50,929 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"); [6524] [2025-01-09 18:37:50,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6537] [2025-01-09 18:37:50,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6540] [2025-01-09 18:37:50,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6543] [2025-01-09 18:37:50,931 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6546] [2025-01-09 18:37:50,931 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6549] [2025-01-09 18:37:50,931 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)); [6571] [2025-01-09 18:37:50,931 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)); [6574] [2025-01-09 18:37:50,932 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)); [6577] [2025-01-09 18:37:50,932 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)); [6580] [2025-01-09 18:37:50,932 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)); [6583] [2025-01-09 18:37:50,934 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"); [6616-6617] [2025-01-09 18:37:50,934 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"); [6620-6621] [2025-01-09 18:37:50,934 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"); [6624-6625] [2025-01-09 18:37:50,935 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"); [6628-6629] [2025-01-09 18:37:50,935 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"); [6632-6633] [2025-01-09 18:37:50,936 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)); [6646] [2025-01-09 18:37:50,936 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)); [6649] [2025-01-09 18:37:50,936 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)); [6652] [2025-01-09 18:37:50,936 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)); [6655] [2025-01-09 18:37:50,936 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)); [6658] [2025-01-09 18:37:50,938 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"); [6691-6692] [2025-01-09 18:37:50,939 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"); [6695-6696] [2025-01-09 18:37:50,939 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"); [6699-6700] [2025-01-09 18:37:50,939 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"); [6703-6704] [2025-01-09 18:37:50,939 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"); [6707-6708] [2025-01-09 18:37:50,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:37:51,072 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:37:51,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51 WrapperNode [2025-01-09 18:37:51,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:37:51,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:37:51,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:37:51,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:37:51,078 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:37:51" (1/1) ... [2025-01-09 18:37:51,119 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:37:51" (1/1) ... [2025-01-09 18:37:51,227 INFO L138 Inliner]: procedures = 183, calls = 839, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3424 [2025-01-09 18:37:51,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:37:51,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:37:51,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:37:51,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:37:51,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,549 INFO L175 MemorySlicer]: Split 418 memory accesses to 9 slices as follows [2, 1, 3, 1, 347, 4, 36, 22, 2]. 83 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 0, 5, 0, 0, 0, 0]. The 180 writes are split as follows [0, 1, 0, 0, 120, 1, 36, 22, 0]. [2025-01-09 18:37:51,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:37:51,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:37:51,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:37:51,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:37:51,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (1/1) ... [2025-01-09 18:37:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:37:51,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:37:51,721 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:37:51,726 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:37:51,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2025-01-09 18:37:51,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2025-01-09 18:37:51,742 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2025-01-09 18:37:51,742 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2025-01-09 18:37:51,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:37:51,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:37:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:37:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:37:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:37:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:37:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:37:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:37:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:37:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2025-01-09 18:37:51,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2025-01-09 18:37:51,744 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2025-01-09 18:37:51,744 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2025-01-09 18:37:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:37:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:37:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:37:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:37:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:37:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:37:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:37:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:37:51,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:37:51,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:37:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:37:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:37:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:37:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:37:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-01-09 18:37:51,747 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-01-09 18:37:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-01-09 18:37:51,747 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-01-09 18:37:51,747 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2025-01-09 18:37:51,747 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:37:51,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:37:51,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:37:51,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:37:51,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:37:51,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:37:51,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:37:51,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:37:51,749 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:37:51,749 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:37:51,749 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:37:51,749 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:37:51,750 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2025-01-09 18:37:51,750 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-01-09 18:37:51,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2025-01-09 18:37:51,751 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2025-01-09 18:37:51,753 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2025-01-09 18:37:51,753 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-01-09 18:37:51,754 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-01-09 18:37:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 18:37:51,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:37:51,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2025-01-09 18:37:51,755 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2025-01-09 18:37:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-01-09 18:37:51,755 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-01-09 18:37:52,185 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:37:52,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:37:52,272 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:37:58,667 INFO L? ?]: Removed 1525 outVars from TransFormulas that were not future-live. [2025-01-09 18:37:58,667 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:37:58,698 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:37:58,702 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 18:37:58,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:37:58 BoogieIcfgContainer [2025-01-09 18:37:58,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:37:58,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:37:58,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:37:58,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:37:58,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:37:49" (1/3) ... [2025-01-09 18:37:58,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7c0004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:37:58, skipping insertion in model container [2025-01-09 18:37:58,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:37:51" (2/3) ... [2025-01-09 18:37:58,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7c0004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:37:58, skipping insertion in model container [2025-01-09 18:37:58,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:37:58" (3/3) ... [2025-01-09 18:37:58,713 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2025-01-09 18:37:58,722 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:37:58,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i that has 63 procedures, 1222 locations, 1 initial locations, 19 loop locations, and 1 error locations. [2025-01-09 18:37:58,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:37:58,809 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;@6dd9c752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:37:58,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:37:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 1181 states, 870 states have (on average 1.4252873563218391) internal successors, (1240), 914 states have internal predecessors, (1240), 256 states have call successors, (256), 54 states have call predecessors, (256), 53 states have return successors, (251), 249 states have call predecessors, (251), 251 states have call successors, (251) [2025-01-09 18:37:58,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 18:37:58,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:58,832 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:58,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:58,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash -364740091, now seen corresponding path program 1 times [2025-01-09 18:37:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:58,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137427064] [2025-01-09 18:37:58,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:37:59,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 18:37:59,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 18:37:59,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:37:59,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:37:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 18:37:59,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:37:59,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137427064] [2025-01-09 18:37:59,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137427064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:37:59,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:37:59,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:37:59,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614147966] [2025-01-09 18:37:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:37:59,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:37:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:37:59,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:37:59,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:37:59,588 INFO L87 Difference]: Start difference. First operand has 1181 states, 870 states have (on average 1.4252873563218391) internal successors, (1240), 914 states have internal predecessors, (1240), 256 states have call successors, (256), 54 states have call predecessors, (256), 53 states have return successors, (251), 249 states have call predecessors, (251), 251 states have call successors, (251) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 18:37:59,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:37:59,798 INFO L93 Difference]: Finished difference Result 3012 states and 4455 transitions. [2025-01-09 18:37:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:37:59,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2025-01-09 18:37:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:37:59,820 INFO L225 Difference]: With dead ends: 3012 [2025-01-09 18:37:59,822 INFO L226 Difference]: Without dead ends: 1743 [2025-01-09 18:37:59,829 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:37:59,831 INFO L435 NwaCegarLoop]: 1761 mSDtfsCounter, 944 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 3446 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:37:59,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 3446 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:37:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-01-09 18:37:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2025-01-09 18:37:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1274 states have (on average 1.3979591836734695) internal successors, (1781), 1325 states have internal predecessors, (1781), 376 states have call successors, (376), 93 states have call predecessors, (376), 92 states have return successors, (375), 372 states have call predecessors, (375), 375 states have call successors, (375) [2025-01-09 18:37:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2532 transitions. [2025-01-09 18:37:59,969 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2532 transitions. Word has length 63 [2025-01-09 18:37:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:37:59,971 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2532 transitions. [2025-01-09 18:37:59,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 18:37:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2532 transitions. [2025-01-09 18:37:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 18:37:59,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:37:59,982 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:37:59,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:37:59,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:37:59,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:37:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash -126066950, now seen corresponding path program 1 times [2025-01-09 18:37:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:37:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957574592] [2025-01-09 18:37:59,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:37:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:00,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 18:38:00,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 18:38:00,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:00,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 18:38:00,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:00,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957574592] [2025-01-09 18:38:00,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957574592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:00,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:00,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:38:00,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170602215] [2025-01-09 18:38:00,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:00,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:38:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:00,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:38:00,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:38:00,583 INFO L87 Difference]: Start difference. First operand 1743 states and 2532 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:38:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:00,694 INFO L93 Difference]: Finished difference Result 3462 states and 5032 transitions. [2025-01-09 18:38:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:38:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-01-09 18:38:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:00,705 INFO L225 Difference]: With dead ends: 3462 [2025-01-09 18:38:00,705 INFO L226 Difference]: Without dead ends: 1743 [2025-01-09 18:38:00,710 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:38:00,710 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 1646 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 1663 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:38:00,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 1663 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-01-09 18:38:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2025-01-09 18:38:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1274 states have (on average 1.3963893249607535) internal successors, (1779), 1325 states have internal predecessors, (1779), 376 states have call successors, (376), 93 states have call predecessors, (376), 92 states have return successors, (375), 372 states have call predecessors, (375), 375 states have call successors, (375) [2025-01-09 18:38:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2530 transitions. [2025-01-09 18:38:00,783 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2530 transitions. Word has length 122 [2025-01-09 18:38:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:00,784 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2530 transitions. [2025-01-09 18:38:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:38:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2530 transitions. [2025-01-09 18:38:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 18:38:00,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:00,795 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:00,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:38:00,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash -618693124, now seen corresponding path program 1 times [2025-01-09 18:38:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:00,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773091796] [2025-01-09 18:38:00,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:01,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 18:38:01,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 18:38:01,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:01,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 18:38:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773091796] [2025-01-09 18:38:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773091796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:01,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:01,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:38:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576544876] [2025-01-09 18:38:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:01,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:38:01,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:01,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:38:01,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:38:01,435 INFO L87 Difference]: Start difference. First operand 1743 states and 2530 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 18:38:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:01,507 INFO L93 Difference]: Finished difference Result 1748 states and 2535 transitions. [2025-01-09 18:38:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:38:01,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-01-09 18:38:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:01,518 INFO L225 Difference]: With dead ends: 1748 [2025-01-09 18:38:01,519 INFO L226 Difference]: Without dead ends: 1745 [2025-01-09 18:38:01,520 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:38:01,521 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 0 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5000 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:38:01,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5000 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-01-09 18:38:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745. [2025-01-09 18:38:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1276 states have (on average 1.39576802507837) internal successors, (1781), 1327 states have internal predecessors, (1781), 376 states have call successors, (376), 93 states have call predecessors, (376), 92 states have return successors, (375), 372 states have call predecessors, (375), 375 states have call successors, (375) [2025-01-09 18:38:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2532 transitions. [2025-01-09 18:38:01,587 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2532 transitions. Word has length 122 [2025-01-09 18:38:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:01,589 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2532 transitions. [2025-01-09 18:38:01,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 18:38:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2532 transitions. [2025-01-09 18:38:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 18:38:01,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:01,595 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:01,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:38:01,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:01,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash 595677352, now seen corresponding path program 1 times [2025-01-09 18:38:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:01,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578379763] [2025-01-09 18:38:01,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:01,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 18:38:01,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 18:38:01,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:01,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 18:38:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578379763] [2025-01-09 18:38:02,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578379763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:02,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:02,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:38:02,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284751719] [2025-01-09 18:38:02,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:02,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:38:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:02,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:38:02,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:38:02,023 INFO L87 Difference]: Start difference. First operand 1745 states and 2532 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 18:38:06,034 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:38:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:06,859 INFO L93 Difference]: Finished difference Result 3477 states and 5049 transitions. [2025-01-09 18:38:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:38:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2025-01-09 18:38:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:06,870 INFO L225 Difference]: With dead ends: 3477 [2025-01-09 18:38:06,870 INFO L226 Difference]: Without dead ends: 1756 [2025-01-09 18:38:06,875 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:38:06,877 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 1623 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:06,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 2835 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 505 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 18:38:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2025-01-09 18:38:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1746. [2025-01-09 18:38:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1746 states, 1277 states have (on average 1.3954581049334378) internal successors, (1782), 1328 states have internal predecessors, (1782), 376 states have call successors, (376), 93 states have call predecessors, (376), 92 states have return successors, (375), 372 states have call predecessors, (375), 375 states have call successors, (375) [2025-01-09 18:38:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1746 states and 2533 transitions. [2025-01-09 18:38:06,934 INFO L78 Accepts]: Start accepts. Automaton has 1746 states and 2533 transitions. Word has length 132 [2025-01-09 18:38:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:06,935 INFO L471 AbstractCegarLoop]: Abstraction has 1746 states and 2533 transitions. [2025-01-09 18:38:06,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 18:38:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1746 states and 2533 transitions. [2025-01-09 18:38:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 18:38:06,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:06,942 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:38:06,942 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 42575911, now seen corresponding path program 1 times [2025-01-09 18:38:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512509443] [2025-01-09 18:38:06,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:07,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 18:38:07,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 18:38:07,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:07,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 18:38:07,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:07,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512509443] [2025-01-09 18:38:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512509443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:07,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:07,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:38:07,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063711406] [2025-01-09 18:38:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:07,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:38:07,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:07,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:38:07,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:38:07,533 INFO L87 Difference]: Start difference. First operand 1746 states and 2533 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:38:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:07,602 INFO L93 Difference]: Finished difference Result 1764 states and 2557 transitions. [2025-01-09 18:38:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:38:07,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-01-09 18:38:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:07,610 INFO L225 Difference]: With dead ends: 1764 [2025-01-09 18:38:07,610 INFO L226 Difference]: Without dead ends: 1761 [2025-01-09 18:38:07,611 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:38:07,612 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 120 mSDsluCounter, 4850 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 6521 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:38:07,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 6521 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-01-09 18:38:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1748. [2025-01-09 18:38:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1278 states have (on average 1.3951486697965572) internal successors, (1783), 1328 states have internal predecessors, (1783), 377 states have call successors, (377), 93 states have call predecessors, (377), 92 states have return successors, (376), 373 states have call predecessors, (376), 376 states have call successors, (376) [2025-01-09 18:38:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2536 transitions. [2025-01-09 18:38:07,653 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2536 transitions. Word has length 134 [2025-01-09 18:38:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:07,654 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2536 transitions. [2025-01-09 18:38:07,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:38:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2536 transitions. [2025-01-09 18:38:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 18:38:07,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:07,660 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:07,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:38:07,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:07,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -610701901, now seen corresponding path program 1 times [2025-01-09 18:38:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:07,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061466769] [2025-01-09 18:38:07,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:07,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 18:38:07,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 18:38:07,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:07,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 18:38:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:08,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061466769] [2025-01-09 18:38:08,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061466769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:08,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:08,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:38:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183922094] [2025-01-09 18:38:08,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:08,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:38:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:08,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:38:08,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:38:08,008 INFO L87 Difference]: Start difference. First operand 1748 states and 2536 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 18:38:12,018 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:38:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:12,152 INFO L93 Difference]: Finished difference Result 5152 states and 7476 transitions. [2025-01-09 18:38:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:38:12,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 166 [2025-01-09 18:38:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:12,167 INFO L225 Difference]: With dead ends: 5152 [2025-01-09 18:38:12,167 INFO L226 Difference]: Without dead ends: 3428 [2025-01-09 18:38:12,173 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:38:12,173 INFO L435 NwaCegarLoop]: 2486 mSDtfsCounter, 1604 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 4101 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:12,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 4101 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:38:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2025-01-09 18:38:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 3421. [2025-01-09 18:38:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 2504 states have (on average 1.3977635782747604) internal successors, (3500), 2604 states have internal predecessors, (3500), 733 states have call successors, (733), 184 states have call predecessors, (733), 183 states have return successors, (732), 724 states have call predecessors, (732), 732 states have call successors, (732) [2025-01-09 18:38:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 4965 transitions. [2025-01-09 18:38:12,307 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 4965 transitions. Word has length 166 [2025-01-09 18:38:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:12,308 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 4965 transitions. [2025-01-09 18:38:12,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 18:38:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 4965 transitions. [2025-01-09 18:38:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 18:38:12,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:12,321 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 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] [2025-01-09 18:38:12,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:38:12,322 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:12,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1755384949, now seen corresponding path program 1 times [2025-01-09 18:38:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066415515] [2025-01-09 18:38:12,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:12,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 18:38:12,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 18:38:12,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:12,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-01-09 18:38:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066415515] [2025-01-09 18:38:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066415515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:38:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256097491] [2025-01-09 18:38:12,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:38:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:12,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:38:12,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:38:12,891 INFO L87 Difference]: Start difference. First operand 3421 states and 4965 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:38:16,900 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:38:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:17,057 INFO L93 Difference]: Finished difference Result 5740 states and 8305 transitions. [2025-01-09 18:38:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:38:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2025-01-09 18:38:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:17,069 INFO L225 Difference]: With dead ends: 5740 [2025-01-09 18:38:17,071 INFO L226 Difference]: Without dead ends: 2332 [2025-01-09 18:38:17,079 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:38:17,080 INFO L435 NwaCegarLoop]: 1670 mSDtfsCounter, 0 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:17,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5001 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:38:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2025-01-09 18:38:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2332. [2025-01-09 18:38:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 1695 states have (on average 1.3858407079646018) internal successors, (2349), 1761 states have internal predecessors, (2349), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-01-09 18:38:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3358 transitions. [2025-01-09 18:38:17,161 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3358 transitions. Word has length 168 [2025-01-09 18:38:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:17,162 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 3358 transitions. [2025-01-09 18:38:17,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:38:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3358 transitions. [2025-01-09 18:38:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 18:38:17,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:17,170 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:17,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:38:17,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:17,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash -755543239, now seen corresponding path program 1 times [2025-01-09 18:38:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:17,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523682156] [2025-01-09 18:38:17,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:17,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 18:38:17,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 18:38:17,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:17,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 18:38:17,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:17,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523682156] [2025-01-09 18:38:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523682156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:17,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:17,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:38:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564737189] [2025-01-09 18:38:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:17,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:38:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:17,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:38:17,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:38:17,606 INFO L87 Difference]: Start difference. First operand 2332 states and 3358 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 18:38:21,617 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:38:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:22,580 INFO L93 Difference]: Finished difference Result 4079 states and 5894 transitions. [2025-01-09 18:38:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:38:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 168 [2025-01-09 18:38:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:22,593 INFO L225 Difference]: With dead ends: 4079 [2025-01-09 18:38:22,594 INFO L226 Difference]: Without dead ends: 2359 [2025-01-09 18:38:22,599 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:38:22,601 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 1620 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:22,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 2827 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 518 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 18:38:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2025-01-09 18:38:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2336. [2025-01-09 18:38:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 1699 states have (on average 1.3855208946439082) internal successors, (2354), 1765 states have internal predecessors, (2354), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-01-09 18:38:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3363 transitions. [2025-01-09 18:38:22,700 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3363 transitions. Word has length 168 [2025-01-09 18:38:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:22,700 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3363 transitions. [2025-01-09 18:38:22,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 18:38:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3363 transitions. [2025-01-09 18:38:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 18:38:22,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:22,711 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:22,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:38:22,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash 493832980, now seen corresponding path program 1 times [2025-01-09 18:38:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228112137] [2025-01-09 18:38:22,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:22,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 18:38:22,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 18:38:22,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:22,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-09 18:38:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228112137] [2025-01-09 18:38:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228112137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:38:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571582637] [2025-01-09 18:38:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:23,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:38:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:23,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:38:23,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:38:23,096 INFO L87 Difference]: Start difference. First operand 2336 states and 3363 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:38:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:23,174 INFO L93 Difference]: Finished difference Result 4648 states and 6726 transitions. [2025-01-09 18:38:23,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:38:23,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 171 [2025-01-09 18:38:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:23,189 INFO L225 Difference]: With dead ends: 4648 [2025-01-09 18:38:23,190 INFO L226 Difference]: Without dead ends: 2336 [2025-01-09 18:38:23,196 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:38:23,197 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 0 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3314 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:38:23,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3314 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-01-09 18:38:23,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2025-01-09 18:38:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 1699 states have (on average 1.3802236609770453) internal successors, (2345), 1765 states have internal predecessors, (2345), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-01-09 18:38:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3354 transitions. [2025-01-09 18:38:23,286 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3354 transitions. Word has length 171 [2025-01-09 18:38:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:23,287 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 3354 transitions. [2025-01-09 18:38:23,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:38:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3354 transitions. [2025-01-09 18:38:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 18:38:23,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:23,298 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:23,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:38:23,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash 732293485, now seen corresponding path program 1 times [2025-01-09 18:38:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214983663] [2025-01-09 18:38:23,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:23,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 18:38:23,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 18:38:23,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:23,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 18:38:23,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:23,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214983663] [2025-01-09 18:38:23,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214983663] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:38:23,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855447193] [2025-01-09 18:38:23,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:23,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:38:23,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:38:23,737 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:38:23,738 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:38:24,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 18:38:24,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 18:38:24,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:24,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:24,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:38:24,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:38:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-09 18:38:24,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:38:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 18:38:24,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855447193] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:38:24,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:38:24,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2025-01-09 18:38:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621914794] [2025-01-09 18:38:24,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:38:24,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 18:38:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:24,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 18:38:24,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:38:24,901 INFO L87 Difference]: Start difference. First operand 2336 states and 3354 transitions. Second operand has 10 states, 10 states have (on average 19.6) internal successors, (196), 10 states have internal predecessors, (196), 4 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-01-09 18:38:28,913 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:38:32,920 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:38:36,926 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:38:40,936 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:38:44,944 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:38:48,956 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:38:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:50,535 INFO L93 Difference]: Finished difference Result 4140 states and 5969 transitions. [2025-01-09 18:38:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 18:38:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.6) internal successors, (196), 10 states have internal predecessors, (196), 4 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 174 [2025-01-09 18:38:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:50,567 INFO L225 Difference]: With dead ends: 4140 [2025-01-09 18:38:50,572 INFO L226 Difference]: Without dead ends: 2416 [2025-01-09 18:38:50,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 343 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:38:50,586 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 1726 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 51 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:50,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 4041 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1064 Invalid, 6 Unknown, 0 Unchecked, 25.4s Time] [2025-01-09 18:38:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-01-09 18:38:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2343. [2025-01-09 18:38:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1706 states have (on average 1.3798358733880423) internal successors, (2354), 1772 states have internal predecessors, (2354), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-01-09 18:38:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3363 transitions. [2025-01-09 18:38:50,789 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3363 transitions. Word has length 174 [2025-01-09 18:38:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:50,789 INFO L471 AbstractCegarLoop]: Abstraction has 2343 states and 3363 transitions. [2025-01-09 18:38:50,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.6) internal successors, (196), 10 states have internal predecessors, (196), 4 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2025-01-09 18:38:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3363 transitions. [2025-01-09 18:38:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 18:38:50,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:50,797 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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] [2025-01-09 18:38:50,810 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:38:51,002 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:38:51,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:51,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash -672038438, now seen corresponding path program 1 times [2025-01-09 18:38:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:51,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341861956] [2025-01-09 18:38:51,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:51,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:51,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 18:38:51,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 18:38:51,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:51,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-09 18:38:51,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341861956] [2025-01-09 18:38:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341861956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:38:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267087047] [2025-01-09 18:38:51,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:51,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:38:51,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:38:51,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:38:51,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:38:52,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 18:38:52,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 18:38:52,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:52,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:52,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 18:38:52,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:38:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 18:38:52,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:38:52,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267087047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:52,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:38:52,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 18:38:52,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477778259] [2025-01-09 18:38:52,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:52,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:38:52,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:52,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:38:52,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:38:52,840 INFO L87 Difference]: Start difference. First operand 2343 states and 3363 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:38:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:52,903 INFO L93 Difference]: Finished difference Result 4091 states and 5884 transitions. [2025-01-09 18:38:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:38:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 184 [2025-01-09 18:38:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:52,913 INFO L225 Difference]: With dead ends: 4091 [2025-01-09 18:38:52,913 INFO L226 Difference]: Without dead ends: 2343 [2025-01-09 18:38:52,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:38:52,917 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 2 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:52,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3317 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2025-01-09 18:38:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2025-01-09 18:38:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 1706 states have (on average 1.3780773739742087) internal successors, (2351), 1772 states have internal predecessors, (2351), 505 states have call successors, (505), 132 states have call predecessors, (505), 131 states have return successors, (504), 499 states have call predecessors, (504), 504 states have call successors, (504) [2025-01-09 18:38:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3360 transitions. [2025-01-09 18:38:52,986 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3360 transitions. Word has length 184 [2025-01-09 18:38:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:52,986 INFO L471 AbstractCegarLoop]: Abstraction has 2343 states and 3360 transitions. [2025-01-09 18:38:52,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:38:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3360 transitions. [2025-01-09 18:38:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 18:38:52,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:52,993 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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] [2025-01-09 18:38:53,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 18:38:53,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:38:53,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:53,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:53,195 INFO L85 PathProgramCache]: Analyzing trace with hash 784456509, now seen corresponding path program 1 times [2025-01-09 18:38:53,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:53,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188449037] [2025-01-09 18:38:53,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:53,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 18:38:53,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 18:38:53,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:53,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-09 18:38:54,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:54,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188449037] [2025-01-09 18:38:54,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188449037] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:38:54,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606642095] [2025-01-09 18:38:54,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:54,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:38:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:38:54,124 INFO L229 MonitoredProcess]: Starting monitored process 4 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:38:54,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 18:38:54,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 18:38:54,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 18:38:54,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:54,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:54,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 18:38:54,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:38:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 18:38:55,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:38:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606642095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:55,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:38:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 9 [2025-01-09 18:38:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152313707] [2025-01-09 18:38:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 18:38:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:55,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 18:38:55,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:38:55,020 INFO L87 Difference]: Start difference. First operand 2343 states and 3360 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:38:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:55,207 INFO L93 Difference]: Finished difference Result 4102 states and 5904 transitions. [2025-01-09 18:38:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 18:38:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) Word has length 186 [2025-01-09 18:38:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:55,222 INFO L225 Difference]: With dead ends: 4102 [2025-01-09 18:38:55,224 INFO L226 Difference]: Without dead ends: 2363 [2025-01-09 18:38:55,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 18:38:55,228 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 863 mSDsluCounter, 11731 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 13416 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:55,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 13416 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-01-09 18:38:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2361. [2025-01-09 18:38:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2361 states, 1718 states have (on average 1.3754365541327125) internal successors, (2363), 1787 states have internal predecessors, (2363), 505 states have call successors, (505), 132 states have call predecessors, (505), 137 states have return successors, (522), 502 states have call predecessors, (522), 504 states have call successors, (522) [2025-01-09 18:38:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3390 transitions. [2025-01-09 18:38:55,292 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3390 transitions. Word has length 186 [2025-01-09 18:38:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:55,292 INFO L471 AbstractCegarLoop]: Abstraction has 2361 states and 3390 transitions. [2025-01-09 18:38:55,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:38:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3390 transitions. [2025-01-09 18:38:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 18:38:55,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:55,299 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:55,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 18:38:55,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:38:55,500 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:55,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash 745190422, now seen corresponding path program 1 times [2025-01-09 18:38:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:55,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404126258] [2025-01-09 18:38:55,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:55,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 18:38:55,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 18:38:55,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:55,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 18:38:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404126258] [2025-01-09 18:38:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404126258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:38:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230300165] [2025-01-09 18:38:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:56,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:38:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:56,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:38:56,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:38:56,105 INFO L87 Difference]: Start difference. First operand 2361 states and 3390 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:38:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:56,195 INFO L93 Difference]: Finished difference Result 4106 states and 5916 transitions. [2025-01-09 18:38:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:38:56,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 192 [2025-01-09 18:38:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:56,205 INFO L225 Difference]: With dead ends: 4106 [2025-01-09 18:38:56,205 INFO L226 Difference]: Without dead ends: 2363 [2025-01-09 18:38:56,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:38:56,209 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 0 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4961 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:56,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4961 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2025-01-09 18:38:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2363. [2025-01-09 18:38:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1720 states have (on average 1.375) internal successors, (2365), 1789 states have internal predecessors, (2365), 505 states have call successors, (505), 132 states have call predecessors, (505), 137 states have return successors, (522), 502 states have call predecessors, (522), 504 states have call successors, (522) [2025-01-09 18:38:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3392 transitions. [2025-01-09 18:38:56,301 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3392 transitions. Word has length 192 [2025-01-09 18:38:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:56,302 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3392 transitions. [2025-01-09 18:38:56,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:38:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3392 transitions. [2025-01-09 18:38:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 18:38:56,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:56,308 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:38:56,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:38:56,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:56,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash 573039061, now seen corresponding path program 1 times [2025-01-09 18:38:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:56,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418995797] [2025-01-09 18:38:56,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:56,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 18:38:56,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 18:38:56,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:56,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-01-09 18:38:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418995797] [2025-01-09 18:38:56,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418995797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:56,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:56,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:38:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737122299] [2025-01-09 18:38:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:56,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:38:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:56,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:38:56,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:38:56,590 INFO L87 Difference]: Start difference. First operand 2363 states and 3392 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 18:38:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:56,663 INFO L93 Difference]: Finished difference Result 4110 states and 5921 transitions. [2025-01-09 18:38:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:38:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 200 [2025-01-09 18:38:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:56,678 INFO L225 Difference]: With dead ends: 4110 [2025-01-09 18:38:56,679 INFO L226 Difference]: Without dead ends: 2365 [2025-01-09 18:38:56,682 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:38:56,683 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 2 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3305 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:56,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3305 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-01-09 18:38:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2025-01-09 18:38:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 1722 states have (on average 1.3745644599303135) internal successors, (2367), 1791 states have internal predecessors, (2367), 505 states have call successors, (505), 132 states have call predecessors, (505), 137 states have return successors, (522), 502 states have call predecessors, (522), 504 states have call successors, (522) [2025-01-09 18:38:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3394 transitions. [2025-01-09 18:38:56,744 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3394 transitions. Word has length 200 [2025-01-09 18:38:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:56,744 INFO L471 AbstractCegarLoop]: Abstraction has 2365 states and 3394 transitions. [2025-01-09 18:38:56,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 18:38:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3394 transitions. [2025-01-09 18:38:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 18:38:56,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:56,752 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 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:38:56,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:38:56,752 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:56,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 200528503, now seen corresponding path program 1 times [2025-01-09 18:38:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949851666] [2025-01-09 18:38:56,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 18:38:57,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 18:38:57,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:38:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-01-09 18:38:57,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:38:57,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949851666] [2025-01-09 18:38:57,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949851666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:38:57,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:38:57,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:38:57,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370456499] [2025-01-09 18:38:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:38:57,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:38:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:38:57,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:38:57,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:38:57,450 INFO L87 Difference]: Start difference. First operand 2365 states and 3394 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 18:38:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:38:57,598 INFO L93 Difference]: Finished difference Result 4116 states and 5926 transitions. [2025-01-09 18:38:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:38:57,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 209 [2025-01-09 18:38:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:38:57,610 INFO L225 Difference]: With dead ends: 4116 [2025-01-09 18:38:57,610 INFO L226 Difference]: Without dead ends: 2369 [2025-01-09 18:38:57,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:38:57,617 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 2 mSDsluCounter, 6617 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8276 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:38:57,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8276 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:38:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-01-09 18:38:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2368. [2025-01-09 18:38:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 1725 states have (on average 1.373913043478261) internal successors, (2370), 1793 states have internal predecessors, (2370), 505 states have call successors, (505), 132 states have call predecessors, (505), 137 states have return successors, (522), 503 states have call predecessors, (522), 504 states have call successors, (522) [2025-01-09 18:38:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3397 transitions. [2025-01-09 18:38:57,727 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3397 transitions. Word has length 209 [2025-01-09 18:38:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:38:57,728 INFO L471 AbstractCegarLoop]: Abstraction has 2368 states and 3397 transitions. [2025-01-09 18:38:57,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 18:38:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3397 transitions. [2025-01-09 18:38:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 18:38:57,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:38:57,737 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:38:57,738 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:38:57,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:38:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash 183570192, now seen corresponding path program 1 times [2025-01-09 18:38:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:38:57,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333610136] [2025-01-09 18:38:57,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:38:57,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:38:58,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 18:38:58,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 18:38:58,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:38:58,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 58 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 18:39:04,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:04,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333610136] [2025-01-09 18:39:04,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333610136] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:39:04,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492332375] [2025-01-09 18:39:04,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:04,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:04,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:39:04,998 INFO L229 MonitoredProcess]: Starting monitored process 5 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:39:05,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 18:39:05,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 18:39:05,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 18:39:05,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:05,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:05,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1794 conjuncts, 198 conjuncts are in the unsatisfiable core [2025-01-09 18:39:05,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:39:06,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 18:39:06,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 18:39:06,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 18:39:07,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 18:39:07,265 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 18:39:07,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 16 [2025-01-09 18:39:07,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 18:39:07,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-01-09 18:39:07,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 18:39:07,501 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 18:39:07,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 18:39:07,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 18:39:08,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 18:39:08,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 18:39:08,052 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:08,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2025-01-09 18:39:08,183 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:08,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2025-01-09 18:39:08,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 18:39:08,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 18:39:08,654 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:08,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-01-09 18:39:08,676 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:08,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-01-09 18:39:08,694 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 18:39:08,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 58 treesize of output 51 [2025-01-09 18:39:09,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2025-01-09 18:39:09,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2025-01-09 18:39:09,147 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:09,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 55 [2025-01-09 18:39:09,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 18:39:09,170 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:09,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2025-01-09 18:39:09,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-01-09 18:39:09,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-01-09 18:39:09,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 18:39:09,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2025-01-09 18:39:09,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-09 18:39:09,487 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:09,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 58 [2025-01-09 18:39:09,495 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:09,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2025-01-09 18:39:09,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 18:39:09,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-01-09 18:39:09,982 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:09,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 43 [2025-01-09 18:39:10,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 18:39:10,438 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:10,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 43 [2025-01-09 18:39:10,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-01-09 18:39:11,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 18:39:11,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 75 [2025-01-09 18:39:11,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 18:39:11,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 18:39:11,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 18:39:11,359 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 18:39:11,361 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 18:39:11,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 40 [2025-01-09 18:39:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 64 proven. 15 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 18:39:11,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:39:11,584 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5343 (Array Int Int)) (v_ArrVal_5342 (Array Int Int)) (v_ArrVal_5344 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int#4| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_5344) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_5342) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_5343) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (< .cse0 1) (< 2147483647 .cse0)))) is different from false