./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:10:51,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:10:51,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:10:51,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:10:51,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:10:51,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:10:51,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:10:51,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:10:51,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:10:51,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:10:51,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:10:51,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:10:51,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:10:51,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:10:51,762 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:10:51,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:10:51,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:10:51,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:10:51,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:10:51,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:10:51,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:10:51,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:10:51,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:10:51,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:10:51,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:10:51,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:10:51,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:10:51,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:10:51,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:10:51,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:10:51,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:10:51,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:10:51,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:10:51,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:10:51,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:10:51,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:10:51,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:10:51,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:10:51,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:10:51,775 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2024-10-11 15:10:52,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:10:52,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:10:52,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:10:52,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:10:52,052 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:10:52,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2024-10-11 15:10:53,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:10:53,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:10:53,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2024-10-11 15:10:53,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db7159b01/7885a40e77454a95a37c645fbd2e1f97/FLAGb4474a729 [2024-10-11 15:10:53,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db7159b01/7885a40e77454a95a37c645fbd2e1f97 [2024-10-11 15:10:53,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:10:53,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:10:53,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:10:53,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:10:53,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:10:53,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:53" (1/1) ... [2024-10-11 15:10:53,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2efcbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:53, skipping insertion in model container [2024-10-11 15:10:53,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:53" (1/1) ... [2024-10-11 15:10:53,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:10:54,764 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2024-10-11 15:10:54,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:10:54,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:10:54,955 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-10-11 15:10:54,956 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-10-11 15:10:54,957 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-10-11 15:10:54,957 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-10-11 15:10:54,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4750] [2024-10-11 15:10:54,958 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4753] [2024-10-11 15:10:54,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4756] [2024-10-11 15:10:54,959 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4759] [2024-10-11 15:10:54,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5123] [2024-10-11 15:10:54,968 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-10-11 15:10:54,968 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-10-11 15:10:54,968 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-10-11 15:10:54,969 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-10-11 15:10:54,969 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-10-11 15:10:54,969 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-10-11 15:10:54,970 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-10-11 15:10:54,970 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-10-11 15:10:54,970 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-10-11 15:10:54,971 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-10-11 15:10:54,971 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-10-11 15:10:54,971 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-10-11 15:10:54,972 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-10-11 15:10:54,973 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-10-11 15:10:54,973 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-10-11 15:10:54,975 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5254] [2024-10-11 15:10:54,975 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-10-11 15:10:54,975 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-10-11 15:10:54,976 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-10-11 15:10:54,980 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-10-11 15:10:54,981 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-10-11 15:10:54,982 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-10-11 15:10:54,982 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-10-11 15:10:54,982 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-10-11 15:10:54,983 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-10-11 15:10:54,983 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-10-11 15:10:54,983 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-10-11 15:10:54,984 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-10-11 15:10:54,985 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-10-11 15:10:54,985 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-10-11 15:10:54,986 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-10-11 15:10:54,988 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5409] [2024-10-11 15:10:54,988 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-10-11 15:10:54,989 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-10-11 15:10:54,989 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-10-11 15:10:54,989 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-10-11 15:10:54,990 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-10-11 15:10:54,990 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-10-11 15:10:54,992 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-10-11 15:10:54,992 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-10-11 15:10:54,992 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-10-11 15:10:54,993 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-10-11 15:10:54,993 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-10-11 15:10:55,079 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-10-11 15:10:55,079 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-10-11 15:10:55,079 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-10-11 15:10:55,080 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-10-11 15:10:55,080 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-10-11 15:10:55,080 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-10-11 15:10:55,082 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-10-11 15:10:55,082 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-10-11 15:10:55,082 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-10-11 15:10:55,082 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-10-11 15:10:55,083 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-10-11 15:10:55,083 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-10-11 15:10:55,084 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-10-11 15:10:55,084 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-10-11 15:10:55,085 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-10-11 15:10:55,086 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-10-11 15:10:55,090 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-10-11 15:10:55,091 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-10-11 15:10:55,091 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-10-11 15:10:55,091 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-10-11 15:10:55,092 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-10-11 15:10:55,093 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-10-11 15:10:55,093 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-10-11 15:10:55,094 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-10-11 15:10:55,094 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-10-11 15:10:55,095 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-10-11 15:10:55,096 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-10-11 15:10:55,096 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-10-11 15:10:55,096 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-10-11 15:10:55,096 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-10-11 15:10:55,128 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2024-10-11 15:10:55,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:10:55,270 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:10:55,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55 WrapperNode [2024-10-11 15:10:55,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:10:55,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:10:55,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:10:55,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:10:55,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,397 INFO L138 Inliner]: procedures = 157, calls = 811, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 3034 [2024-10-11 15:10:55,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:10:55,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:10:55,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:10:55,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:10:55,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,717 INFO L175 MemorySlicer]: Split 417 memory accesses to 11 slices as follows [2, 3, 1, 1, 12, 336, 2, 1, 35, 20, 4]. 81 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 0, 0, 0, 0, 5, 0, 0, 35, 20, 0]. The 119 writes are split as follows [0, 0, 0, 1, 12, 105, 0, 0, 0, 0, 1]. [2024-10-11 15:10:55,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:10:55,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:10:55,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:10:55,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:10:55,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (1/1) ... [2024-10-11 15:10:55,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:10:55,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:10:55,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:10:55,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-11 15:10:55,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-11 15:10:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 15:10:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 15:10:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-11 15:10:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-11 15:10:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-11 15:10:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-11 15:10:55,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-11 15:10:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-11 15:10:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-11 15:10:55,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-10-11 15:10:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-10-11 15:10:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 15:10:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 15:10:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 15:10:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 15:10:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 15:10:55,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 15:10:55,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 15:10:55,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 15:10:55,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-11 15:10:55,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-11 15:10:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-10-11 15:10:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:10:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:10:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:10:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:10:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:10:55,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:10:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:10:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:10:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:10:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 15:10:55,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 15:10:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-11 15:10:55,946 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-11 15:10:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2024-10-11 15:10:55,946 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2024-10-11 15:10:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2024-10-11 15:10:55,946 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2024-10-11 15:10:55,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:10:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:10:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:10:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:10:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:10:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:10:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:10:55,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:10:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:10:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-10-11 15:10:55,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2024-10-11 15:10:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:10:55,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2024-10-11 15:10:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2024-10-11 15:10:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:10:55,949 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-10-11 15:10:55,949 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2024-10-11 15:10:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2024-10-11 15:10:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:10:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2024-10-11 15:10:55,950 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 15:10:55,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:10:55,951 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-11 15:10:55,951 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-11 15:10:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2024-10-11 15:10:55,952 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2024-10-11 15:10:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:10:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:10:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:10:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:10:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:10:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:10:55,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:10:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:10:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:10:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:10:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 15:10:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 15:10:55,953 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2024-10-11 15:10:55,954 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:10:55,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:10:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:10:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 15:10:55,955 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2024-10-11 15:10:55,955 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2024-10-11 15:10:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-10-11 15:10:55,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-10-11 15:10:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2024-10-11 15:10:55,957 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2024-10-11 15:10:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2024-10-11 15:10:55,957 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2024-10-11 15:10:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2024-10-11 15:10:55,957 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2024-10-11 15:10:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:10:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2024-10-11 15:10:55,957 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2024-10-11 15:10:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:10:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 15:10:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2024-10-11 15:10:55,958 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2024-10-11 15:10:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2024-10-11 15:10:55,959 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2024-10-11 15:10:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-10-11 15:10:55,959 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-10-11 15:10:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 15:10:55,959 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 15:10:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-11 15:10:55,959 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-11 15:10:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-10-11 15:10:55,959 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-10-11 15:10:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-11 15:10:55,960 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-11 15:10:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-11 15:10:55,960 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-11 15:10:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2024-10-11 15:10:55,960 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2024-10-11 15:10:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-10-11 15:10:55,960 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-10-11 15:10:55,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:10:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:10:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:10:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:10:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:10:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:10:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:10:55,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:10:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:10:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 15:10:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 15:10:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2024-10-11 15:10:55,962 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2024-10-11 15:10:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-10-11 15:10:55,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-10-11 15:10:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2024-10-11 15:10:55,962 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2024-10-11 15:10:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2024-10-11 15:10:55,962 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2024-10-11 15:10:55,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:10:55,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2024-10-11 15:10:55,963 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2024-10-11 15:10:55,963 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2024-10-11 15:10:55,963 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2024-10-11 15:10:56,472 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:10:56,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:10:58,547 INFO L? ?]: Removed 1468 outVars from TransFormulas that were not future-live. [2024-10-11 15:10:58,547 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:10:58,684 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:10:58,684 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-11 15:10:58,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:10:58 BoogieIcfgContainer [2024-10-11 15:10:58,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:10:58,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:10:58,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:10:58,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:10:58,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:10:53" (1/3) ... [2024-10-11 15:10:58,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48156f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:10:58, skipping insertion in model container [2024-10-11 15:10:58,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:55" (2/3) ... [2024-10-11 15:10:58,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48156f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:10:58, skipping insertion in model container [2024-10-11 15:10:58,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:10:58" (3/3) ... [2024-10-11 15:10:58,691 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2024-10-11 15:10:58,705 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:10:58,705 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-11 15:10:58,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:10:58,775 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;@7a9a1277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:10:58,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-11 15:10:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 960 states, 679 states have (on average 1.5228276877761413) internal successors, (1034), 718 states have internal predecessors, (1034), 223 states have call successors, (223), 44 states have call predecessors, (223), 44 states have return successors, (223), 221 states have call predecessors, (223), 223 states have call successors, (223) [2024-10-11 15:10:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 15:10:58,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:10:58,794 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:10:58,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:10:58,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:10:58,799 INFO L85 PathProgramCache]: Analyzing trace with hash -883939047, now seen corresponding path program 1 times [2024-10-11 15:10:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:10:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913305805] [2024-10-11 15:10:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:10:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:10:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:10:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:10:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:10:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:10:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:10:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:10:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:10:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:10:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:10:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:10:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913305805] [2024-10-11 15:10:59,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913305805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:10:59,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:10:59,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:10:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738796915] [2024-10-11 15:10:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:10:59,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:10:59,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:10:59,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:10:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:10:59,502 INFO L87 Difference]: Start difference. First operand has 960 states, 679 states have (on average 1.5228276877761413) internal successors, (1034), 718 states have internal predecessors, (1034), 223 states have call successors, (223), 44 states have call predecessors, (223), 44 states have return successors, (223), 221 states have call predecessors, (223), 223 states have call successors, (223) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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-10-11 15:11:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:01,255 INFO L93 Difference]: Finished difference Result 1932 states and 3010 transitions. [2024-10-11 15:11:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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 66 [2024-10-11 15:11:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:01,275 INFO L225 Difference]: With dead ends: 1932 [2024-10-11 15:11:01,275 INFO L226 Difference]: Without dead ends: 939 [2024-10-11 15:11:01,285 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-10-11 15:11:01,289 INFO L432 NwaCegarLoop]: 993 mSDtfsCounter, 1551 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:01,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 1567 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 15:11:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-11 15:11:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 925. [2024-10-11 15:11:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 655 states have (on average 1.4732824427480915) internal successors, (965), 691 states have internal predecessors, (965), 213 states have call successors, (213), 44 states have call predecessors, (213), 44 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2024-10-11 15:11:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1391 transitions. [2024-10-11 15:11:01,395 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1391 transitions. Word has length 66 [2024-10-11 15:11:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:01,395 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1391 transitions. [2024-10-11 15:11:01,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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-10-11 15:11:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1391 transitions. [2024-10-11 15:11:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 15:11:01,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:01,402 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:01,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:11:01,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:01,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1382442139, now seen corresponding path program 1 times [2024-10-11 15:11:01,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:01,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812146301] [2024-10-11 15:11:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:01,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:01,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812146301] [2024-10-11 15:11:01,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812146301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:01,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:01,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:01,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669338160] [2024-10-11 15:11:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:01,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:01,699 INFO L87 Difference]: Start difference. First operand 925 states and 1391 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-10-11 15:11:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:03,918 INFO L93 Difference]: Finished difference Result 943 states and 1423 transitions. [2024-10-11 15:11:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:03,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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 66 [2024-10-11 15:11:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:03,923 INFO L225 Difference]: With dead ends: 943 [2024-10-11 15:11:03,923 INFO L226 Difference]: Without dead ends: 941 [2024-10-11 15:11:03,924 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-10-11 15:11:03,925 INFO L432 NwaCegarLoop]: 948 mSDtfsCounter, 397 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:03,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 3112 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 15:11:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-10-11 15:11:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 927. [2024-10-11 15:11:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 657 states have (on average 1.4718417047184171) internal successors, (967), 693 states have internal predecessors, (967), 213 states have call successors, (213), 44 states have call predecessors, (213), 44 states have return successors, (213), 211 states have call predecessors, (213), 213 states have call successors, (213) [2024-10-11 15:11:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1393 transitions. [2024-10-11 15:11:03,958 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1393 transitions. Word has length 66 [2024-10-11 15:11:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:03,959 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1393 transitions. [2024-10-11 15:11:03,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-10-11 15:11:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1393 transitions. [2024-10-11 15:11:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 15:11:03,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:03,961 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:03,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:11:03,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:03,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1242471176, now seen corresponding path program 1 times [2024-10-11 15:11:03,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:03,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492965084] [2024-10-11 15:11:03,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 15:11:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 15:11:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:04,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:04,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492965084] [2024-10-11 15:11:04,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492965084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:04,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818342227] [2024-10-11 15:11:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:04,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:04,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:04,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:04,089 INFO L87 Difference]: Start difference. First operand 927 states and 1393 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 15:11:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:05,819 INFO L93 Difference]: Finished difference Result 2325 states and 3565 transitions. [2024-10-11 15:11:05,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:05,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 68 [2024-10-11 15:11:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:05,825 INFO L225 Difference]: With dead ends: 2325 [2024-10-11 15:11:05,825 INFO L226 Difference]: Without dead ends: 1426 [2024-10-11 15:11:05,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:05,828 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 925 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:05,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 2255 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 15:11:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-10-11 15:11:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1396. [2024-10-11 15:11:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1001 states have (on average 1.4845154845154844) internal successors, (1486), 1054 states have internal predecessors, (1486), 338 states have call successors, (338), 44 states have call predecessors, (338), 44 states have return successors, (338), 335 states have call predecessors, (338), 338 states have call successors, (338) [2024-10-11 15:11:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2162 transitions. [2024-10-11 15:11:05,871 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2162 transitions. Word has length 68 [2024-10-11 15:11:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:05,872 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2162 transitions. [2024-10-11 15:11:05,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 15:11:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2162 transitions. [2024-10-11 15:11:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 15:11:05,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:05,874 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 15:11:05,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:11:05,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:05,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:05,874 INFO L85 PathProgramCache]: Analyzing trace with hash 890001953, now seen corresponding path program 1 times [2024-10-11 15:11:05,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:05,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745310256] [2024-10-11 15:11:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:06,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745310256] [2024-10-11 15:11:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745310256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:06,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:06,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388713080] [2024-10-11 15:11:06,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:06,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:06,082 INFO L87 Difference]: Start difference. First operand 1396 states and 2162 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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-10-11 15:11:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:07,966 INFO L93 Difference]: Finished difference Result 2796 states and 4352 transitions. [2024-10-11 15:11:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:07,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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 75 [2024-10-11 15:11:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:07,973 INFO L225 Difference]: With dead ends: 2796 [2024-10-11 15:11:07,973 INFO L226 Difference]: Without dead ends: 1428 [2024-10-11 15:11:07,976 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-10-11 15:11:07,977 INFO L432 NwaCegarLoop]: 934 mSDtfsCounter, 1484 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:07,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 2087 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 15:11:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-10-11 15:11:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1398. [2024-10-11 15:11:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1003 states have (on average 1.4835493519441676) internal successors, (1488), 1056 states have internal predecessors, (1488), 338 states have call successors, (338), 44 states have call predecessors, (338), 44 states have return successors, (338), 335 states have call predecessors, (338), 338 states have call successors, (338) [2024-10-11 15:11:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2164 transitions. [2024-10-11 15:11:08,076 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2164 transitions. Word has length 75 [2024-10-11 15:11:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:08,079 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2164 transitions. [2024-10-11 15:11:08,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 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-10-11 15:11:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2164 transitions. [2024-10-11 15:11:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 15:11:08,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:08,082 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:11:08,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:11:08,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:08,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash -52605181, now seen corresponding path program 1 times [2024-10-11 15:11:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:08,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158986078] [2024-10-11 15:11:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:08,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:08,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:08,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158986078] [2024-10-11 15:11:08,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158986078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:08,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:08,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:11:08,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512421980] [2024-10-11 15:11:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:08,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:11:08,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:08,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:11:08,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:08,303 INFO L87 Difference]: Start difference. First operand 1398 states and 2164 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-10-11 15:11:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:10,391 INFO L93 Difference]: Finished difference Result 1444 states and 2247 transitions. [2024-10-11 15:11:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:11:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 76 [2024-10-11 15:11:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:10,400 INFO L225 Difference]: With dead ends: 1444 [2024-10-11 15:11:10,400 INFO L226 Difference]: Without dead ends: 1442 [2024-10-11 15:11:10,401 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-10-11 15:11:10,402 INFO L432 NwaCegarLoop]: 943 mSDtfsCounter, 512 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 3784 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:10,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 3784 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 15:11:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2024-10-11 15:11:10,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1402. [2024-10-11 15:11:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1005 states have (on average 1.4825870646766168) internal successors, (1490), 1056 states have internal predecessors, (1490), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2170 transitions. [2024-10-11 15:11:10,454 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2170 transitions. Word has length 76 [2024-10-11 15:11:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:10,454 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2170 transitions. [2024-10-11 15:11:10,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-10-11 15:11:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2170 transitions. [2024-10-11 15:11:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 15:11:10,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:10,457 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] [2024-10-11 15:11:10,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:11:10,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:10,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:10,458 INFO L85 PathProgramCache]: Analyzing trace with hash 671980406, now seen corresponding path program 1 times [2024-10-11 15:11:10,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:10,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704952600] [2024-10-11 15:11:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 15:11:10,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704952600] [2024-10-11 15:11:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704952600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101598894] [2024-10-11 15:11:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:10,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:10,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:10,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:10,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:11:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:11,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:11:11,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101598894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:11,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:11,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 15:11:11,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442467894] [2024-10-11 15:11:11,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:11,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:11,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:11,091 INFO L87 Difference]: Start difference. First operand 1402 states and 2170 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 15:11:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:11,597 INFO L93 Difference]: Finished difference Result 2772 states and 4299 transitions. [2024-10-11 15:11:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:11,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-11 15:11:11,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:11,604 INFO L225 Difference]: With dead ends: 2772 [2024-10-11 15:11:11,605 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 15:11:11,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:11,610 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 0 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:11,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2581 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 15:11:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 15:11:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2024-10-11 15:11:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1002 states have (on average 1.4820359281437125) internal successors, (1485), 1052 states have internal predecessors, (1485), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2165 transitions. [2024-10-11 15:11:11,687 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2165 transitions. Word has length 84 [2024-10-11 15:11:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:11,687 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2165 transitions. [2024-10-11 15:11:11,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 15:11:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2165 transitions. [2024-10-11 15:11:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 15:11:11,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:11,690 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 15:11:11,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 15:11:11,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:11,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting get_currentErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:11,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash 792813936, now seen corresponding path program 1 times [2024-10-11 15:11:11,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:11,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550453002] [2024-10-11 15:11:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:11,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 15:11:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:11:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 15:11:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:12,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550453002] [2024-10-11 15:11:12,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550453002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:12,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:12,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:12,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083015052] [2024-10-11 15:11:12,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:12,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:12,011 INFO L87 Difference]: Start difference. First operand 1398 states and 2165 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:11:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:13,759 INFO L93 Difference]: Finished difference Result 2778 states and 4337 transitions. [2024-10-11 15:11:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:13,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 85 [2024-10-11 15:11:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:13,767 INFO L225 Difference]: With dead ends: 2778 [2024-10-11 15:11:13,767 INFO L226 Difference]: Without dead ends: 1408 [2024-10-11 15:11:13,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-10-11 15:11:13,772 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 387 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:13,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 2307 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 15:11:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-10-11 15:11:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1394. [2024-10-11 15:11:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 999 states have (on average 1.4814814814814814) internal successors, (1480), 1048 states have internal predecessors, (1480), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2160 transitions. [2024-10-11 15:11:13,811 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2160 transitions. Word has length 85 [2024-10-11 15:11:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:13,811 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2160 transitions. [2024-10-11 15:11:13,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 15:11:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2160 transitions. [2024-10-11 15:11:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 15:11:13,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:13,814 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] [2024-10-11 15:11:13,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:11:13,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1553195907, now seen corresponding path program 1 times [2024-10-11 15:11:13,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:13,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402549576] [2024-10-11 15:11:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:14,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:14,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 15:11:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 15:11:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:14,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402549576] [2024-10-11 15:11:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402549576] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290887729] [2024-10-11 15:11:14,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:14,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:14,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:14,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:11:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:14,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:14,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:11:14,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290887729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478520843] [2024-10-11 15:11:14,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:14,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:14,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:14,420 INFO L87 Difference]: Start difference. First operand 1394 states and 2160 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:11:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:14,801 INFO L93 Difference]: Finished difference Result 2760 states and 4283 transitions. [2024-10-11 15:11:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2024-10-11 15:11:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:14,808 INFO L225 Difference]: With dead ends: 2760 [2024-10-11 15:11:14,808 INFO L226 Difference]: Without dead ends: 1394 [2024-10-11 15:11:14,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:14,813 INFO L432 NwaCegarLoop]: 1284 mSDtfsCounter, 0 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:14,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2566 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 15:11:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-11 15:11:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-10-11 15:11:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 999 states have (on average 1.4784784784784786) internal successors, (1477), 1048 states have internal predecessors, (1477), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2157 transitions. [2024-10-11 15:11:14,849 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2157 transitions. Word has length 89 [2024-10-11 15:11:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:14,850 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2157 transitions. [2024-10-11 15:11:14,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:11:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2157 transitions. [2024-10-11 15:11:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 15:11:14,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:14,853 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] [2024-10-11 15:11:14,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 15:11:15,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:15,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:15,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash 717557302, now seen corresponding path program 1 times [2024-10-11 15:11:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404632608] [2024-10-11 15:11:15,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:15,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 15:11:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404632608] [2024-10-11 15:11:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404632608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210565341] [2024-10-11 15:11:15,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:15,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:15,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:15,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:15,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 15:11:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:15,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:15,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:11:15,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210565341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92907539] [2024-10-11 15:11:15,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:15,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:15,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:15,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:15,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:15,795 INFO L87 Difference]: Start difference. First operand 1394 states and 2157 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:16,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:16,126 INFO L93 Difference]: Finished difference Result 2756 states and 4273 transitions. [2024-10-11 15:11:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:16,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-10-11 15:11:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:16,133 INFO L225 Difference]: With dead ends: 2756 [2024-10-11 15:11:16,133 INFO L226 Difference]: Without dead ends: 1390 [2024-10-11 15:11:16,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:16,136 INFO L432 NwaCegarLoop]: 1281 mSDtfsCounter, 0 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:16,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2555 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 15:11:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-10-11 15:11:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1390. [2024-10-11 15:11:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 996 states have (on average 1.4779116465863453) internal successors, (1472), 1044 states have internal predecessors, (1472), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2152 transitions. [2024-10-11 15:11:16,172 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2152 transitions. Word has length 92 [2024-10-11 15:11:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:16,173 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2152 transitions. [2024-10-11 15:11:16,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:11:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2152 transitions. [2024-10-11 15:11:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 15:11:16,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:16,178 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:16,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 15:11:16,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:16,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:16,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash 363285868, now seen corresponding path program 1 times [2024-10-11 15:11:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:16,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198388442] [2024-10-11 15:11:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:16,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198388442] [2024-10-11 15:11:16,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198388442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:16,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280126730] [2024-10-11 15:11:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:16,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:16,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:16,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:16,525 INFO L87 Difference]: Start difference. First operand 1390 states and 2152 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-11 15:11:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:18,128 INFO L93 Difference]: Finished difference Result 2760 states and 4295 transitions. [2024-10-11 15:11:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:18,129 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), 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) Word has length 107 [2024-10-11 15:11:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:18,140 INFO L225 Difference]: With dead ends: 2760 [2024-10-11 15:11:18,140 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 15:11:18,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:18,144 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 384 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:18,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2271 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:11:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 15:11:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2024-10-11 15:11:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 991 states have (on average 1.4762865792129163) internal successors, (1463), 1038 states have internal predecessors, (1463), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2143 transitions. [2024-10-11 15:11:18,185 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2143 transitions. Word has length 107 [2024-10-11 15:11:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:18,185 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2143 transitions. [2024-10-11 15:11:18,186 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), 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) [2024-10-11 15:11:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2143 transitions. [2024-10-11 15:11:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 15:11:18,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:18,189 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:18,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 15:11:18,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sl_free_bufsErr2ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:18,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1052330697, now seen corresponding path program 1 times [2024-10-11 15:11:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762740105] [2024-10-11 15:11:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 15:11:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 15:11:18,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:18,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762740105] [2024-10-11 15:11:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762740105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:18,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632235296] [2024-10-11 15:11:18,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:18,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:18,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 15:11:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:18,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:18,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 15:11:18,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632235296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:18,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943346021] [2024-10-11 15:11:18,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:18,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:18,740 INFO L87 Difference]: Start difference. First operand 1384 states and 2143 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:11:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:19,360 INFO L93 Difference]: Finished difference Result 2740 states and 4249 transitions. [2024-10-11 15:11:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:19,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-10-11 15:11:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:19,368 INFO L225 Difference]: With dead ends: 2740 [2024-10-11 15:11:19,369 INFO L226 Difference]: Without dead ends: 1384 [2024-10-11 15:11:19,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:19,373 INFO L432 NwaCegarLoop]: 1271 mSDtfsCounter, 0 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:19,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 15:11:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-10-11 15:11:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2024-10-11 15:11:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 991 states have (on average 1.4732593340060545) internal successors, (1460), 1038 states have internal predecessors, (1460), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2140 transitions. [2024-10-11 15:11:19,412 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2140 transitions. Word has length 97 [2024-10-11 15:11:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:19,414 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2140 transitions. [2024-10-11 15:11:19,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:11:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2140 transitions. [2024-10-11 15:11:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 15:11:19,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:19,418 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:19,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 15:11:19,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 15:11:19,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:19,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 109287725, now seen corresponding path program 1 times [2024-10-11 15:11:19,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:19,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426011299] [2024-10-11 15:11:19,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:19,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:19,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:19,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426011299] [2024-10-11 15:11:19,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426011299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:19,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:19,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:19,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512988666] [2024-10-11 15:11:19,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:19,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:19,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:19,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:19,769 INFO L87 Difference]: Start difference. First operand 1384 states and 2140 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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) [2024-10-11 15:11:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:21,338 INFO L93 Difference]: Finished difference Result 2754 states and 4278 transitions. [2024-10-11 15:11:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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) Word has length 109 [2024-10-11 15:11:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:21,345 INFO L225 Difference]: With dead ends: 2754 [2024-10-11 15:11:21,346 INFO L226 Difference]: Without dead ends: 1398 [2024-10-11 15:11:21,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:21,351 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 384 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:21,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2241 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:11:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-11 15:11:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1384. [2024-10-11 15:11:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 991 states have (on average 1.467204843592331) internal successors, (1454), 1038 states have internal predecessors, (1454), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2134 transitions. [2024-10-11 15:11:21,384 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2134 transitions. Word has length 109 [2024-10-11 15:11:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2134 transitions. [2024-10-11 15:11:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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) [2024-10-11 15:11:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2134 transitions. [2024-10-11 15:11:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 15:11:21,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:21,388 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:21,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 15:11:21,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting sl_free_bufsErr2ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:21,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash 362167959, now seen corresponding path program 1 times [2024-10-11 15:11:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:21,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32926539] [2024-10-11 15:11:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 15:11:21,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32926539] [2024-10-11 15:11:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32926539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780483663] [2024-10-11 15:11:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:21,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:21,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:21,524 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:21,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 15:11:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:22,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 15:11:22,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:22,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780483663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:22,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:22,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:22,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158538156] [2024-10-11 15:11:22,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:22,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:22,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:22,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:22,035 INFO L87 Difference]: Start difference. First operand 1384 states and 2134 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 15:11:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:22,470 INFO L93 Difference]: Finished difference Result 2736 states and 4227 transitions. [2024-10-11 15:11:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:22,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-10-11 15:11:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:22,487 INFO L225 Difference]: With dead ends: 2736 [2024-10-11 15:11:22,491 INFO L226 Difference]: Without dead ends: 1380 [2024-10-11 15:11:22,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:22,498 INFO L432 NwaCegarLoop]: 1265 mSDtfsCounter, 0 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:22,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2523 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:11:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-10-11 15:11:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2024-10-11 15:11:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 988 states have (on average 1.4665991902834008) internal successors, (1449), 1034 states have internal predecessors, (1449), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2129 transitions. [2024-10-11 15:11:22,595 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2129 transitions. Word has length 100 [2024-10-11 15:11:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:22,595 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2129 transitions. [2024-10-11 15:11:22,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 15:11:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2129 transitions. [2024-10-11 15:11:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 15:11:22,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:22,599 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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-10-11 15:11:22,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 15:11:22,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 15:11:22,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:22,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash -951940388, now seen corresponding path program 1 times [2024-10-11 15:11:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:22,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477183240] [2024-10-11 15:11:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:22,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:22,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:22,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477183240] [2024-10-11 15:11:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477183240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:22,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061583809] [2024-10-11 15:11:22,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:22,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:22,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:22,926 INFO L87 Difference]: Start difference. First operand 1380 states and 2129 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-10-11 15:11:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:24,325 INFO L93 Difference]: Finished difference Result 2740 states and 4249 transitions. [2024-10-11 15:11:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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) Word has length 112 [2024-10-11 15:11:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:24,332 INFO L225 Difference]: With dead ends: 2740 [2024-10-11 15:11:24,332 INFO L226 Difference]: Without dead ends: 1388 [2024-10-11 15:11:24,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:24,336 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 384 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:24,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2237 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 15:11:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-11 15:11:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1374. [2024-10-11 15:11:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 983 states have (on average 1.4649033570701933) internal successors, (1440), 1028 states have internal predecessors, (1440), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2120 transitions. [2024-10-11 15:11:24,371 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2120 transitions. Word has length 112 [2024-10-11 15:11:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:24,371 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2120 transitions. [2024-10-11 15:11:24,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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) [2024-10-11 15:11:24,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2120 transitions. [2024-10-11 15:11:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 15:11:24,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:24,374 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:24,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 15:11:24,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:24,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1102758115, now seen corresponding path program 1 times [2024-10-11 15:11:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205758156] [2024-10-11 15:11:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:24,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205758156] [2024-10-11 15:11:24,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205758156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:24,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197250977] [2024-10-11 15:11:24,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:24,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:24,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:24,494 INFO L87 Difference]: Start difference. First operand 1374 states and 2120 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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) [2024-10-11 15:11:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:25,824 INFO L93 Difference]: Finished difference Result 2734 states and 4238 transitions. [2024-10-11 15:11:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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) Word has length 114 [2024-10-11 15:11:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:25,832 INFO L225 Difference]: With dead ends: 2734 [2024-10-11 15:11:25,832 INFO L226 Difference]: Without dead ends: 1388 [2024-10-11 15:11:25,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:25,836 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 384 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:25,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2224 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 15:11:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-11 15:11:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1374. [2024-10-11 15:11:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 983 states have (on average 1.4587995930824007) internal successors, (1434), 1028 states have internal predecessors, (1434), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2114 transitions. [2024-10-11 15:11:25,952 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2114 transitions. Word has length 114 [2024-10-11 15:11:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:25,952 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2114 transitions. [2024-10-11 15:11:25,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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) [2024-10-11 15:11:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2114 transitions. [2024-10-11 15:11:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 15:11:25,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:25,961 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 15:11:25,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 15:11:25,961 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting sl_free_bufsErr3ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:25,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:25,962 INFO L85 PathProgramCache]: Analyzing trace with hash -149991154, now seen corresponding path program 1 times [2024-10-11 15:11:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:25,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389462607] [2024-10-11 15:11:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:11:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 15:11:26,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:26,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389462607] [2024-10-11 15:11:26,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389462607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:26,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772325533] [2024-10-11 15:11:26,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:26,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:26,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:26,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:26,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 15:11:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:26,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:26,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 15:11:26,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772325533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529034153] [2024-10-11 15:11:26,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:26,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:26,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:26,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:26,471 INFO L87 Difference]: Start difference. First operand 1374 states and 2114 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 15:11:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:26,867 INFO L93 Difference]: Finished difference Result 2720 states and 4191 transitions. [2024-10-11 15:11:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:26,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2024-10-11 15:11:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:26,874 INFO L225 Difference]: With dead ends: 2720 [2024-10-11 15:11:26,874 INFO L226 Difference]: Without dead ends: 1374 [2024-10-11 15:11:26,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:26,878 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 0 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:26,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2502 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:11:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2024-10-11 15:11:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2024-10-11 15:11:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 983 states have (on average 1.4557477110885046) internal successors, (1431), 1028 states have internal predecessors, (1431), 340 states have call successors, (340), 44 states have call predecessors, (340), 44 states have return successors, (340), 337 states have call predecessors, (340), 340 states have call successors, (340) [2024-10-11 15:11:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2111 transitions. [2024-10-11 15:11:26,906 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2111 transitions. Word has length 105 [2024-10-11 15:11:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:26,906 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2111 transitions. [2024-10-11 15:11:26,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 15:11:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2111 transitions. [2024-10-11 15:11:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 15:11:26,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:26,910 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:26,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 15:11:27,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 15:11:27,112 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:27,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash 927811095, now seen corresponding path program 1 times [2024-10-11 15:11:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:27,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324146998] [2024-10-11 15:11:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 15:11:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 15:11:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 15:11:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 15:11:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:27,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:27,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324146998] [2024-10-11 15:11:27,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324146998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:27,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:27,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:27,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236174909] [2024-10-11 15:11:27,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:27,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:27,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:27,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:27,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:27,288 INFO L87 Difference]: Start difference. First operand 1374 states and 2111 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 15:11:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:29,981 INFO L93 Difference]: Finished difference Result 4054 states and 6258 transitions. [2024-10-11 15:11:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 104 [2024-10-11 15:11:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:29,993 INFO L225 Difference]: With dead ends: 4054 [2024-10-11 15:11:29,996 INFO L226 Difference]: Without dead ends: 2708 [2024-10-11 15:11:29,998 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-10-11 15:11:29,998 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1720 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1906 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:29,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1906 Valid, 2391 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 15:11:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2024-10-11 15:11:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2666. [2024-10-11 15:11:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 1913 states have (on average 1.4573967590172503) internal successors, (2788), 1996 states have internal predecessors, (2788), 659 states have call successors, (659), 87 states have call predecessors, (659), 87 states have return successors, (659), 653 states have call predecessors, (659), 659 states have call successors, (659) [2024-10-11 15:11:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4106 transitions. [2024-10-11 15:11:30,079 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4106 transitions. Word has length 104 [2024-10-11 15:11:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:30,079 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4106 transitions. [2024-10-11 15:11:30,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 15:11:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4106 transitions. [2024-10-11 15:11:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 15:11:30,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:30,085 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:30,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 15:11:30,085 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:30,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2120740402, now seen corresponding path program 1 times [2024-10-11 15:11:30,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:30,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743951090] [2024-10-11 15:11:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 15:11:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:11:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:11:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 15:11:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:11:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 15:11:30,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:30,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743951090] [2024-10-11 15:11:30,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743951090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:30,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:30,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:30,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711478757] [2024-10-11 15:11:30,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:30,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:30,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:30,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:30,202 INFO L87 Difference]: Start difference. First operand 2666 states and 4106 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-10-11 15:11:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:31,820 INFO L93 Difference]: Finished difference Result 4050 states and 6234 transitions. [2024-10-11 15:11:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:31,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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 106 [2024-10-11 15:11:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:31,828 INFO L225 Difference]: With dead ends: 4050 [2024-10-11 15:11:31,828 INFO L226 Difference]: Without dead ends: 1410 [2024-10-11 15:11:31,833 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-10-11 15:11:31,834 INFO L432 NwaCegarLoop]: 911 mSDtfsCounter, 384 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:31,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2992 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:11:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-10-11 15:11:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1390. [2024-10-11 15:11:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 993 states have (on average 1.4491440080563949) internal successors, (1439), 1038 states have internal predecessors, (1439), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2121 transitions. [2024-10-11 15:11:31,883 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2121 transitions. Word has length 106 [2024-10-11 15:11:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:31,883 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2121 transitions. [2024-10-11 15:11:31,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 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-10-11 15:11:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2121 transitions. [2024-10-11 15:11:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 15:11:31,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:31,887 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 15:11:31,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 15:11:31,887 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting sl_free_bufsErr3ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:31,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2072118375, now seen corresponding path program 1 times [2024-10-11 15:11:31,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:31,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685784784] [2024-10-11 15:11:31,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:11:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:11:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:11:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:11:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:11:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 15:11:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 15:11:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685784784] [2024-10-11 15:11:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685784784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476815919] [2024-10-11 15:11:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:32,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:32,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:32,007 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:32,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 15:11:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:32,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:11:32,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 15:11:32,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:32,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476815919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:32,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:32,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 15:11:32,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408517357] [2024-10-11 15:11:32,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:32,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:11:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:11:32,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:32,472 INFO L87 Difference]: Start difference. First operand 1390 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 15:11:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:32,918 INFO L93 Difference]: Finished difference Result 2732 states and 4189 transitions. [2024-10-11 15:11:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:11:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-11 15:11:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:32,924 INFO L225 Difference]: With dead ends: 2732 [2024-10-11 15:11:32,924 INFO L226 Difference]: Without dead ends: 1386 [2024-10-11 15:11:32,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:32,927 INFO L432 NwaCegarLoop]: 1244 mSDtfsCounter, 0 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:32,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2481 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:11:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-10-11 15:11:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1386. [2024-10-11 15:11:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 990 states have (on average 1.4484848484848485) internal successors, (1434), 1034 states have internal predecessors, (1434), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2116 transitions. [2024-10-11 15:11:32,971 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2116 transitions. Word has length 108 [2024-10-11 15:11:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:32,971 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2116 transitions. [2024-10-11 15:11:32,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 15:11:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2116 transitions. [2024-10-11 15:11:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 15:11:32,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:32,975 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:32,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 15:11:33,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:33,176 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:33,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash -308473827, now seen corresponding path program 1 times [2024-10-11 15:11:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:33,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497351121] [2024-10-11 15:11:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 15:11:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:11:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497351121] [2024-10-11 15:11:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497351121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348664567] [2024-10-11 15:11:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:33,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:33,328 INFO L87 Difference]: Start difference. First operand 1386 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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-10-11 15:11:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:34,939 INFO L93 Difference]: Finished difference Result 2790 states and 4295 transitions. [2024-10-11 15:11:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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 106 [2024-10-11 15:11:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:34,945 INFO L225 Difference]: With dead ends: 2790 [2024-10-11 15:11:34,945 INFO L226 Difference]: Without dead ends: 1448 [2024-10-11 15:11:34,950 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-10-11 15:11:34,951 INFO L432 NwaCegarLoop]: 899 mSDtfsCounter, 1417 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:34,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1994 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:11:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-10-11 15:11:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1392. [2024-10-11 15:11:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 996 states have (on average 1.4477911646586346) internal successors, (1442), 1040 states have internal predecessors, (1442), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2124 transitions. [2024-10-11 15:11:34,999 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2124 transitions. Word has length 106 [2024-10-11 15:11:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:34,999 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2124 transitions. [2024-10-11 15:11:34,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 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-10-11 15:11:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2124 transitions. [2024-10-11 15:11:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 15:11:35,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:35,004 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 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] [2024-10-11 15:11:35,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 15:11:35,004 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:35,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1219466608, now seen corresponding path program 1 times [2024-10-11 15:11:35,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:35,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985159811] [2024-10-11 15:11:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 15:11:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 15:11:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 15:11:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:11:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 15:11:35,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:35,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985159811] [2024-10-11 15:11:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985159811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632043342] [2024-10-11 15:11:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:35,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:35,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:35,171 INFO L87 Difference]: Start difference. First operand 1392 states and 2124 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-10-11 15:11:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:36,596 INFO L93 Difference]: Finished difference Result 2754 states and 4232 transitions. [2024-10-11 15:11:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:36,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 117 [2024-10-11 15:11:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:36,604 INFO L225 Difference]: With dead ends: 2754 [2024-10-11 15:11:36,605 INFO L226 Difference]: Without dead ends: 1406 [2024-10-11 15:11:36,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:36,609 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 384 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:36,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2169 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 15:11:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-11 15:11:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1386. [2024-10-11 15:11:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 991 states have (on average 1.4460141271442988) internal successors, (1433), 1034 states have internal predecessors, (1433), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2115 transitions. [2024-10-11 15:11:36,678 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2115 transitions. Word has length 117 [2024-10-11 15:11:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:36,680 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2115 transitions. [2024-10-11 15:11:36,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-10-11 15:11:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2115 transitions. [2024-10-11 15:11:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 15:11:36,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:36,684 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:36,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 15:11:36,684 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:36,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash -481793694, now seen corresponding path program 1 times [2024-10-11 15:11:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:36,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474338521] [2024-10-11 15:11:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:36,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 15:11:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 15:11:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 15:11:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 15:11:36,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474338521] [2024-10-11 15:11:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474338521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339771842] [2024-10-11 15:11:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:36,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:36,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:36,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:36,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:36,788 INFO L87 Difference]: Start difference. First operand 1386 states and 2115 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-10-11 15:11:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:37,989 INFO L93 Difference]: Finished difference Result 2748 states and 4234 transitions. [2024-10-11 15:11:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:37,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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 108 [2024-10-11 15:11:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:37,996 INFO L225 Difference]: With dead ends: 2748 [2024-10-11 15:11:37,996 INFO L226 Difference]: Without dead ends: 1406 [2024-10-11 15:11:37,999 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-10-11 15:11:38,003 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 381 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:38,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2186 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 15:11:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-10-11 15:11:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1386. [2024-10-11 15:11:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 991 states have (on average 1.442986881937437) internal successors, (1430), 1034 states have internal predecessors, (1430), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2112 transitions. [2024-10-11 15:11:38,051 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2112 transitions. Word has length 108 [2024-10-11 15:11:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:38,051 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2112 transitions. [2024-10-11 15:11:38,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-10-11 15:11:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2112 transitions. [2024-10-11 15:11:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 15:11:38,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:38,055 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:38,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 15:11:38,055 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:38,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash -227698928, now seen corresponding path program 1 times [2024-10-11 15:11:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997908981] [2024-10-11 15:11:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 15:11:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 15:11:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 15:11:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 15:11:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997908981] [2024-10-11 15:11:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997908981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:38,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23797976] [2024-10-11 15:11:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:38,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:38,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:38,249 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:38,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 15:11:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:38,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 15:11:38,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:38,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:11:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:39,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23797976] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:11:39,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:11:39,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 11 [2024-10-11 15:11:39,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726326982] [2024-10-11 15:11:39,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:11:39,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 15:11:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:39,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 15:11:39,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:11:39,017 INFO L87 Difference]: Start difference. First operand 1386 states and 2112 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-11 15:11:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:41,014 INFO L93 Difference]: Finished difference Result 2874 states and 4429 transitions. [2024-10-11 15:11:41,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:11:41,015 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 111 [2024-10-11 15:11:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:41,020 INFO L225 Difference]: With dead ends: 2874 [2024-10-11 15:11:41,020 INFO L226 Difference]: Without dead ends: 1532 [2024-10-11 15:11:41,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:11:41,023 INFO L432 NwaCegarLoop]: 888 mSDtfsCounter, 1552 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:41,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 2551 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 15:11:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-11 15:11:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1396. [2024-10-11 15:11:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1001 states have (on average 1.4425574425574426) internal successors, (1444), 1044 states have internal predecessors, (1444), 341 states have call successors, (341), 49 states have call predecessors, (341), 49 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2024-10-11 15:11:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2126 transitions. [2024-10-11 15:11:41,071 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2126 transitions. Word has length 111 [2024-10-11 15:11:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2126 transitions. [2024-10-11 15:11:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-11 15:11:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2126 transitions. [2024-10-11 15:11:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 15:11:41,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:41,075 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:41,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 15:11:41,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 15:11:41,276 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:41,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:41,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1808016481, now seen corresponding path program 2 times [2024-10-11 15:11:41,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957963183] [2024-10-11 15:11:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:11:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 15:11:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 15:11:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:11:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 15:11:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:41,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957963183] [2024-10-11 15:11:41,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957963183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546360191] [2024-10-11 15:11:41,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 15:11:41,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:41,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:41,480 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:41,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 15:11:41,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 15:11:41,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 15:11:41,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 15:11:41,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 15:11:41,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:11:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546360191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:41,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:11:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-10-11 15:11:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800136492] [2024-10-11 15:11:41,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:41,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:11:41,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:11:41,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:11:41,954 INFO L87 Difference]: Start difference. First operand 1396 states and 2126 transitions. Second operand has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:11:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:43,033 INFO L93 Difference]: Finished difference Result 2765 states and 4237 transitions. [2024-10-11 15:11:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:11:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-10-11 15:11:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:43,038 INFO L225 Difference]: With dead ends: 2765 [2024-10-11 15:11:43,038 INFO L226 Difference]: Without dead ends: 1402 [2024-10-11 15:11:43,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-10-11 15:11:43,041 INFO L432 NwaCegarLoop]: 1240 mSDtfsCounter, 41 mSDsluCounter, 6162 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 7402 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:43,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 7402 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 15:11:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2024-10-11 15:11:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1398. [2024-10-11 15:11:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1002 states have (on average 1.4421157684630739) internal successors, (1445), 1046 states have internal predecessors, (1445), 341 states have call successors, (341), 49 states have call predecessors, (341), 50 states have return successors, (342), 338 states have call predecessors, (342), 341 states have call successors, (342) [2024-10-11 15:11:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2128 transitions. [2024-10-11 15:11:43,182 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2128 transitions. Word has length 117 [2024-10-11 15:11:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:43,182 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2128 transitions. [2024-10-11 15:11:43,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 15:11:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2128 transitions. [2024-10-11 15:11:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 15:11:43,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:43,190 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 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-10-11 15:11:43,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 15:11:43,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:43,391 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:43,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash 207093645, now seen corresponding path program 1 times [2024-10-11 15:11:43,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:43,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466988376] [2024-10-11 15:11:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:43,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:11:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:11:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:11:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 15:11:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 15:11:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:11:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466988376] [2024-10-11 15:11:43,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466988376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:11:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146498858] [2024-10-11 15:11:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:43,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:11:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:11:43,760 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:11:43,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 15:11:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:44,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 15:11:44,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:11:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 15:11:44,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:11:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 15:11:44,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146498858] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:11:44,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:11:44,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2024-10-11 15:11:44,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144161706] [2024-10-11 15:11:44,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:11:44,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 15:11:44,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 15:11:44,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2024-10-11 15:11:44,531 INFO L87 Difference]: Start difference. First operand 1398 states and 2128 transitions. Second operand has 20 states, 20 states have (on average 8.45) internal successors, (169), 19 states have internal predecessors, (169), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-11 15:11:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:46,885 INFO L93 Difference]: Finished difference Result 3134 states and 4848 transitions. [2024-10-11 15:11:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 15:11:46,885 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.45) internal successors, (169), 19 states have internal predecessors, (169), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 119 [2024-10-11 15:11:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:46,892 INFO L225 Difference]: With dead ends: 3134 [2024-10-11 15:11:46,892 INFO L226 Difference]: Without dead ends: 1782 [2024-10-11 15:11:46,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=421, Unknown=0, NotChecked=0, Total=650 [2024-10-11 15:11:46,897 INFO L432 NwaCegarLoop]: 895 mSDtfsCounter, 1880 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:46,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 2652 Invalid, 2979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 15:11:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2024-10-11 15:11:46,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1422. [2024-10-11 15:11:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1026 states have (on average 1.4434697855750487) internal successors, (1481), 1070 states have internal predecessors, (1481), 341 states have call successors, (341), 49 states have call predecessors, (341), 50 states have return successors, (342), 338 states have call predecessors, (342), 341 states have call successors, (342) [2024-10-11 15:11:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2164 transitions. [2024-10-11 15:11:46,958 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2164 transitions. Word has length 119 [2024-10-11 15:11:46,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:46,959 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2164 transitions. [2024-10-11 15:11:46,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.45) internal successors, (169), 19 states have internal predecessors, (169), 4 states have call successors, (38), 4 states have call predecessors, (38), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-11 15:11:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2164 transitions. [2024-10-11 15:11:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 15:11:46,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:46,963 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:46,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 15:11:47,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 15:11:47,164 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:47,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:47,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1057670613, now seen corresponding path program 1 times [2024-10-11 15:11:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:47,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128308777] [2024-10-11 15:11:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:11:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:11:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 15:11:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:11:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 15:11:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 15:11:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 15:11:47,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128308777] [2024-10-11 15:11:47,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128308777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:47,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:47,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:11:47,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813234893] [2024-10-11 15:11:47,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:47,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:11:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:11:47,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:11:47,597 INFO L87 Difference]: Start difference. First operand 1422 states and 2164 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-10-11 15:11:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:49,856 INFO L93 Difference]: Finished difference Result 2818 states and 4318 transitions. [2024-10-11 15:11:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:11:49,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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 122 [2024-10-11 15:11:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:49,861 INFO L225 Difference]: With dead ends: 2818 [2024-10-11 15:11:49,861 INFO L226 Difference]: Without dead ends: 1442 [2024-10-11 15:11:49,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-10-11 15:11:49,863 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 381 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:49,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2930 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 15:11:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2024-10-11 15:11:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1426. [2024-10-11 15:11:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1030 states have (on average 1.441747572815534) internal successors, (1485), 1074 states have internal predecessors, (1485), 341 states have call successors, (341), 49 states have call predecessors, (341), 50 states have return successors, (342), 338 states have call predecessors, (342), 341 states have call successors, (342) [2024-10-11 15:11:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2168 transitions. [2024-10-11 15:11:49,946 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2168 transitions. Word has length 122 [2024-10-11 15:11:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:49,947 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 2168 transitions. [2024-10-11 15:11:49,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-10-11 15:11:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2168 transitions. [2024-10-11 15:11:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 15:11:49,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:49,950 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:11:49,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 15:11:49,950 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:49,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2006933234, now seen corresponding path program 1 times [2024-10-11 15:11:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:49,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731448259] [2024-10-11 15:11:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:11:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:11:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:11:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 15:11:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 15:11:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:11:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 15:11:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 15:11:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 15:11:50,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:50,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731448259] [2024-10-11 15:11:50,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731448259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:50,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:50,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:50,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768823316] [2024-10-11 15:11:50,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:50,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:50,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:50,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:50,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:50,053 INFO L87 Difference]: Start difference. First operand 1426 states and 2168 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 15:11:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:51,628 INFO L93 Difference]: Finished difference Result 2826 states and 4328 transitions. [2024-10-11 15:11:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:51,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-10-11 15:11:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:51,634 INFO L225 Difference]: With dead ends: 2826 [2024-10-11 15:11:51,634 INFO L226 Difference]: Without dead ends: 1446 [2024-10-11 15:11:51,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:51,636 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 382 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:51,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 2167 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:11:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-10-11 15:11:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1430. [2024-10-11 15:11:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1034 states have (on average 1.4400386847195359) internal successors, (1489), 1078 states have internal predecessors, (1489), 341 states have call successors, (341), 49 states have call predecessors, (341), 50 states have return successors, (342), 338 states have call predecessors, (342), 341 states have call successors, (342) [2024-10-11 15:11:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2172 transitions. [2024-10-11 15:11:51,770 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2172 transitions. Word has length 126 [2024-10-11 15:11:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:51,771 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 2172 transitions. [2024-10-11 15:11:51,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 15:11:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2172 transitions. [2024-10-11 15:11:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 15:11:51,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:51,777 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 15:11:51,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 15:11:51,777 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:51,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1715626246, now seen corresponding path program 1 times [2024-10-11 15:11:51,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:51,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051591739] [2024-10-11 15:11:51,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:51,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:11:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:11:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 15:11:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 15:11:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 15:11:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 15:11:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:11:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 15:11:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 15:11:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 15:11:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:52,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051591739] [2024-10-11 15:11:52,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051591739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:52,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:52,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:11:52,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760697603] [2024-10-11 15:11:52,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:52,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:11:52,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:52,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:11:52,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:11:52,251 INFO L87 Difference]: Start difference. First operand 1430 states and 2172 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:11:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:54,332 INFO L93 Difference]: Finished difference Result 2836 states and 4336 transitions. [2024-10-11 15:11:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:11:54,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-10-11 15:11:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:54,338 INFO L225 Difference]: With dead ends: 2836 [2024-10-11 15:11:54,338 INFO L226 Difference]: Without dead ends: 1452 [2024-10-11 15:11:54,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:11:54,340 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 382 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:54,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 3688 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 15:11:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-10-11 15:11:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1436. [2024-10-11 15:11:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1039 states have (on average 1.4379210779595766) internal successors, (1494), 1082 states have internal predecessors, (1494), 341 states have call successors, (341), 49 states have call predecessors, (341), 51 states have return successors, (348), 340 states have call predecessors, (348), 341 states have call successors, (348) [2024-10-11 15:11:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2183 transitions. [2024-10-11 15:11:54,389 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2183 transitions. Word has length 134 [2024-10-11 15:11:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:54,389 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2183 transitions. [2024-10-11 15:11:54,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:11:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2183 transitions. [2024-10-11 15:11:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 15:11:54,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:54,393 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2024-10-11 15:11:54,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 15:11:54,393 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:54,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1685993242, now seen corresponding path program 2 times [2024-10-11 15:11:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997427116] [2024-10-11 15:11:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 15:11:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 15:11:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 15:11:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:11:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 15:11:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 15:11:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 15:11:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 15:11:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 15:11:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 15:11:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 15:11:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 15:11:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:11:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997427116] [2024-10-11 15:11:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997427116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:11:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:11:54,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:11:54,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139542518] [2024-10-11 15:11:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:11:54,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:11:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:11:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:11:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:54,610 INFO L87 Difference]: Start difference. First operand 1436 states and 2183 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:11:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:11:56,056 INFO L93 Difference]: Finished difference Result 2862 states and 4368 transitions. [2024-10-11 15:11:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:11:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-10-11 15:11:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:11:56,062 INFO L225 Difference]: With dead ends: 2862 [2024-10-11 15:11:56,062 INFO L226 Difference]: Without dead ends: 1450 [2024-10-11 15:11:56,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:11:56,064 INFO L432 NwaCegarLoop]: 895 mSDtfsCounter, 383 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:11:56,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2178 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 15:11:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2024-10-11 15:11:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1436. [2024-10-11 15:11:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1039 states have (on average 1.436958614051973) internal successors, (1493), 1082 states have internal predecessors, (1493), 341 states have call successors, (341), 49 states have call predecessors, (341), 51 states have return successors, (348), 340 states have call predecessors, (348), 341 states have call successors, (348) [2024-10-11 15:11:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2182 transitions. [2024-10-11 15:11:56,111 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2182 transitions. Word has length 136 [2024-10-11 15:11:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:11:56,112 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2182 transitions. [2024-10-11 15:11:56,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:11:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2182 transitions. [2024-10-11 15:11:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 15:11:56,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:11:56,115 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2024-10-11 15:11:56,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 15:11:56,116 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:11:56,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:11:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1509446013, now seen corresponding path program 1 times [2024-10-11 15:11:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:11:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190153443] [2024-10-11 15:11:56,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:11:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:11:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:11:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 15:11:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:11:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:11:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 15:11:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:11:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 15:11:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 15:11:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:11:59,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 15:11:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 15:12:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 15:12:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 15:12:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:12:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 15:12:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 15:12:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 15:12:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 15:12:00,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:12:00,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190153443] [2024-10-11 15:12:00,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190153443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:12:00,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371313914] [2024-10-11 15:12:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:12:00,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:12:00,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:12:00,149 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:12:00,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 15:12:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:12:00,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 145 conjuncts are in the unsatisfiable core [2024-10-11 15:12:00,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:12:00,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 15:12:01,044 INFO L349 Elim1Store]: treesize reduction 67, result has 21.2 percent of original size [2024-10-11 15:12:01,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2024-10-11 15:12:01,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-10-11 15:12:01,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-10-11 15:12:01,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-10-11 15:12:01,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 15:12:01,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 15:12:01,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-10-11 15:12:01,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 15:12:01,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-10-11 15:12:01,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 15:12:01,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 15:12:01,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 15:12:01,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2024-10-11 15:12:01,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:01,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-10-11 15:12:01,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 15:12:01,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 15:12:01,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 15:12:01,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 15:12:01,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-11 15:12:01,805 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 15:12:01,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 21 [2024-10-11 15:12:01,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-11 15:12:02,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-10-11 15:12:02,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-10-11 15:12:02,069 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 15:12:02,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2024-10-11 15:12:02,246 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 15:12:02,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 43 [2024-10-11 15:12:02,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2024-10-11 15:12:02,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2024-10-11 15:12:02,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2024-10-11 15:12:02,271 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 15:12:02,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-10-11 15:12:02,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 15:12:02,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2024-10-11 15:12:02,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:02,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 15:12:02,429 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 15:12:02,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2024-10-11 15:12:02,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:02,440 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-10-11 15:12:02,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2024-10-11 15:12:02,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-10-11 15:12:02,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:02,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 15:12:02,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 15:12:02,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 15:12:02,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 15:12:02,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 15:12:02,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 15:12:02,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 15:12:03,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:03,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 72 [2024-10-11 15:12:03,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 15:12:03,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 15:12:03,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 29 [2024-10-11 15:12:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 15:12:03,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:12:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371313914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:12:03,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 15:12:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 53 [2024-10-11 15:12:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757304351] [2024-10-11 15:12:03,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 15:12:03,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-11 15:12:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:12:03,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-11 15:12:03,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2658, Unknown=28, NotChecked=0, Total=2862 [2024-10-11 15:12:03,468 INFO L87 Difference]: Start difference. First operand 1436 states and 2182 transitions. Second operand has 53 states, 46 states have (on average 3.760869565217391) internal successors, (173), 43 states have internal predecessors, (173), 17 states have call successors, (32), 7 states have call predecessors, (32), 11 states have return successors, (30), 20 states have call predecessors, (30), 17 states have call successors, (30)