./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-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.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 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:24:47,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:24:47,816 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:24:47,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:24:47,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:24:47,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:24:47,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:24:47,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:24:47,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:24:47,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:24:47,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:24:47,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:24:47,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:24:47,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:24:47,868 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:24:47,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:24:47,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:24:47,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:24:47,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:24:47,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:24:47,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:24:47,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:24:47,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:24:47,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:24:47,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:24:47,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:24:47,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:24:47,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:24:47,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:24:47,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:24:47,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:24:47,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:24:47,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:24:47,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:24:47,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:24:47,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:24:47,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:24:47,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:24:47,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:24:47,876 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 -> 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e [2024-10-11 15:24:48,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:24:48,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:24:48,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:24:48,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:24:48,156 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:24:48,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2024-10-11 15:24:49,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:24:50,204 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:24:50,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2024-10-11 15:24:50,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/edcd2f315/2daaa5b77fda41e18b18aed8824cedf9/FLAGf876dc603 [2024-10-11 15:24:50,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/edcd2f315/2daaa5b77fda41e18b18aed8824cedf9 [2024-10-11 15:24:50,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:24:50,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:24:50,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:24:50,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:24:50,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:24:50,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:24:50" (1/1) ... [2024-10-11 15:24:50,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fde1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:50, skipping insertion in model container [2024-10-11 15:24:50,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:24:50" (1/1) ... [2024-10-11 15:24:50,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:24:51,018 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-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2024-10-11 15:24:51,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:24:51,766 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:24:51,850 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4690] [2024-10-11 15:24:51,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4697] [2024-10-11 15:24:51,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; bts %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4705-4706] [2024-10-11 15:24:51,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.previous\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4714-4715] [2024-10-11 15:24:51,857 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-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2024-10-11 15:24:51,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4838] [2024-10-11 15:24:51,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4841] [2024-10-11 15:24:51,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4844] [2024-10-11 15:24:51,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4847] [2024-10-11 15:24:51,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5229] [2024-10-11 15:24:51,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5233] [2024-10-11 15:24:51,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5237] [2024-10-11 15:24:51,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5241] [2024-10-11 15:24:51,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5252] [2024-10-11 15:24:51,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5256] [2024-10-11 15:24:51,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5260] [2024-10-11 15:24:51,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5264] [2024-10-11 15:24:51,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5275] [2024-10-11 15:24:51,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5279] [2024-10-11 15:24:51,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5283] [2024-10-11 15:24:51,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5287] [2024-10-11 15:24:51,889 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5298] [2024-10-11 15:24:51,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5302] [2024-10-11 15:24:51,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5306] [2024-10-11 15:24:51,890 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5310] [2024-10-11 15:24:51,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5360] [2024-10-11 15:24:51,893 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5364] [2024-10-11 15:24:51,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5368] [2024-10-11 15:24:51,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5372] [2024-10-11 15:24:51,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5383] [2024-10-11 15:24:51,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5387] [2024-10-11 15:24:51,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5391] [2024-10-11 15:24:51,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5395] [2024-10-11 15:24:51,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5406] [2024-10-11 15:24:51,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5410] [2024-10-11 15:24:51,901 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5414] [2024-10-11 15:24:51,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5418] [2024-10-11 15:24:51,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___2), "+m" (*__ptr___11): "0" (__x___2): "memory"); [5429] [2024-10-11 15:24:51,902 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___2), "+m" (*__ptr___12): "0" (__x___2): "memory"); [5433] [2024-10-11 15:24:51,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___2), "+m" (*__ptr___13): "0" (__x___2): "memory"); [5437] [2024-10-11 15:24:51,903 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___2), "+m" (*__ptr___14): "0" (__x___2): "memory"); [5441] [2024-10-11 15:24:51,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5515] [2024-10-11 15:24:51,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5519] [2024-10-11 15:24:51,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5523] [2024-10-11 15:24:51,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5527] [2024-10-11 15:24:51,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___0), "+m" (*__ptr___3): "0" (__x___0): "memory"); [5538] [2024-10-11 15:24:51,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___0), "+m" (*__ptr___4): "0" (__x___0): "memory"); [5542] [2024-10-11 15:24:51,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___0), "+m" (*__ptr___5): "0" (__x___0): "memory"); [5546] [2024-10-11 15:24:51,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5550] [2024-10-11 15:24:51,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x___1), "+m" (*__ptr___7): "0" (__x___1): "memory"); [5561] [2024-10-11 15:24:51,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5565] [2024-10-11 15:24:51,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x___1), "+m" (*__ptr___9): "0" (__x___1): "memory"); [5569] [2024-10-11 15:24:51,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___1), "+m" (*__ptr___10): "0" (__x___1): "memory"); [5573] [2024-10-11 15:24:51,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6512] [2024-10-11 15:24:51,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6515] [2024-10-11 15:24:51,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6518] [2024-10-11 15:24:51,995 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6521] [2024-10-11 15:24:51,996 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (p): "ebx"); [6524] [2024-10-11 15:24:51,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6537] [2024-10-11 15:24:51,997 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6540] [2024-10-11 15:24:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6543] [2024-10-11 15:24:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6546] [2024-10-11 15:24:51,998 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu), "=d" (__val_gu): "0" (p)); [6549] [2024-10-11 15:24:51,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6571] [2024-10-11 15:24:52,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6574] [2024-10-11 15:24:52,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6577] [2024-10-11 15:24:52,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6580] [2024-10-11 15:24:52,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___0), "=d" (__val_gu___0): "0" (p)); [6583] [2024-10-11 15:24:52,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6616-6617] [2024-10-11 15:24:52,006 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6620-6621] [2024-10-11 15:24:52,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6624-6625] [2024-10-11 15:24:52,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6628-6629] [2024-10-11 15:24:52,007 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (p): "ebx"); [6632-6633] [2024-10-11 15:24:52,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_1": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6646] [2024-10-11 15:24:52,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_2": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6649] [2024-10-11 15:24:52,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_4": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6652] [2024-10-11 15:24:52,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_8": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6655] [2024-10-11 15:24:52,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_X": "=a" (__ret_gu___1), "=d" (__val_gu___1): "0" (p)); [6658] [2024-10-11 15:24:52,009 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6691-6692] [2024-10-11 15:24:52,010 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6695-6696] [2024-10-11 15:24:52,010 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6699-6700] [2024-10-11 15:24:52,010 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6703-6704] [2024-10-11 15:24:52,010 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (p): "ebx"); [6707-6708] [2024-10-11 15:24:52,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:24:52,207 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:24:52,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52 WrapperNode [2024-10-11 15:24:52,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:24:52,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:24:52,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:24:52,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:24:52,217 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:24:52" (1/1) ... [2024-10-11 15:24:52,282 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:24:52" (1/1) ... [2024-10-11 15:24:52,460 INFO L138 Inliner]: procedures = 184, calls = 827, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3442 [2024-10-11 15:24:52,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:24:52,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:24:52,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:24:52,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:24:52,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:52,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:52,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:52,976 INFO L175 MemorySlicer]: Split 415 memory accesses to 9 slices as follows [2, 4, 1, 3, 347, 1, 35, 20, 2]. 84 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 0, 0, 0, 5, 0, 35, 20, 0]. The 122 writes are split as follows [0, 1, 1, 0, 120, 0, 0, 0, 0]. [2024-10-11 15:24:52,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:52,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:53,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:53,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:53,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:53,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:53,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:24:53,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:24:53,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:24:53,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:24:53,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (1/1) ... [2024-10-11 15:24:53,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:24:53,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:24:53,216 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:24:53,222 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:24:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2024-10-11 15:24:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2024-10-11 15:24:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2024-10-11 15:24:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2024-10-11 15:24:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 15:24:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 15:24:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 15:24:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 15:24:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 15:24:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 15:24:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 15:24:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 15:24:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-11 15:24:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2024-10-11 15:24:53,277 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2024-10-11 15:24:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 15:24:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 15:24:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-11 15:24:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-11 15:24:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-11 15:24:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 15:24:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:24:53,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:24:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-11 15:24:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2024-10-11 15:24:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2024-10-11 15:24:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:24:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:24:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:24:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:24:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:24:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-11 15:24:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-11 15:24:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-11 15:24:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-11 15:24:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-11 15:24:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-11 15:24:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-11 15:24:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-11 15:24:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-10-11 15:24:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2024-10-11 15:24:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2024-10-11 15:24:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:24:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:24:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-10-11 15:24:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-10-11 15:24:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2024-10-11 15:24:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2024-10-11 15:24:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:24:53,288 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:24:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2024-10-11 15:24:53,289 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2024-10-11 15:24:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:24:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:24:53,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:24:53,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:24:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2024-10-11 15:24:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2024-10-11 15:24:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:24:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:24:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-11 15:24:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-11 15:24:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2024-10-11 15:24:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2024-10-11 15:24:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:24:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2024-10-11 15:24:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2024-10-11 15:24:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2024-10-11 15:24:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2024-10-11 15:24:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2024-10-11 15:24:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2024-10-11 15:24:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-11 15:24:53,317 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2024-10-11 15:24:53,317 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:24:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2024-10-11 15:24:53,318 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2024-10-11 15:24:53,318 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2024-10-11 15:24:53,318 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2024-10-11 15:24:53,318 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:24:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:24:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:24:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:24:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2024-10-11 15:24:53,319 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2024-10-11 15:24:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-10-11 15:24:53,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2024-10-11 15:24:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2024-10-11 15:24:53,320 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2024-10-11 15:24:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2024-10-11 15:24:53,320 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2024-10-11 15:24:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2024-10-11 15:24:53,320 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2024-10-11 15:24:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:24:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2024-10-11 15:24:53,321 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:24:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:24:53,322 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2024-10-11 15:24:53,322 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2024-10-11 15:24:53,322 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-10-11 15:24:53,322 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-10-11 15:24:53,322 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 15:24:53,322 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 15:24:53,322 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2024-10-11 15:24:53,322 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2024-10-11 15:24:53,322 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2024-10-11 15:24:53,323 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2024-10-11 15:24:53,323 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-10-11 15:24:53,323 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-10-11 15:24:53,323 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2024-10-11 15:24:53,323 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2024-10-11 15:24:53,323 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-11 15:24:53,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-11 15:24:53,323 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-11 15:24:53,323 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-11 15:24:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-11 15:24:53,324 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-11 15:24:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2024-10-11 15:24:53,324 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2024-10-11 15:24:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-10-11 15:24:53,324 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-10-11 15:24:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:24:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2024-10-11 15:24:53,325 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2024-10-11 15:24:53,325 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2024-10-11 15:24:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2024-10-11 15:24:53,326 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2024-10-11 15:24:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-11 15:24:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-11 15:24:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-11 15:24:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-11 15:24:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-11 15:24:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-11 15:24:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-11 15:24:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-11 15:24:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-10-11 15:24:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-11 15:24:53,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-11 15:24:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:24:53,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:24:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2024-10-11 15:24:53,327 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2024-10-11 15:24:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2024-10-11 15:24:53,327 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2024-10-11 15:24:53,914 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:24:53,917 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:24:54,062 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:24:58,536 INFO L? ?]: Removed 1529 outVars from TransFormulas that were not future-live. [2024-10-11 15:24:58,537 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:24:58,699 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:24:58,699 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-11 15:24:58,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:24:58 BoogieIcfgContainer [2024-10-11 15:24:58,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:24:58,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:24:58,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:24:58,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:24:58,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:24:50" (1/3) ... [2024-10-11 15:24:58,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574b0113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:24:58, skipping insertion in model container [2024-10-11 15:24:58,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:24:52" (2/3) ... [2024-10-11 15:24:58,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574b0113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:24:58, skipping insertion in model container [2024-10-11 15:24:58,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:24:58" (3/3) ... [2024-10-11 15:24:58,708 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2024-10-11 15:24:58,726 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:24:58,726 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-11 15:24:58,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:24:58,836 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;@2492efe3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:24:58,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-11 15:24:58,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 1068 states, 757 states have (on average 1.5204755614266843) internal successors, (1151), 802 states have internal predecessors, (1151), 245 states have call successors, (245), 53 states have call predecessors, (245), 52 states have return successors, (240), 238 states have call predecessors, (240), 240 states have call successors, (240) [2024-10-11 15:24:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 15:24:58,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:24:58,871 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:24:58,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:24:58,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:24:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash 32790866, now seen corresponding path program 1 times [2024-10-11 15:24:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:24:58,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368793140] [2024-10-11 15:24:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:24:58,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:24:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:24:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:24:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:24:59,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:24:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:24:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:24:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:24:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:24:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:24:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:24:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:24:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:24:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:24:59,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:24:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:24:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 15:24:59,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:24:59,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368793140] [2024-10-11 15:24:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368793140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:24:59,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:24:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:24:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240602738] [2024-10-11 15:24:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:24:59,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:24:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:24:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:24:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:24:59,463 INFO L87 Difference]: Start difference. First operand has 1068 states, 757 states have (on average 1.5204755614266843) internal successors, (1151), 802 states have internal predecessors, (1151), 245 states have call successors, (245), 53 states have call predecessors, (245), 52 states have return successors, (240), 238 states have call predecessors, (240), 240 states have call successors, (240) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 15:25:05,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:25:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:06,763 INFO L93 Difference]: Finished difference Result 2889 states and 4498 transitions. [2024-10-11 15:25:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:25:06,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-10-11 15:25:06,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:06,795 INFO L225 Difference]: With dead ends: 2889 [2024-10-11 15:25:06,796 INFO L226 Difference]: Without dead ends: 1747 [2024-10-11 15:25:06,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:25:06,816 INFO L432 NwaCegarLoop]: 1154 mSDtfsCounter, 1421 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:06,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 2661 Invalid, 2205 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [512 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-10-11 15:25:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2024-10-11 15:25:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1566. [2024-10-11 15:25:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1105 states have (on average 1.4588235294117646) internal successors, (1612), 1150 states have internal predecessors, (1612), 358 states have call successors, (358), 91 states have call predecessors, (358), 90 states have return successors, (357), 354 states have call predecessors, (357), 357 states have call successors, (357) [2024-10-11 15:25:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2327 transitions. [2024-10-11 15:25:07,061 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2327 transitions. Word has length 60 [2024-10-11 15:25:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:07,062 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2327 transitions. [2024-10-11 15:25:07,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 15:25:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2327 transitions. [2024-10-11 15:25:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 15:25:07,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:07,067 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:25:07,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:25:07,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:07,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:07,069 INFO L85 PathProgramCache]: Analyzing trace with hash 139890574, now seen corresponding path program 1 times [2024-10-11 15:25:07,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:07,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993043776] [2024-10-11 15:25:07,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:07,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 15:25:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 15:25:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:07,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993043776] [2024-10-11 15:25:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993043776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:07,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:07,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:25:07,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931681932] [2024-10-11 15:25:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:07,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:25:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:07,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:25:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:25:07,244 INFO L87 Difference]: Start difference. First operand 1566 states and 2327 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 15:25:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:12,567 INFO L93 Difference]: Finished difference Result 4327 states and 6448 transitions. [2024-10-11 15:25:12,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:25:12,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2024-10-11 15:25:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:12,586 INFO L225 Difference]: With dead ends: 4327 [2024-10-11 15:25:12,586 INFO L226 Difference]: Without dead ends: 2782 [2024-10-11 15:25:12,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:25:12,594 INFO L432 NwaCegarLoop]: 1488 mSDtfsCounter, 1595 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:12,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 3067 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-11 15:25:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2024-10-11 15:25:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2543. [2024-10-11 15:25:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 1804 states have (on average 1.4595343680709534) internal successors, (2633), 1874 states have internal predecessors, (2633), 567 states have call successors, (567), 160 states have call predecessors, (567), 159 states have return successors, (566), 559 states have call predecessors, (566), 566 states have call successors, (566) [2024-10-11 15:25:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 3766 transitions. [2024-10-11 15:25:12,730 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 3766 transitions. Word has length 64 [2024-10-11 15:25:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:12,731 INFO L471 AbstractCegarLoop]: Abstraction has 2543 states and 3766 transitions. [2024-10-11 15:25:12,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 15:25:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3766 transitions. [2024-10-11 15:25:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 15:25:12,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:12,736 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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] [2024-10-11 15:25:12,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:25:12,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting get_currentErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:12,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash -592686795, now seen corresponding path program 1 times [2024-10-11 15:25:12,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:12,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796025530] [2024-10-11 15:25:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:12,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:12,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:12,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:12,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 15:25:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 15:25:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 15:25:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 15:25:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 15:25:13,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796025530] [2024-10-11 15:25:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796025530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:13,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:13,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:25:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260157442] [2024-10-11 15:25:13,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:13,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:25:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:13,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:25:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:25:13,114 INFO L87 Difference]: Start difference. First operand 2543 states and 3766 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:25:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:16,300 INFO L93 Difference]: Finished difference Result 5272 states and 7896 transitions. [2024-10-11 15:25:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:25:16,300 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-11 15:25:16,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:16,319 INFO L225 Difference]: With dead ends: 5272 [2024-10-11 15:25:16,319 INFO L226 Difference]: Without dead ends: 2750 [2024-10-11 15:25:16,329 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:25:16,331 INFO L432 NwaCegarLoop]: 1108 mSDtfsCounter, 442 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:16,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 2585 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 15:25:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2024-10-11 15:25:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2533. [2024-10-11 15:25:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 1795 states have (on average 1.457381615598886) internal successors, (2616), 1864 states have internal predecessors, (2616), 567 states have call successors, (567), 160 states have call predecessors, (567), 159 states have return successors, (566), 559 states have call predecessors, (566), 566 states have call successors, (566) [2024-10-11 15:25:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3749 transitions. [2024-10-11 15:25:16,442 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3749 transitions. Word has length 110 [2024-10-11 15:25:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:16,443 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3749 transitions. [2024-10-11 15:25:16,444 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 15:25:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3749 transitions. [2024-10-11 15:25:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 15:25:16,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:16,448 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-10-11 15:25:16,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:25:16,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:16,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1887491261, now seen corresponding path program 1 times [2024-10-11 15:25:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325193703] [2024-10-11 15:25:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 15:25:16,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:16,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325193703] [2024-10-11 15:25:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325193703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:16,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:16,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:25:16,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230756049] [2024-10-11 15:25:16,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:16,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:25:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:25:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:25:16,760 INFO L87 Difference]: Start difference. First operand 2533 states and 3749 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 15:25:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:19,502 INFO L93 Difference]: Finished difference Result 5306 states and 7911 transitions. [2024-10-11 15:25:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:25:19,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 111 [2024-10-11 15:25:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:19,521 INFO L225 Difference]: With dead ends: 5306 [2024-10-11 15:25:19,521 INFO L226 Difference]: Without dead ends: 2794 [2024-10-11 15:25:19,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:25:19,531 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 1805 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:19,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 2073 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 15:25:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2024-10-11 15:25:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2533. [2024-10-11 15:25:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 1795 states have (on average 1.4551532033426184) internal successors, (2612), 1864 states have internal predecessors, (2612), 567 states have call successors, (567), 160 states have call predecessors, (567), 159 states have return successors, (566), 559 states have call predecessors, (566), 566 states have call successors, (566) [2024-10-11 15:25:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 3745 transitions. [2024-10-11 15:25:19,647 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 3745 transitions. Word has length 111 [2024-10-11 15:25:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:19,650 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 3745 transitions. [2024-10-11 15:25:19,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 15:25:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 3745 transitions. [2024-10-11 15:25:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 15:25:19,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:19,654 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-10-11 15:25:19,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:25:19,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:19,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1685667327, now seen corresponding path program 1 times [2024-10-11 15:25:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:19,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349085938] [2024-10-11 15:25:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-11 15:25:19,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349085938] [2024-10-11 15:25:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349085938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:19,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:25:19,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850917874] [2024-10-11 15:25:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:19,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:25:19,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:25:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:19,979 INFO L87 Difference]: Start difference. First operand 2533 states and 3745 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 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:25:23,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:25:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:24,966 INFO L93 Difference]: Finished difference Result 2801 states and 4195 transitions. [2024-10-11 15:25:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:25:24,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 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 111 [2024-10-11 15:25:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:24,983 INFO L225 Difference]: With dead ends: 2801 [2024-10-11 15:25:24,984 INFO L226 Difference]: Without dead ends: 2798 [2024-10-11 15:25:24,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:24,986 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 550 mSDsluCounter, 2864 mSDsCounter, 0 mSdLazyCounter, 2761 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:24,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 3881 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2761 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 15:25:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-11 15:25:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2537. [2024-10-11 15:25:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 1799 states have (on average 1.4541411895497498) internal successors, (2616), 1868 states have internal predecessors, (2616), 567 states have call successors, (567), 160 states have call predecessors, (567), 159 states have return successors, (566), 559 states have call predecessors, (566), 566 states have call successors, (566) [2024-10-11 15:25:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3749 transitions. [2024-10-11 15:25:25,105 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3749 transitions. Word has length 111 [2024-10-11 15:25:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:25,105 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 3749 transitions. [2024-10-11 15:25:25,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 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:25:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3749 transitions. [2024-10-11 15:25:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 15:25:25,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:25,110 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1] [2024-10-11 15:25:25,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:25:25,110 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:25:25,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1276577981, now seen corresponding path program 1 times [2024-10-11 15:25:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347454955] [2024-10-11 15:25:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 15:25:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-11 15:25:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347454955] [2024-10-11 15:25:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347454955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:25:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217753518] [2024-10-11 15:25:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:25,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:25:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:25:25,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:25,480 INFO L87 Difference]: Start difference. First operand 2537 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 15:25:27,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:25:32,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:25:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:34,644 INFO L93 Difference]: Finished difference Result 6752 states and 10064 transitions. [2024-10-11 15:25:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 15:25:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2024-10-11 15:25:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:34,668 INFO L225 Difference]: With dead ends: 6752 [2024-10-11 15:25:34,669 INFO L226 Difference]: Without dead ends: 4236 [2024-10-11 15:25:34,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:25:34,678 INFO L432 NwaCegarLoop]: 1029 mSDtfsCounter, 2292 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 758 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 3663 SdHoareTripleChecker+Invalid, 3748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:34,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 3663 Invalid, 3748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 2989 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2024-10-11 15:25:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2024-10-11 15:25:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 3760. [2024-10-11 15:25:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 2683 states have (on average 1.461051062243757) internal successors, (3920), 2784 states have internal predecessors, (3920), 825 states have call successors, (825), 241 states have call predecessors, (825), 240 states have return successors, (824), 813 states have call predecessors, (824), 824 states have call successors, (824) [2024-10-11 15:25:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 5569 transitions. [2024-10-11 15:25:34,857 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 5569 transitions. Word has length 115 [2024-10-11 15:25:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:34,858 INFO L471 AbstractCegarLoop]: Abstraction has 3760 states and 5569 transitions. [2024-10-11 15:25:34,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 15:25:34,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 5569 transitions. [2024-10-11 15:25:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 15:25:34,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:34,864 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-10-11 15:25:34,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 15:25:34,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:34,866 INFO L85 PathProgramCache]: Analyzing trace with hash -480656558, now seen corresponding path program 1 times [2024-10-11 15:25:34,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:34,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779044606] [2024-10-11 15:25:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 15:25:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-11 15:25:35,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:35,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779044606] [2024-10-11 15:25:35,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779044606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:35,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:35,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:25:35,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179520420] [2024-10-11 15:25:35,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:35,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:25:35,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:25:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:35,230 INFO L87 Difference]: Start difference. First operand 3760 states and 5569 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 15:25:37,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:25:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:39,143 INFO L93 Difference]: Finished difference Result 7970 states and 11900 transitions. [2024-10-11 15:25:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:25:39,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2024-10-11 15:25:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:39,169 INFO L225 Difference]: With dead ends: 7970 [2024-10-11 15:25:39,169 INFO L226 Difference]: Without dead ends: 4231 [2024-10-11 15:25:39,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:25:39,182 INFO L432 NwaCegarLoop]: 1006 mSDtfsCounter, 1799 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:39,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 2759 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [529 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 15:25:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2024-10-11 15:25:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 3763. [2024-10-11 15:25:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3763 states, 2686 states have (on average 1.460536113179449) internal successors, (3923), 2787 states have internal predecessors, (3923), 825 states have call successors, (825), 241 states have call predecessors, (825), 240 states have return successors, (824), 813 states have call predecessors, (824), 824 states have call successors, (824) [2024-10-11 15:25:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 5572 transitions. [2024-10-11 15:25:39,371 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 5572 transitions. Word has length 120 [2024-10-11 15:25:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:39,371 INFO L471 AbstractCegarLoop]: Abstraction has 3763 states and 5572 transitions. [2024-10-11 15:25:39,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 15:25:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 5572 transitions. [2024-10-11 15:25:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 15:25:39,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:39,378 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-10-11 15:25:39,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:25:39,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:39,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash 353234137, now seen corresponding path program 1 times [2024-10-11 15:25:39,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:39,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661154464] [2024-10-11 15:25:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 15:25:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-10-11 15:25:39,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661154464] [2024-10-11 15:25:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661154464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:39,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:39,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:25:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548805718] [2024-10-11 15:25:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:39,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:25:39,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:25:39,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:25:39,774 INFO L87 Difference]: Start difference. First operand 3763 states and 5572 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:25:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:44,921 INFO L93 Difference]: Finished difference Result 4255 states and 6386 transitions. [2024-10-11 15:25:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:25:44,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2024-10-11 15:25:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:44,944 INFO L225 Difference]: With dead ends: 4255 [2024-10-11 15:25:44,944 INFO L226 Difference]: Without dead ends: 4252 [2024-10-11 15:25:44,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:25:44,947 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 1122 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 3181 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 3181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:44,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 4183 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 3181 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 15:25:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2024-10-11 15:25:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 3769. [2024-10-11 15:25:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3769 states, 2689 states have (on average 1.4600223131275567) internal successors, (3926), 2787 states have internal predecessors, (3926), 828 states have call successors, (828), 241 states have call predecessors, (828), 240 states have return successors, (827), 816 states have call predecessors, (827), 827 states have call successors, (827) [2024-10-11 15:25:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 5581 transitions. [2024-10-11 15:25:45,122 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 5581 transitions. Word has length 121 [2024-10-11 15:25:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:45,123 INFO L471 AbstractCegarLoop]: Abstraction has 3769 states and 5581 transitions. [2024-10-11 15:25:45,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 15:25:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 5581 transitions. [2024-10-11 15:25:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 15:25:45,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:45,134 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:25:45,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 15:25:45,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:45,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2031279679, now seen corresponding path program 1 times [2024-10-11 15:25:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:45,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487447457] [2024-10-11 15:25:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:25:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:25:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-11 15:25:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:45,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487447457] [2024-10-11 15:25:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487447457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:45,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:25:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595312926] [2024-10-11 15:25:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:45,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:25:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:25:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:25:45,339 INFO L87 Difference]: Start difference. First operand 3769 states and 5581 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (17), 3 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:25:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:48,146 INFO L93 Difference]: Finished difference Result 7951 states and 11871 transitions. [2024-10-11 15:25:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:25:48,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (17), 3 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 133 [2024-10-11 15:25:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:48,172 INFO L225 Difference]: With dead ends: 7951 [2024-10-11 15:25:48,172 INFO L226 Difference]: Without dead ends: 4203 [2024-10-11 15:25:48,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:48,187 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 997 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:48,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 2499 Invalid, 2189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 15:25:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2024-10-11 15:25:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3759. [2024-10-11 15:25:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 2680 states have (on average 1.4585820895522388) internal successors, (3909), 2777 states have internal predecessors, (3909), 828 states have call successors, (828), 241 states have call predecessors, (828), 240 states have return successors, (827), 816 states have call predecessors, (827), 827 states have call successors, (827) [2024-10-11 15:25:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5564 transitions. [2024-10-11 15:25:48,465 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5564 transitions. Word has length 133 [2024-10-11 15:25:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:48,466 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5564 transitions. [2024-10-11 15:25:48,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (17), 3 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:25:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5564 transitions. [2024-10-11 15:25:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 15:25:48,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:48,477 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:25:48,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 15:25:48,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -274847290, now seen corresponding path program 1 times [2024-10-11 15:25:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719270677] [2024-10-11 15:25:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:25:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:25:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 15:25:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-11 15:25:48,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719270677] [2024-10-11 15:25:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719270677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:48,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:48,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:25:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148055632] [2024-10-11 15:25:48,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:48,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:25:48,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:48,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:25:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:48,688 INFO L87 Difference]: Start difference. First operand 3759 states and 5564 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 15:25:50,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:25:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:52,656 INFO L93 Difference]: Finished difference Result 7941 states and 11850 transitions. [2024-10-11 15:25:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:25:52,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-10-11 15:25:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:52,688 INFO L225 Difference]: With dead ends: 7941 [2024-10-11 15:25:52,688 INFO L226 Difference]: Without dead ends: 4203 [2024-10-11 15:25:52,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:25:52,699 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 990 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 1896 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:52,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 3106 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1896 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 15:25:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2024-10-11 15:25:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3759. [2024-10-11 15:25:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 2680 states have (on average 1.4541044776119403) internal successors, (3897), 2777 states have internal predecessors, (3897), 828 states have call successors, (828), 241 states have call predecessors, (828), 240 states have return successors, (827), 816 states have call predecessors, (827), 827 states have call successors, (827) [2024-10-11 15:25:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5552 transitions. [2024-10-11 15:25:52,873 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5552 transitions. Word has length 138 [2024-10-11 15:25:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:52,874 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5552 transitions. [2024-10-11 15:25:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 15:25:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5552 transitions. [2024-10-11 15:25:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 15:25:52,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:52,886 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:25:52,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 15:25:52,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sl_change_mtuErr0ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash -81507936, now seen corresponding path program 1 times [2024-10-11 15:25:52,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783347881] [2024-10-11 15:25:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 15:25:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 15:25:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 15:25:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:25:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 15:25:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-11 15:25:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:53,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783347881] [2024-10-11 15:25:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783347881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:53,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:53,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:25:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631188338] [2024-10-11 15:25:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:53,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:25:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:25:53,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:25:53,145 INFO L87 Difference]: Start difference. First operand 3759 states and 5552 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 15:25:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:57,203 INFO L93 Difference]: Finished difference Result 9139 states and 13567 transitions. [2024-10-11 15:25:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 15:25:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2024-10-11 15:25:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:57,234 INFO L225 Difference]: With dead ends: 9139 [2024-10-11 15:25:57,234 INFO L226 Difference]: Without dead ends: 5401 [2024-10-11 15:25:57,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:25:57,286 INFO L432 NwaCegarLoop]: 1318 mSDtfsCounter, 2483 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:57,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 2903 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2186 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 15:25:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2024-10-11 15:25:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 4863. [2024-10-11 15:25:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 3473 states have (on average 1.4486035128131298) internal successors, (5031), 3597 states have internal predecessors, (5031), 1061 states have call successors, (1061), 319 states have call predecessors, (1061), 318 states have return successors, (1060), 1045 states have call predecessors, (1060), 1060 states have call successors, (1060) [2024-10-11 15:25:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 7152 transitions. [2024-10-11 15:25:57,509 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 7152 transitions. Word has length 152 [2024-10-11 15:25:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:57,510 INFO L471 AbstractCegarLoop]: Abstraction has 4863 states and 7152 transitions. [2024-10-11 15:25:57,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 15:25:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 7152 transitions. [2024-10-11 15:25:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 15:25:57,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:57,521 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:25:57,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 15:25:57,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:25:57,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:57,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1483164553, now seen corresponding path program 1 times [2024-10-11 15:25:57,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:57,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080862011] [2024-10-11 15:25:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:57,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:25:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:25:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:25:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:25:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:25:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:25:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:25:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:25:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:25:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 15:25:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-11 15:25:57,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080862011] [2024-10-11 15:25:57,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080862011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:57,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:57,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:25:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740889845] [2024-10-11 15:25:57,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:57,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:25:57,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:57,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:25:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:57,720 INFO L87 Difference]: Start difference. First operand 4863 states and 7152 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 15:26:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:00,770 INFO L93 Difference]: Finished difference Result 10213 states and 15125 transitions. [2024-10-11 15:26:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:26:00,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-11 15:26:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:00,802 INFO L225 Difference]: With dead ends: 10213 [2024-10-11 15:26:00,802 INFO L226 Difference]: Without dead ends: 5371 [2024-10-11 15:26:00,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:26:00,820 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 991 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 2969 SdHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:00,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 2969 Invalid, 2383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 15:26:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2024-10-11 15:26:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 4851. [2024-10-11 15:26:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 3462 states have (on average 1.4471403812824957) internal successors, (5010), 3585 states have internal predecessors, (5010), 1061 states have call successors, (1061), 319 states have call predecessors, (1061), 318 states have return successors, (1060), 1045 states have call predecessors, (1060), 1060 states have call successors, (1060) [2024-10-11 15:26:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 7131 transitions. [2024-10-11 15:26:01,140 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 7131 transitions. Word has length 141 [2024-10-11 15:26:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:01,141 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 7131 transitions. [2024-10-11 15:26:01,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 15:26:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 7131 transitions. [2024-10-11 15:26:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 15:26:01,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:01,155 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:26:01,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 15:26:01,155 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:26:01,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1086455556, now seen corresponding path program 1 times [2024-10-11 15:26:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:01,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677817794] [2024-10-11 15:26:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:01,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:26:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:26:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:26:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:26:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:26:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:26:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:26:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:26:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:26:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:26:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:26:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:26:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:26:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:26:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 15:26:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:26:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 15:26:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 15:26:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-10-11 15:26:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677817794] [2024-10-11 15:26:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677817794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:01,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:26:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790886196] [2024-10-11 15:26:01,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:01,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:26:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:01,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:26:01,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:26:01,363 INFO L87 Difference]: Start difference. First operand 4851 states and 7131 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:26:04,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:05,742 INFO L93 Difference]: Finished difference Result 10201 states and 15099 transitions. [2024-10-11 15:26:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 15:26:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-10-11 15:26:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:05,765 INFO L225 Difference]: With dead ends: 10201 [2024-10-11 15:26:05,766 INFO L226 Difference]: Without dead ends: 5371 [2024-10-11 15:26:05,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:26:05,777 INFO L432 NwaCegarLoop]: 1001 mSDtfsCounter, 650 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:05,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 2988 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 15:26:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2024-10-11 15:26:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 4851. [2024-10-11 15:26:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 3462 states have (on average 1.4428076256499134) internal successors, (4995), 3585 states have internal predecessors, (4995), 1061 states have call successors, (1061), 319 states have call predecessors, (1061), 318 states have return successors, (1060), 1045 states have call predecessors, (1060), 1060 states have call successors, (1060) [2024-10-11 15:26:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 7116 transitions. [2024-10-11 15:26:06,003 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 7116 transitions. Word has length 146 [2024-10-11 15:26:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 7116 transitions. [2024-10-11 15:26:06,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 15:26:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 7116 transitions. [2024-10-11 15:26:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 15:26:06,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:06,017 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2024-10-11 15:26:06,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 15:26:06,018 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_currentErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr0ASSERT_VIOLATIONUNKNOWN, sl_free_bufsErr1ASSERT_VIOLATIONUNKNOWN (and 10 more)] === [2024-10-11 15:26:06,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash 601248500, now seen corresponding path program 1 times [2024-10-11 15:26:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:26:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761883341] [2024-10-11 15:26:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:26:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:26:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:26:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 15:26:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:26:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:26:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 15:26:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:26:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 15:26:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:26:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 15:26:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 15:26:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:26:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 15:26:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:26:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 15:26:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 15:26:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 15:26:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:26:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 15:26:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-11 15:26:06,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:26:06,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761883341] [2024-10-11 15:26:06,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761883341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:06,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:06,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:26:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925229797] [2024-10-11 15:26:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:06,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:26:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:26:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:26:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:26:06,334 INFO L87 Difference]: Start difference. First operand 4851 states and 7116 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)