./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '992655552ae218ee7e8c394eee3a8415ead8a3964b9945bcb1a5e6ecd929382d'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 992655552ae218ee7e8c394eee3a8415ead8a3964b9945bcb1a5e6ecd929382d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 12:40:11,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 12:40:11,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 12:40:11,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 12:40:11,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 12:40:11,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 12:40:11,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 12:40:11,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 12:40:11,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 12:40:11,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 12:40:11,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 12:40:11,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 12:40:11,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 12:40:11,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 12:40:11,899 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 12:40:11,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 12:40:11,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 12:40:11,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 12:40:11,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 12:40:11,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 12:40:11,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 12:40:11,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 12:40:11,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 12:40:11,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 12:40:11,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 12:40:11,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 12:40:11,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 12:40:11,902 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 992655552ae218ee7e8c394eee3a8415ead8a3964b9945bcb1a5e6ecd929382d [2024-11-07 12:40:12,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 12:40:12,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 12:40:12,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 12:40:12,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 12:40:12,193 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 12:40:12,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2024-11-07 12:40:13,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 12:40:14,125 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 12:40:14,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2024-11-07 12:40:14,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c12266bac/f1c2ccc3a291444c83cdf7e2faa5a1f0/FLAG6939b0467 [2024-11-07 12:40:14,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c12266bac/f1c2ccc3a291444c83cdf7e2faa5a1f0 [2024-11-07 12:40:14,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 12:40:14,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 12:40:14,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 12:40:14,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 12:40:14,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 12:40:14,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:14" (1/1) ... [2024-11-07 12:40:14,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c83536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:14, skipping insertion in model container [2024-11-07 12:40:14,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:40:14" (1/1) ... [2024-11-07 12:40:14,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 12:40:15,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2024-11-07 12:40:15,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 12:40:15,699 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 12:40:15,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4703] [2024-11-07 12:40:15,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4710] [2024-11-07 12:40:15,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4718-4719] [2024-11-07 12:40:15,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4727-4728] [2024-11-07 12:40:15,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2024-11-07 12:40:15,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2024-11-07 12:40:15,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2024-11-07 12:40:15,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2024-11-07 12:40:15,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] [2024-11-07 12:40:15,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5127] [2024-11-07 12:40:15,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5131] [2024-11-07 12:40:15,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5135] [2024-11-07 12:40:15,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5146] [2024-11-07 12:40:15,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5150] [2024-11-07 12:40:15,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5154] [2024-11-07 12:40:15,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5158] [2024-11-07 12:40:15,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5169] [2024-11-07 12:40:15,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5173] [2024-11-07 12:40:15,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5177] [2024-11-07 12:40:15,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5181] [2024-11-07 12:40:15,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5192] [2024-11-07 12:40:15,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5196] [2024-11-07 12:40:15,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5200] [2024-11-07 12:40:15,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5204] [2024-11-07 12:40:15,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] [2024-11-07 12:40:15,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5258] [2024-11-07 12:40:15,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5262] [2024-11-07 12:40:15,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5266] [2024-11-07 12:40:15,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5277] [2024-11-07 12:40:15,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5281] [2024-11-07 12:40:15,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5285] [2024-11-07 12:40:15,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5289] [2024-11-07 12:40:15,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5300] [2024-11-07 12:40:15,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5304] [2024-11-07 12:40:15,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5308] [2024-11-07 12:40:15,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5312] [2024-11-07 12:40:15,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5323] [2024-11-07 12:40:15,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5327] [2024-11-07 12:40:15,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5331] [2024-11-07 12:40:15,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5335] [2024-11-07 12:40:15,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] [2024-11-07 12:40:15,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5413] [2024-11-07 12:40:15,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5417] [2024-11-07 12:40:15,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5421] [2024-11-07 12:40:15,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5432] [2024-11-07 12:40:15,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5436] [2024-11-07 12:40:15,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5440] [2024-11-07 12:40:15,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5444] [2024-11-07 12:40:15,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5455] [2024-11-07 12:40:15,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5459] [2024-11-07 12:40:15,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5463] [2024-11-07 12:40:15,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5467] [2024-11-07 12:40:15,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6408] [2024-11-07 12:40:15,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6411] [2024-11-07 12:40:15,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6414] [2024-11-07 12:40:15,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6417] [2024-11-07 12:40:15,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6420] [2024-11-07 12:40:15,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6433] [2024-11-07 12:40:15,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6436] [2024-11-07 12:40:15,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6439] [2024-11-07 12:40:15,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6442] [2024-11-07 12:40:15,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6445] [2024-11-07 12:40:15,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6467] [2024-11-07 12:40:15,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6470] [2024-11-07 12:40:15,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6473] [2024-11-07 12:40:15,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6476] [2024-11-07 12:40:15,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6479] [2024-11-07 12:40:15,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6512-6513] [2024-11-07 12:40:15,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6516-6517] [2024-11-07 12:40:15,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6520-6521] [2024-11-07 12:40:15,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6524-6525] [2024-11-07 12:40:15,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6528-6529] [2024-11-07 12:40:15,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6542] [2024-11-07 12:40:15,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6545] [2024-11-07 12:40:15,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6548] [2024-11-07 12:40:15,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6551] [2024-11-07 12:40:15,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6554] [2024-11-07 12:40:15,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6587-6588] [2024-11-07 12:40:15,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6591-6592] [2024-11-07 12:40:15,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6595-6596] [2024-11-07 12:40:15,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6599-6600] [2024-11-07 12:40:15,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6603-6604] [2024-11-07 12:40:15,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2024-11-07 12:40:15,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 12:40:16,079 INFO L204 MainTranslator]: Completed translation [2024-11-07 12:40:16,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16 WrapperNode [2024-11-07 12:40:16,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 12:40:16,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 12:40:16,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 12:40:16,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 12:40:16,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,324 INFO L138 Inliner]: procedures = 156, calls = 821, calls flagged for inlining = 81, calls inlined = 80, statements flattened = 3046 [2024-11-07 12:40:16,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 12:40:16,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 12:40:16,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 12:40:16,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 12:40:16,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,726 INFO L175 MemorySlicer]: Split 418 memory accesses to 11 slices as follows [2, 1, 334, 3, 1, 1, 4, 2, 36, 22, 12]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0]. The 177 writes are split as follows [0, 0, 105, 0, 0, 1, 1, 0, 36, 22, 12]. [2024-11-07 12:40:16,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 12:40:16,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 12:40:16,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 12:40:16,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 12:40:16,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (1/1) ... [2024-11-07 12:40:16,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 12:40:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 12:40:16,963 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) [2024-11-07 12:40:16,967 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 [2024-11-07 12:40:16,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-07 12:40:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-07 12:40:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-07 12:40:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-07 12:40:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-07 12:40:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-07 12:40:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-07 12:40:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-07 12:40:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-11-07 12:40:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-11-07 12:40:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-11-07 12:40:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2024-11-07 12:40:16,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __xchg_wrong_size [2024-11-07 12:40:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-07 12:40:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-07 12:40:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-11-07 12:40:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-11-07 12:40:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-11-07 12:40:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-11-07 12:40:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-11-07 12:40:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-11-07 12:40:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-11-07 12:40:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-11-07 12:40:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-11-07 12:40:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-07 12:40:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-07 12:40:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-07 12:40:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-07 12:40:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-07 12:40:16,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 12:40:16,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-11-07 12:40:16,995 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2024-11-07 12:40:16,995 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2024-11-07 12:40:16,995 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-11-07 12:40:16,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-07 12:40:16,996 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2024-11-07 12:40:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-11-07 12:40:16,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2024-11-07 12:40:16,997 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2024-11-07 12:40:16,997 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2024-11-07 12:40:16,997 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-11-07 12:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-11-07 12:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2024-11-07 12:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2024-11-07 12:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2024-11-07 12:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-11-07 12:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2024-11-07 12:40:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-07 12:40:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-11-07 12:40:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-11-07 12:40:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-11-07 12:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-11-07 12:40:17,002 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-11-07 12:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-11-07 12:40:17,002 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-11-07 12:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-11-07 12:40:17,002 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2024-11-07 12:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2024-11-07 12:40:17,002 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-11-07 12:40:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-11-07 12:40:17,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 12:40:17,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 12:40:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 12:40:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 12:40:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 12:40:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 12:40:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 12:40:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 12:40:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 12:40:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2024-11-07 12:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-11-07 12:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2024-11-07 12:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2024-11-07 12:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 12:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2024-11-07 12:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2024-11-07 12:40:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2024-11-07 12:40:17,006 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2024-11-07 12:40:17,602 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 12:40:17,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 12:40:24,946 INFO L? ?]: Removed 1466 outVars from TransFormulas that were not future-live. [2024-11-07 12:40:24,946 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 12:40:24,984 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 12:40:24,985 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 12:40:24,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:24 BoogieIcfgContainer [2024-11-07 12:40:24,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 12:40:24,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 12:40:24,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 12:40:24,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 12:40:24,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:40:14" (1/3) ... [2024-11-07 12:40:24,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e706a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:24, skipping insertion in model container [2024-11-07 12:40:24,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:40:16" (2/3) ... [2024-11-07 12:40:24,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e706a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:40:24, skipping insertion in model container [2024-11-07 12:40:24,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:40:24" (3/3) ... [2024-11-07 12:40:24,994 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2024-11-07 12:40:25,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 12:40:25,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 12:40:25,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 12:40:25,130 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;@6c1bd3a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 12:40:25,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 12:40:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 1061 states, 780 states have (on average 1.4243589743589744) internal successors, (1111), 818 states have internal predecessors, (1111), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2024-11-07 12:40:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 12:40:25,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:40:25,158 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:40:25,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:40:25,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:40:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash 625661202, now seen corresponding path program 1 times [2024-11-07 12:40:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:40:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396867761] [2024-11-07 12:40:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:40:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:40:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:40:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:40:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:40:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:40:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:40:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 12:40:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 12:40:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:40:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396867761] [2024-11-07 12:40:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396867761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:40:26,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:40:26,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 12:40:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940462034] [2024-11-07 12:40:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:40:26,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 12:40:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:40:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 12:40:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 12:40:26,384 INFO L87 Difference]: Start difference. First operand has 1061 states, 780 states have (on average 1.4243589743589744) internal successors, (1111), 818 states have internal predecessors, (1111), 234 states have call successors, (234), 45 states have call predecessors, (234), 45 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-07 12:40:30,406 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 [] [2024-11-07 12:40:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:40:32,467 INFO L93 Difference]: Finished difference Result 2138 states and 3202 transitions. [2024-11-07 12:40:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 12:40:32,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2024-11-07 12:40:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:40:32,486 INFO L225 Difference]: With dead ends: 2138 [2024-11-07 12:40:32,486 INFO L226 Difference]: Without dead ends: 1038 [2024-11-07 12:40:32,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:40:32,497 INFO L432 NwaCegarLoop]: 1106 mSDtfsCounter, 1728 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 408 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-07 12:40:32,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 1771 Invalid, 1117 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [408 Valid, 708 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2024-11-07 12:40:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-07 12:40:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1018. [2024-11-07 12:40:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 748 states have (on average 1.414438502673797) internal successors, (1058), 783 states have internal predecessors, (1058), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-07 12:40:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1506 transitions. [2024-11-07 12:40:32,631 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1506 transitions. Word has length 78 [2024-11-07 12:40:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:40:32,633 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1506 transitions. [2024-11-07 12:40:32,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-07 12:40:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1506 transitions. [2024-11-07 12:40:32,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 12:40:32,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:40:32,642 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:40:32,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 12:40:32,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:40:32,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:40:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash 827485136, now seen corresponding path program 1 times [2024-11-07 12:40:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:40:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502125737] [2024-11-07 12:40:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:40:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:40:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:40:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:40:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:40:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:40:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:40:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 12:40:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 12:40:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:40:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502125737] [2024-11-07 12:40:33,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502125737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:40:33,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:40:33,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:40:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482132002] [2024-11-07 12:40:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:40:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:40:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:40:33,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:40:33,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:40:33,534 INFO L87 Difference]: Start difference. First operand 1018 states and 1506 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 12:40:37,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 12:40:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:40:39,786 INFO L93 Difference]: Finished difference Result 1042 states and 1544 transitions. [2024-11-07 12:40:39,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 12:40:39,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 78 [2024-11-07 12:40:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:40:39,794 INFO L225 Difference]: With dead ends: 1042 [2024-11-07 12:40:39,795 INFO L226 Difference]: Without dead ends: 1040 [2024-11-07 12:40:39,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:40:39,796 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 456 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 176 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-07 12:40:39,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 3476 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1889 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-11-07 12:40:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2024-11-07 12:40:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1020. [2024-11-07 12:40:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 750 states have (on average 1.4133333333333333) internal successors, (1060), 785 states have internal predecessors, (1060), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-07 12:40:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1508 transitions. [2024-11-07 12:40:39,863 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1508 transitions. Word has length 78 [2024-11-07 12:40:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:40:39,863 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1508 transitions. [2024-11-07 12:40:39,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 12:40:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1508 transitions. [2024-11-07 12:40:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 12:40:39,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:40:39,870 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:40:39,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 12:40:39,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:40:39,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:40:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash 781579112, now seen corresponding path program 1 times [2024-11-07 12:40:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:40:39,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801173321] [2024-11-07 12:40:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:40:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:40:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:40:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:40:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:40:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:40:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:40:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 12:40:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 12:40:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 12:40:40,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:40:40,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801173321] [2024-11-07 12:40:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801173321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:40:40,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:40:40,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:40:40,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828089591] [2024-11-07 12:40:40,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:40:40,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:40:40,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:40:40,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:40:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:40:40,598 INFO L87 Difference]: Start difference. First operand 1020 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-07 12:40:44,611 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 [] [2024-11-07 12:40:48,619 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 [] [2024-11-07 12:40:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:40:50,388 INFO L93 Difference]: Finished difference Result 2039 states and 3023 transitions. [2024-11-07 12:40:50,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 12:40:50,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2024-11-07 12:40:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:40:50,400 INFO L225 Difference]: With dead ends: 2039 [2024-11-07 12:40:50,400 INFO L226 Difference]: Without dead ends: 1051 [2024-11-07 12:40:50,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:40:50,406 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 1647 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 399 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 2356 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-07 12:40:50,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1792 Valid, 2356 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 1506 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2024-11-07 12:40:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-07 12:40:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1021. [2024-11-07 12:40:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 751 states have (on average 1.4127829560585885) internal successors, (1061), 786 states have internal predecessors, (1061), 224 states have call successors, (224), 45 states have call predecessors, (224), 45 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-07 12:40:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1509 transitions. [2024-11-07 12:40:50,467 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1509 transitions. Word has length 88 [2024-11-07 12:40:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:40:50,469 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1509 transitions. [2024-11-07 12:40:50,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-07 12:40:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1509 transitions. [2024-11-07 12:40:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 12:40:50,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:40:50,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:40:50,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 12:40:50,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:40:50,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:40:50,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1580967689, now seen corresponding path program 1 times [2024-11-07 12:40:50,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:40:50,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718856248] [2024-11-07 12:40:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:40:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:40:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:40:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:40:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:40:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:40:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:40:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 12:40:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 12:40:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 12:40:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:40:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718856248] [2024-11-07 12:40:51,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718856248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:40:51,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:40:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 12:40:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716282689] [2024-11-07 12:40:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:40:51,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 12:40:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:40:51,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 12:40:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:40:51,234 INFO L87 Difference]: Start difference. First operand 1021 states and 1509 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 12:40:55,246 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 [] [2024-11-07 12:40:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:40:57,469 INFO L93 Difference]: Finished difference Result 1058 states and 1566 transitions. [2024-11-07 12:40:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 12:40:57,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2024-11-07 12:40:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:40:57,478 INFO L225 Difference]: With dead ends: 1058 [2024-11-07 12:40:57,478 INFO L226 Difference]: Without dead ends: 1056 [2024-11-07 12:40:57,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:40:57,479 INFO L432 NwaCegarLoop]: 1062 mSDtfsCounter, 576 mSDsluCounter, 3236 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 179 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 4298 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-07 12:40:57,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 4298 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 2496 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-11-07 12:40:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-07 12:40:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1023. [2024-11-07 12:40:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 752 states have (on average 1.4122340425531914) internal successors, (1062), 786 states have internal predecessors, (1062), 225 states have call successors, (225), 45 states have call predecessors, (225), 45 states have return successors, (225), 223 states have call predecessors, (225), 225 states have call successors, (225) [2024-11-07 12:40:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1512 transitions. [2024-11-07 12:40:57,527 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1512 transitions. Word has length 90 [2024-11-07 12:40:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:40:57,528 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1512 transitions. [2024-11-07 12:40:57,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 12:40:57,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1512 transitions. [2024-11-07 12:40:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 12:40:57,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:40:57,537 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:40:57,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 12:40:57,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:40:57,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:40:57,539 INFO L85 PathProgramCache]: Analyzing trace with hash 827046205, now seen corresponding path program 1 times [2024-11-07 12:40:57,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:40:57,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796279450] [2024-11-07 12:40:57,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:40:57,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:40:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:40:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:40:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:40:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:40:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:40:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:40:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:40:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 12:40:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 12:40:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 12:40:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 12:40:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 12:40:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 12:40:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:40:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 12:40:58,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:40:58,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796279450] [2024-11-07 12:40:58,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796279450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:40:58,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:40:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 12:40:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708517018] [2024-11-07 12:40:58,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:40:58,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 12:40:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:40:58,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 12:40:58,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 12:40:58,122 INFO L87 Difference]: Start difference. First operand 1023 states and 1512 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 12:41:02,134 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 [] [2024-11-07 12:41:06,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 12:41:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:41:09,561 INFO L93 Difference]: Finished difference Result 3018 states and 4473 transitions. [2024-11-07 12:41:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 12:41:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2024-11-07 12:41:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:41:09,578 INFO L225 Difference]: With dead ends: 3018 [2024-11-07 12:41:09,579 INFO L226 Difference]: Without dead ends: 2027 [2024-11-07 12:41:09,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:41:09,585 INFO L432 NwaCegarLoop]: 1264 mSDtfsCounter, 2021 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 509 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-07 12:41:09,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 2853 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 1448 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2024-11-07 12:41:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2024-11-07 12:41:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1985. [2024-11-07 12:41:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1460 states have (on average 1.4164383561643836) internal successors, (2068), 1527 states have internal predecessors, (2068), 435 states have call successors, (435), 89 states have call predecessors, (435), 89 states have return successors, (435), 431 states have call predecessors, (435), 435 states have call successors, (435) [2024-11-07 12:41:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2938 transitions. [2024-11-07 12:41:09,747 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2938 transitions. Word has length 122 [2024-11-07 12:41:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:41:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2938 transitions. [2024-11-07 12:41:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 12:41:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2938 transitions. [2024-11-07 12:41:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 12:41:09,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:41:09,761 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:41:09,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 12:41:09,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:41:09,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:41:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash -366243905, now seen corresponding path program 1 times [2024-11-07 12:41:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:41:09,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935421368] [2024-11-07 12:41:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:41:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:41:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:41:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:41:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:41:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:41:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:41:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:41:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:41:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:41:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:41:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 12:41:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:41:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 12:41:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 12:41:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 12:41:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 12:41:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-07 12:41:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:41:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935421368] [2024-11-07 12:41:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935421368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:41:10,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:41:10,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:41:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605052318] [2024-11-07 12:41:10,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:41:10,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:41:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:41:10,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:41:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:41:10,562 INFO L87 Difference]: Start difference. First operand 1985 states and 2938 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 12:41:14,576 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 [] [2024-11-07 12:41:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:41:16,680 INFO L93 Difference]: Finished difference Result 3028 states and 4468 transitions. [2024-11-07 12:41:16,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 12:41:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-07 12:41:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:41:16,691 INFO L225 Difference]: With dead ends: 3028 [2024-11-07 12:41:16,691 INFO L226 Difference]: Without dead ends: 1073 [2024-11-07 12:41:16,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:41:16,702 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 456 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 175 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-07 12:41:16,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 3477 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1884 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-11-07 12:41:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-07 12:41:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1044. [2024-11-07 12:41:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 767 states have (on average 1.4028683181225554) internal successors, (1076), 801 states have internal predecessors, (1076), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2024-11-07 12:41:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1528 transitions. [2024-11-07 12:41:16,769 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1528 transitions. Word has length 124 [2024-11-07 12:41:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:41:16,770 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1528 transitions. [2024-11-07 12:41:16,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 12:41:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1528 transitions. [2024-11-07 12:41:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 12:41:16,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:41:16,779 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:41:16,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 12:41:16,779 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:41:16,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:41:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1884630537, now seen corresponding path program 1 times [2024-11-07 12:41:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:41:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034361209] [2024-11-07 12:41:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:41:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:41:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:41:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:41:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:41:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:41:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:41:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:41:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:41:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:41:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 12:41:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 12:41:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 12:41:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 12:41:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 12:41:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 12:41:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 12:41:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:41:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034361209] [2024-11-07 12:41:17,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034361209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:41:17,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:41:17,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:41:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812299817] [2024-11-07 12:41:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:41:17,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:41:17,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:41:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:41:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:41:17,437 INFO L87 Difference]: Start difference. First operand 1044 states and 1528 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 12:41:21,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 12:41:25,464 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 [] [2024-11-07 12:41:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:41:27,533 INFO L93 Difference]: Finished difference Result 2091 states and 3079 transitions. [2024-11-07 12:41:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 12:41:27,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 124 [2024-11-07 12:41:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:41:27,542 INFO L225 Difference]: With dead ends: 2091 [2024-11-07 12:41:27,542 INFO L226 Difference]: Without dead ends: 1100 [2024-11-07 12:41:27,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:41:27,547 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1646 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 405 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1798 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-07 12:41:27,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1798 Valid, 2353 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1522 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2024-11-07 12:41:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-11-07 12:41:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1048. [2024-11-07 12:41:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 771 states have (on average 1.4020752269779506) internal successors, (1081), 805 states have internal predecessors, (1081), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2024-11-07 12:41:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1533 transitions. [2024-11-07 12:41:27,647 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1533 transitions. Word has length 124 [2024-11-07 12:41:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:41:27,648 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1533 transitions. [2024-11-07 12:41:27,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 12:41:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1533 transitions. [2024-11-07 12:41:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 12:41:27,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:41:27,654 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:41:27,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 12:41:27,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:41:27,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:41:27,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1506823180, now seen corresponding path program 1 times [2024-11-07 12:41:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:41:27,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514364918] [2024-11-07 12:41:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:41:27,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:41:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:41:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:41:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:41:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:41:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:41:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:41:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:41:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:41:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 12:41:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 12:41:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 12:41:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:41:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 12:41:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 12:41:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 12:41:28,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:41:28,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514364918] [2024-11-07 12:41:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514364918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:41:28,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:41:28,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 12:41:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217618319] [2024-11-07 12:41:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:41:28,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 12:41:28,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:41:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 12:41:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 12:41:28,171 INFO L87 Difference]: Start difference. First operand 1048 states and 1533 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:41:32,184 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 [] [2024-11-07 12:41:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:41:33,747 INFO L93 Difference]: Finished difference Result 2072 states and 3055 transitions. [2024-11-07 12:41:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 12:41:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-11-07 12:41:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:41:33,754 INFO L225 Difference]: With dead ends: 2072 [2024-11-07 12:41:33,754 INFO L226 Difference]: Without dead ends: 1077 [2024-11-07 12:41:33,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:41:33,759 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 453 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 178 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-07 12:41:33,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2570 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1262 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-11-07 12:41:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-07 12:41:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1048. [2024-11-07 12:41:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 771 states have (on average 1.398184176394293) internal successors, (1078), 805 states have internal predecessors, (1078), 226 states have call successors, (226), 50 states have call predecessors, (226), 50 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2024-11-07 12:41:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1530 transitions. [2024-11-07 12:41:33,818 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1530 transitions. Word has length 127 [2024-11-07 12:41:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:41:33,819 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1530 transitions. [2024-11-07 12:41:33,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 12:41:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1530 transitions. [2024-11-07 12:41:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 12:41:33,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:41:33,825 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:41:33,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 12:41:33,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:41:33,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:41:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash -150139687, now seen corresponding path program 1 times [2024-11-07 12:41:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:41:33,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363390437] [2024-11-07 12:41:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:41:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:41:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 12:41:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:41:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 12:41:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:41:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:41:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:41:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:41:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:41:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 12:41:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 12:41:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 12:41:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 12:41:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 12:41:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 12:41:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:41:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 12:41:34,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:41:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363390437] [2024-11-07 12:41:34,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363390437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:41:34,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:41:34,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:41:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400661153] [2024-11-07 12:41:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:41:34,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:41:34,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:41:34,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:41:34,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:41:34,543 INFO L87 Difference]: Start difference. First operand 1048 states and 1530 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)