./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 02:16:28,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:16:28,896 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 02:16:28,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:16:28,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:16:28,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:16:28,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:16:28,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:16:28,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:16:28,932 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:16:28,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:16:28,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:16:28,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:16:28,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:16:28,935 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:16:28,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:16:28,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:16:28,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:16:28,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:16:28,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:16:28,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:16:28,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:16:28,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:16:28,940 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:16:28,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:16:28,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:16:28,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:16:28,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:16:28,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:16:28,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:16:28,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:16:28,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:16:28,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:16:28,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:16:28,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:16:28,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:16:28,945 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:16:28,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:16:28,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:16:28,945 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-29 02:16:29,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:16:29,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:16:29,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:16:29,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:16:29,209 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:16:29,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2023-11-29 02:16:31,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:16:32,317 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:16:32,318 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2023-11-29 02:16:32,348 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/data/6b46e2894/3e2dafa762624097bafe7b52de75676e/FLAG75b317994 [2023-11-29 02:16:32,362 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/data/6b46e2894/3e2dafa762624097bafe7b52de75676e [2023-11-29 02:16:32,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:16:32,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:16:32,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:16:32,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:16:32,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:16:32,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:16:32" (1/1) ... [2023-11-29 02:16:32,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b1551d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:32, skipping insertion in model container [2023-11-29 02:16:32,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:16:32" (1/1) ... [2023-11-29 02:16:32,481 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:16:33,010 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2023-11-29 02:16:33,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:16:33,614 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:16:33,761 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] [2023-11-29 02:16:33,763 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] [2023-11-29 02:16:33,764 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] [2023-11-29 02:16:33,764 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] [2023-11-29 02:16:33,773 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2023-11-29 02:16:33,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4838] [2023-11-29 02:16:33,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4841] [2023-11-29 02:16:33,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4844] [2023-11-29 02:16:33,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4847] [2023-11-29 02:16:33,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5229] [2023-11-29 02:16:33,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5233] [2023-11-29 02:16:33,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5237] [2023-11-29 02:16:33,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5241] [2023-11-29 02:16:33,802 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] [2023-11-29 02:16:33,802 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] [2023-11-29 02:16:33,802 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] [2023-11-29 02:16:33,803 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] [2023-11-29 02:16:33,803 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] [2023-11-29 02:16:33,804 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] [2023-11-29 02:16:33,804 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] [2023-11-29 02:16:33,805 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] [2023-11-29 02:16:33,805 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] [2023-11-29 02:16:33,806 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] [2023-11-29 02:16:33,806 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] [2023-11-29 02:16:33,807 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] [2023-11-29 02:16:33,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5360] [2023-11-29 02:16:33,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5364] [2023-11-29 02:16:33,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5368] [2023-11-29 02:16:33,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5372] [2023-11-29 02:16:33,811 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] [2023-11-29 02:16:33,811 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] [2023-11-29 02:16:33,812 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] [2023-11-29 02:16:33,812 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] [2023-11-29 02:16:33,812 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] [2023-11-29 02:16:33,813 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] [2023-11-29 02:16:33,813 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] [2023-11-29 02:16:33,813 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] [2023-11-29 02:16:33,814 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] [2023-11-29 02:16:33,814 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] [2023-11-29 02:16:33,815 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] [2023-11-29 02:16:33,815 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] [2023-11-29 02:16:33,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %0,%1": "=q" (__x), "+m" (*__ptr): "0" (__x): "memory"); [5515] [2023-11-29 02:16:33,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x), "+m" (*__ptr___0): "0" (__x): "memory"); [5519] [2023-11-29 02:16:33,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0,%1": "=r" (__x), "+m" (*__ptr___1): "0" (__x): "memory"); [5523] [2023-11-29 02:16:33,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x), "+m" (*__ptr___2): "0" (__x): "memory"); [5527] [2023-11-29 02:16:33,820 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] [2023-11-29 02:16:33,821 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] [2023-11-29 02:16:33,821 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] [2023-11-29 02:16:33,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %0,%1": "=r" (__x___0), "+m" (*__ptr___6): "0" (__x___0): "memory"); [5550] [2023-11-29 02:16:33,822 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] [2023-11-29 02:16:33,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %0,%1": "=r" (__x___1), "+m" (*__ptr___8): "0" (__x___1): "memory"); [5565] [2023-11-29 02:16:33,823 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] [2023-11-29 02:16:33,823 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] [2023-11-29 02:16:33,882 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] [2023-11-29 02:16:33,883 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] [2023-11-29 02:16:33,883 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] [2023-11-29 02:16:33,883 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] [2023-11-29 02:16:33,884 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] [2023-11-29 02:16:33,884 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] [2023-11-29 02:16:33,884 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] [2023-11-29 02:16:33,885 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] [2023-11-29 02:16:33,885 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] [2023-11-29 02:16:33,885 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] [2023-11-29 02:16:33,886 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] [2023-11-29 02:16:33,887 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] [2023-11-29 02:16:33,887 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] [2023-11-29 02:16:33,887 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] [2023-11-29 02:16:33,888 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] [2023-11-29 02:16:33,889 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] [2023-11-29 02:16:33,890 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] [2023-11-29 02:16:33,890 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] [2023-11-29 02:16:33,890 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] [2023-11-29 02:16:33,890 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] [2023-11-29 02:16:33,891 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] [2023-11-29 02:16:33,891 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] [2023-11-29 02:16:33,892 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] [2023-11-29 02:16:33,892 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] [2023-11-29 02:16:33,892 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] [2023-11-29 02:16:33,894 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] [2023-11-29 02:16:33,894 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] [2023-11-29 02:16:33,894 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] [2023-11-29 02:16:33,894 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] [2023-11-29 02:16:33,895 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] [2023-11-29 02:16:33,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:16:34,037 WARN L675 CHandler]: The function __xchg_wrong_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:16:34,037 WARN L675 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:16:34,037 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:16:34,043 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:16:34,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34 WrapperNode [2023-11-29 02:16:34,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:16:34,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:16:34,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:16:34,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:16:34,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,182 INFO L138 Inliner]: procedures = 184, calls = 845, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3380 [2023-11-29 02:16:34,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:16:34,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:16:34,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:16:34,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:16:34,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,720 INFO L175 MemorySlicer]: Split 419 memory accesses to 9 slices as follows [2, 4, 35, 20, 2, 347, 1, 3, 5]. 83 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 0, 35, 20, 0, 5, 0, 0, 5]. The 121 writes are split as follows [0, 1, 0, 0, 0, 120, 0, 0, 0]. [2023-11-29 02:16:34,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:16:34,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:16:34,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:16:34,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:16:34,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (1/1) ... [2023-11-29 02:16:34,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:16:34,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:16:34,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:16:34,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:16:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2023-11-29 02:16:34,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2023-11-29 02:16:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2023-11-29 02:16:34,919 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2023-11-29 02:16:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-29 02:16:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-29 02:16:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-29 02:16:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-29 02:16:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-29 02:16:34,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-29 02:16:34,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-29 02:16:34,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2023-11-29 02:16:34,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2023-11-29 02:16:34,920 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2023-11-29 02:16:34,920 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2023-11-29 02:16:34,920 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2023-11-29 02:16:34,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-29 02:16:34,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-29 02:16:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-29 02:16:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-29 02:16:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-29 02:16:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-29 02:16:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-29 02:16:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2023-11-29 02:16:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2023-11-29 02:16:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 02:16:34,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 02:16:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 02:16:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2023-11-29 02:16:34,924 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2023-11-29 02:16:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2023-11-29 02:16:34,924 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2023-11-29 02:16:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2023-11-29 02:16:34,924 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2023-11-29 02:16:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2023-11-29 02:16:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2023-11-29 02:16:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2023-11-29 02:16:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2023-11-29 02:16:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2023-11-29 02:16:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2023-11-29 02:16:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2023-11-29 02:16:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2023-11-29 02:16:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2023-11-29 02:16:34,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2023-11-29 02:16:34,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2023-11-29 02:16:34,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2023-11-29 02:16:34,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2023-11-29 02:16:34,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2023-11-29 02:16:34,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2023-11-29 02:16:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2023-11-29 02:16:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2023-11-29 02:16:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2023-11-29 02:16:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2023-11-29 02:16:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2023-11-29 02:16:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 02:16:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 02:16:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2023-11-29 02:16:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2023-11-29 02:16:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2023-11-29 02:16:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2023-11-29 02:16:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 02:16:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 02:16:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2023-11-29 02:16:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2023-11-29 02:16:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:16:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:16:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:16:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 02:16:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 02:16:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 02:16:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 02:16:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 02:16:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 02:16:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-29 02:16:34,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-29 02:16:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-29 02:16:34,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-29 02:16:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2023-11-29 02:16:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2023-11-29 02:16:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:16:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:16:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2023-11-29 02:16:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2023-11-29 02:16:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2023-11-29 02:16:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2023-11-29 02:16:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:16:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2023-11-29 02:16:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2023-11-29 02:16:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2023-11-29 02:16:34,930 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2023-11-29 02:16:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2023-11-29 02:16:34,930 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2023-11-29 02:16:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:16:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2023-11-29 02:16:34,930 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2023-11-29 02:16:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2023-11-29 02:16:34,930 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2023-11-29 02:16:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 02:16:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-29 02:16:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2023-11-29 02:16:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2023-11-29 02:16:34,932 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2023-11-29 02:16:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2023-11-29 02:16:34,932 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2023-11-29 02:16:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2023-11-29 02:16:34,932 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2023-11-29 02:16:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2023-11-29 02:16:34,932 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2023-11-29 02:16:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:16:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2023-11-29 02:16:34,933 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2023-11-29 02:16:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2023-11-29 02:16:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2023-11-29 02:16:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2023-11-29 02:16:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2023-11-29 02:16:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2023-11-29 02:16:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2023-11-29 02:16:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2023-11-29 02:16:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2023-11-29 02:16:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:16:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2023-11-29 02:16:34,935 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2023-11-29 02:16:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 02:16:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 02:16:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 02:16:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 02:16:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 02:16:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 02:16:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 02:16:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 02:16:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 02:16:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2023-11-29 02:16:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2023-11-29 02:16:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2023-11-29 02:16:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2023-11-29 02:16:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-29 02:16:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-29 02:16:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2023-11-29 02:16:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2023-11-29 02:16:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2023-11-29 02:16:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2023-11-29 02:16:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2023-11-29 02:16:34,937 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2023-11-29 02:16:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2023-11-29 02:16:34,937 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2023-11-29 02:16:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2023-11-29 02:16:34,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2023-11-29 02:16:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2023-11-29 02:16:34,937 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2023-11-29 02:16:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2023-11-29 02:16:34,937 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2023-11-29 02:16:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2023-11-29 02:16:34,937 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2023-11-29 02:16:34,937 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2023-11-29 02:16:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 02:16:34,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 02:16:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2023-11-29 02:16:34,939 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2023-11-29 02:16:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2023-11-29 02:16:34,939 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2023-11-29 02:16:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2023-11-29 02:16:34,939 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2023-11-29 02:16:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-29 02:16:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-29 02:16:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-29 02:16:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-29 02:16:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-29 02:16:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-29 02:16:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-29 02:16:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2023-11-29 02:16:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2023-11-29 02:16:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-29 02:16:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-29 02:16:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:16:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:16:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2023-11-29 02:16:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2023-11-29 02:16:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2023-11-29 02:16:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2023-11-29 02:16:35,446 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:16:35,450 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:16:35,571 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 02:16:38,470 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:16:38,628 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:16:38,628 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:16:38,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:38 BoogieIcfgContainer [2023-11-29 02:16:38,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:16:38,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:16:38,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:16:38,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:16:38,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:16:32" (1/3) ... [2023-11-29 02:16:38,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bf0a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:16:38, skipping insertion in model container [2023-11-29 02:16:38,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:16:34" (2/3) ... [2023-11-29 02:16:38,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bf0a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:16:38, skipping insertion in model container [2023-11-29 02:16:38,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:16:38" (3/3) ... [2023-11-29 02:16:38,637 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2023-11-29 02:16:38,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:16:38,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:16:38,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:16:38,725 INFO L357 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, mHoare=true, 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;@6f47cbbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:16:38,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:16:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 729 states have (on average 1.5061728395061729) internal successors, (1098), 762 states have internal predecessors, (1098), 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) [2023-11-29 02:16:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:16:38,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:38,754 INFO L195 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] [2023-11-29 02:16:38,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:38,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -891064156, now seen corresponding path program 1 times [2023-11-29 02:16:38,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:38,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625470714] [2023-11-29 02:16:38,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:16:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:16:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:16:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:16:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:16:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 02:16:39,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:39,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625470714] [2023-11-29 02:16:39,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625470714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:39,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:39,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:16:39,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543672325] [2023-11-29 02:16:39,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:39,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:16:39,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:39,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:16:39,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:16:39,251 INFO L87 Difference]: Start difference. First operand has 1028 states, 729 states have (on average 1.5061728395061729) internal successors, (1098), 762 states have internal predecessors, (1098), 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) [2023-11-29 02:16:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:43,971 INFO L93 Difference]: Finished difference Result 2773 states and 4317 transitions. [2023-11-29 02:16:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:16:43,974 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 [2023-11-29 02:16:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:44,003 INFO L225 Difference]: With dead ends: 2773 [2023-11-29 02:16:44,003 INFO L226 Difference]: Without dead ends: 1671 [2023-11-29 02:16:44,013 INFO L412 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 [2023-11-29 02:16:44,016 INFO L413 NwaCegarLoop]: 1070 mSDtfsCounter, 1440 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 2528 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:44,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 2528 Invalid, 2202 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [524 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 02:16:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2023-11-29 02:16:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1519. [2023-11-29 02:16:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1070 states have (on average 1.4728971962616821) internal successors, (1576), 1103 states have internal predecessors, (1576), 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) [2023-11-29 02:16:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2291 transitions. [2023-11-29 02:16:44,189 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2291 transitions. Word has length 60 [2023-11-29 02:16:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:44,190 INFO L495 AbstractCegarLoop]: Abstraction has 1519 states and 2291 transitions. [2023-11-29 02:16:44,190 INFO L496 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) [2023-11-29 02:16:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2291 transitions. [2023-11-29 02:16:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 02:16:44,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:44,203 INFO L195 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] [2023-11-29 02:16:44,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:16:44,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:44,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash 575652573, now seen corresponding path program 1 times [2023-11-29 02:16:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:44,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887174620] [2023-11-29 02:16:44,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:44,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:16:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:16:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:16:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:16:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:16:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:16:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:16:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:16:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:16:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:16:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:16:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-29 02:16:44,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887174620] [2023-11-29 02:16:44,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887174620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:44,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:44,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:16:44,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914710179] [2023-11-29 02:16:44,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:44,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:16:44,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:16:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:16:44,495 INFO L87 Difference]: Start difference. First operand 1519 states and 2291 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) [2023-11-29 02:16:47,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:16:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:49,215 INFO L93 Difference]: Finished difference Result 3201 states and 4883 transitions. [2023-11-29 02:16:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:16:49,215 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 [2023-11-29 02:16:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:49,229 INFO L225 Difference]: With dead ends: 3201 [2023-11-29 02:16:49,229 INFO L226 Difference]: Without dead ends: 1703 [2023-11-29 02:16:49,262 INFO L412 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 [2023-11-29 02:16:49,264 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 2199 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 821 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 821 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:49,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2335 Valid, 1534 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [821 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 02:16:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2023-11-29 02:16:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1519. [2023-11-29 02:16:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1070 states have (on average 1.4710280373831777) internal successors, (1574), 1103 states have internal predecessors, (1574), 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) [2023-11-29 02:16:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 2289 transitions. [2023-11-29 02:16:49,389 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 2289 transitions. Word has length 111 [2023-11-29 02:16:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:49,390 INFO L495 AbstractCegarLoop]: Abstraction has 1519 states and 2289 transitions. [2023-11-29 02:16:49,390 INFO L496 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) [2023-11-29 02:16:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 2289 transitions. [2023-11-29 02:16:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 02:16:49,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:49,399 INFO L195 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] [2023-11-29 02:16:49,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:16:49,399 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:49,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash 777476507, now seen corresponding path program 1 times [2023-11-29 02:16:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183872265] [2023-11-29 02:16:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:16:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:16:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:16:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:16:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:16:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:16:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:16:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:16:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:16:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:16:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:16:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-29 02:16:49,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183872265] [2023-11-29 02:16:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183872265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:16:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000022881] [2023-11-29 02:16:49,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:49,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:16:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:16:49,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:49,803 INFO L87 Difference]: Start difference. First operand 1519 states and 2289 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) [2023-11-29 02:16:54,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:16:56,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:16:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:59,128 INFO L93 Difference]: Finished difference Result 2182 states and 3445 transitions. [2023-11-29 02:16:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:16:59,129 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 [2023-11-29 02:16:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:59,143 INFO L225 Difference]: With dead ends: 2182 [2023-11-29 02:16:59,143 INFO L226 Difference]: Without dead ends: 2179 [2023-11-29 02:16:59,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:16:59,146 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 882 mSDsluCounter, 3779 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 5196 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:59,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 5196 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-11-29 02:16:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2179 states. [2023-11-29 02:16:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2179 to 1521. [2023-11-29 02:16:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1072 states have (on average 1.4701492537313432) internal successors, (1576), 1105 states have internal predecessors, (1576), 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) [2023-11-29 02:16:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2291 transitions. [2023-11-29 02:16:59,224 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2291 transitions. Word has length 111 [2023-11-29 02:16:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:59,225 INFO L495 AbstractCegarLoop]: Abstraction has 1521 states and 2291 transitions. [2023-11-29 02:16:59,225 INFO L496 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) [2023-11-29 02:16:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2291 transitions. [2023-11-29 02:16:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 02:16:59,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:59,230 INFO L195 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] [2023-11-29 02:16:59,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:16:59,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:16:59,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2126663077, now seen corresponding path program 1 times [2023-11-29 02:16:59,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:16:59,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803191555] [2023-11-29 02:16:59,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:59,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:16:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:16:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:16:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:16:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:16:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:16:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:16:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:16:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:16:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:16:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:16:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:16:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:16:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:16:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:16:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 02:16:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-29 02:16:59,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:16:59,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803191555] [2023-11-29 02:16:59,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803191555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:16:59,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:16:59,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:16:59,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550164348] [2023-11-29 02:16:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:16:59,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:16:59,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:16:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:16:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:16:59,584 INFO L87 Difference]: Start difference. First operand 1521 states and 2291 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) [2023-11-29 02:17:05,220 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 [] [2023-11-29 02:17:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:07,502 INFO L93 Difference]: Finished difference Result 3214 states and 4898 transitions. [2023-11-29 02:17:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:17:07,503 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 [2023-11-29 02:17:07,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:07,512 INFO L225 Difference]: With dead ends: 3214 [2023-11-29 02:17:07,513 INFO L226 Difference]: Without dead ends: 1714 [2023-11-29 02:17:07,517 INFO L412 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 [2023-11-29 02:17:07,518 INFO L413 NwaCegarLoop]: 920 mSDtfsCounter, 1819 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 542 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:07,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 2559 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 2224 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2023-11-29 02:17:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2023-11-29 02:17:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1522. [2023-11-29 02:17:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1073 states have (on average 1.4697110904007455) internal successors, (1577), 1106 states have internal predecessors, (1577), 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) [2023-11-29 02:17:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2292 transitions. [2023-11-29 02:17:07,586 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2292 transitions. Word has length 120 [2023-11-29 02:17:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:07,587 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 2292 transitions. [2023-11-29 02:17:07,587 INFO L496 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) [2023-11-29 02:17:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2292 transitions. [2023-11-29 02:17:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 02:17:07,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:07,592 INFO L195 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] [2023-11-29 02:17:07,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:17:07,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:07,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1859034571, now seen corresponding path program 1 times [2023-11-29 02:17:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:17:07,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169534932] [2023-11-29 02:17:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:17:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:17:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:17:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:17:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:17:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:17:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:17:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:17:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:17:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:17:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:17:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:17:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:17:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:17:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-29 02:17:07,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:17:07,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169534932] [2023-11-29 02:17:07,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169534932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:17:07,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:17:07,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:17:07,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082362083] [2023-11-29 02:17:07,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:17:07,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:17:07,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:17:07,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:17:07,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:17:07,745 INFO L87 Difference]: Start difference. First operand 1522 states and 2292 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 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) [2023-11-29 02:17:11,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:17:13,240 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 [] [2023-11-29 02:17:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:14,902 INFO L93 Difference]: Finished difference Result 3208 states and 4887 transitions. [2023-11-29 02:17:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:17:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 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 [2023-11-29 02:17:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:14,914 INFO L225 Difference]: With dead ends: 3208 [2023-11-29 02:17:14,915 INFO L226 Difference]: Without dead ends: 1707 [2023-11-29 02:17:14,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:17:14,921 INFO L413 NwaCegarLoop]: 938 mSDtfsCounter, 543 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:14,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 2794 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-11-29 02:17:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2023-11-29 02:17:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1523. [2023-11-29 02:17:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1074 states have (on average 1.4692737430167597) internal successors, (1578), 1107 states have internal predecessors, (1578), 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) [2023-11-29 02:17:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2293 transitions. [2023-11-29 02:17:15,016 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2293 transitions. Word has length 121 [2023-11-29 02:17:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:15,017 INFO L495 AbstractCegarLoop]: Abstraction has 1523 states and 2293 transitions. [2023-11-29 02:17:15,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 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) [2023-11-29 02:17:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2293 transitions. [2023-11-29 02:17:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 02:17:15,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:15,024 INFO L195 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] [2023-11-29 02:17:15,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:17:15,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:15,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1466007561, now seen corresponding path program 1 times [2023-11-29 02:17:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:17:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804211327] [2023-11-29 02:17:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:17:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:17:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:17:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:17:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:17:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:17:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:17:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:17:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:17:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:17:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:17:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:17:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:17:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:17:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-29 02:17:15,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:17:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804211327] [2023-11-29 02:17:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804211327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:17:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:17:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:17:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873177212] [2023-11-29 02:17:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:17:15,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:17:15,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:17:15,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:17:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:17:15,395 INFO L87 Difference]: Start difference. First operand 1523 states and 2293 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) [2023-11-29 02:17:21,422 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 [] [2023-11-29 02:17:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:24,886 INFO L93 Difference]: Finished difference Result 2199 states and 3468 transitions. [2023-11-29 02:17:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:17:24,886 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 [2023-11-29 02:17:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:24,898 INFO L225 Difference]: With dead ends: 2199 [2023-11-29 02:17:24,898 INFO L226 Difference]: Without dead ends: 2196 [2023-11-29 02:17:24,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:17:24,900 INFO L413 NwaCegarLoop]: 1363 mSDtfsCounter, 992 mSDsluCounter, 4751 mSDsCounter, 0 mSdLazyCounter, 3841 mSolverCounterSat, 248 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 6114 SdHoareTripleChecker+Invalid, 4090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 3841 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:24,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 6114 Invalid, 4090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 3841 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2023-11-29 02:17:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2023-11-29 02:17:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 1525. [2023-11-29 02:17:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1075 states have (on average 1.4688372093023256) internal successors, (1579), 1107 states have internal predecessors, (1579), 359 states have call successors, (359), 91 states have call predecessors, (359), 90 states have return successors, (358), 355 states have call predecessors, (358), 358 states have call successors, (358) [2023-11-29 02:17:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2296 transitions. [2023-11-29 02:17:24,972 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2296 transitions. Word has length 121 [2023-11-29 02:17:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:24,973 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 2296 transitions. [2023-11-29 02:17:24,973 INFO L496 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) [2023-11-29 02:17:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2296 transitions. [2023-11-29 02:17:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 02:17:24,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:24,983 INFO L195 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] [2023-11-29 02:17:24,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:17:24,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:24,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1949697098, now seen corresponding path program 1 times [2023-11-29 02:17:24,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:17:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498773264] [2023-11-29 02:17:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:17:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:17:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:17:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:17:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:17:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:17:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:17:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:17:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:17:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:17:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:17:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:17:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:17:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:17:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 02:17:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:17:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 02:17:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 02:17:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-11-29 02:17:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:17:25,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498773264] [2023-11-29 02:17:25,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498773264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:17:25,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:17:25,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:17:25,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376174189] [2023-11-29 02:17:25,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:17:25,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:17:25,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:17:25,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:17:25,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:17:25,277 INFO L87 Difference]: Start difference. First operand 1525 states and 2296 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) [2023-11-29 02:17:29,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:17:32,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:17:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:35,480 INFO L93 Difference]: Finished difference Result 4864 states and 7423 transitions. [2023-11-29 02:17:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:17:35,481 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 149 [2023-11-29 02:17:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:35,501 INFO L225 Difference]: With dead ends: 4864 [2023-11-29 02:17:35,501 INFO L226 Difference]: Without dead ends: 3360 [2023-11-29 02:17:35,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:17:35,508 INFO L413 NwaCegarLoop]: 1396 mSDtfsCounter, 2063 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 2657 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2289 SdHoareTripleChecker+Valid, 3703 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 2657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:35,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2289 Valid, 3703 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 2657 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-11-29 02:17:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2023-11-29 02:17:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2989. [2023-11-29 02:17:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2112 states have (on average 1.4711174242424243) internal successors, (3107), 2176 states have internal predecessors, (3107), 697 states have call successors, (697), 180 states have call predecessors, (697), 179 states have return successors, (696), 688 states have call predecessors, (696), 696 states have call successors, (696) [2023-11-29 02:17:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4500 transitions. [2023-11-29 02:17:35,775 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4500 transitions. Word has length 149 [2023-11-29 02:17:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:35,776 INFO L495 AbstractCegarLoop]: Abstraction has 2989 states and 4500 transitions. [2023-11-29 02:17:35,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2023-11-29 02:17:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4500 transitions. [2023-11-29 02:17:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 02:17:35,795 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:35,795 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:17:35,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:17:35,795 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:35,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 957697702, now seen corresponding path program 1 times [2023-11-29 02:17:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:17:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824536696] [2023-11-29 02:17:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:17:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:17:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:17:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:35,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:17:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:35,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:17:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:17:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:17:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:17:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:17:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:17:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:17:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:17:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 02:17:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 02:17:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 02:17:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 02:17:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:17:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:17:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:17:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-11-29 02:17:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:17:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824536696] [2023-11-29 02:17:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824536696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:17:36,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:17:36,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:17:36,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961415207] [2023-11-29 02:17:36,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:17:36,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:17:36,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:17:36,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:17:36,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:17:36,122 INFO L87 Difference]: Start difference. First operand 2989 states and 4500 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 02:17:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:40,357 INFO L93 Difference]: Finished difference Result 5273 states and 7986 transitions. [2023-11-29 02:17:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:17:40,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2023-11-29 02:17:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:40,368 INFO L225 Difference]: With dead ends: 5273 [2023-11-29 02:17:40,368 INFO L226 Difference]: Without dead ends: 2295 [2023-11-29 02:17:40,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:17:40,375 INFO L413 NwaCegarLoop]: 932 mSDtfsCounter, 995 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:40,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 3126 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 02:17:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2023-11-29 02:17:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2033. [2023-11-29 02:17:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 1424 states have (on average 1.458567415730337) internal successors, (2077), 1465 states have internal predecessors, (2077), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-29 02:17:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 3036 transitions. [2023-11-29 02:17:40,496 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 3036 transitions. Word has length 151 [2023-11-29 02:17:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:40,497 INFO L495 AbstractCegarLoop]: Abstraction has 2033 states and 3036 transitions. [2023-11-29 02:17:40,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 02:17:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 3036 transitions. [2023-11-29 02:17:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 02:17:40,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:40,507 INFO L195 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, 1, 1] [2023-11-29 02:17:40,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:17:40,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:40,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash -545552592, now seen corresponding path program 1 times [2023-11-29 02:17:40,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:17:40,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398786640] [2023-11-29 02:17:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:40,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:17:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:17:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:17:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:17:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:17:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:17:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:17:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:17:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:17:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:17:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:17:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:17:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:17:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:17:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 02:17:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:17:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:17:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:17:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 02:17:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:17:40,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398786640] [2023-11-29 02:17:40,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398786640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:17:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:17:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:17:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676021761] [2023-11-29 02:17:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:17:40,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:17:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:17:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:17:40,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:17:40,857 INFO L87 Difference]: Start difference. First operand 2033 states and 3036 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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) [2023-11-29 02:17:45,310 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 [] [2023-11-29 02:17:49,316 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 [] [2023-11-29 02:17:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:51,634 INFO L93 Difference]: Finished difference Result 3815 states and 5794 transitions. [2023-11-29 02:17:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:17:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 151 [2023-11-29 02:17:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:51,645 INFO L225 Difference]: With dead ends: 3815 [2023-11-29 02:17:51,645 INFO L226 Difference]: Without dead ends: 2315 [2023-11-29 02:17:51,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:17:51,649 INFO L413 NwaCegarLoop]: 970 mSDtfsCounter, 2189 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 832 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 832 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:51,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 2188 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [832 Valid, 1948 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2023-11-29 02:17:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2023-11-29 02:17:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2036. [2023-11-29 02:17:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 1427 states have (on average 1.4583041345480028) internal successors, (2081), 1468 states have internal predecessors, (2081), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-29 02:17:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 3040 transitions. [2023-11-29 02:17:51,772 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 3040 transitions. Word has length 151 [2023-11-29 02:17:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:51,773 INFO L495 AbstractCegarLoop]: Abstraction has 2036 states and 3040 transitions. [2023-11-29 02:17:51,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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) [2023-11-29 02:17:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 3040 transitions. [2023-11-29 02:17:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 02:17:51,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:51,782 INFO L195 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, 1, 1, 1, 1] [2023-11-29 02:17:51,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:17:51,782 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:51,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1145242683, now seen corresponding path program 1 times [2023-11-29 02:17:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:17:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380262648] [2023-11-29 02:17:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:17:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:17:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:17:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:17:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:17:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:17:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:17:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:17:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:17:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:17:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:17:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:17:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:17:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:17:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:17:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 02:17:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 02:17:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 02:17:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2023-11-29 02:17:51,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:17:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380262648] [2023-11-29 02:17:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380262648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:17:51,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:17:51,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:17:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510930947] [2023-11-29 02:17:51,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:17:51,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:17:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:17:51,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:17:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:17:51,973 INFO L87 Difference]: Start difference. First operand 2036 states and 3040 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 02:17:57,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:17:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:59,187 INFO L93 Difference]: Finished difference Result 4316 states and 6552 transitions. [2023-11-29 02:17:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:17:59,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2023-11-29 02:17:59,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:59,199 INFO L225 Difference]: With dead ends: 4316 [2023-11-29 02:17:59,199 INFO L226 Difference]: Without dead ends: 2301 [2023-11-29 02:17:59,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:17:59,205 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 988 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 487 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:59,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 2412 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 1704 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2023-11-29 02:17:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2023-11-29 02:17:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2036. [2023-11-29 02:17:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 1427 states have (on average 1.4519971969166083) internal successors, (2072), 1468 states have internal predecessors, (2072), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-29 02:17:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 3031 transitions. [2023-11-29 02:17:59,387 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 3031 transitions. Word has length 153 [2023-11-29 02:17:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:59,387 INFO L495 AbstractCegarLoop]: Abstraction has 2036 states and 3031 transitions. [2023-11-29 02:17:59,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 02:17:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 3031 transitions. [2023-11-29 02:17:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 02:17:59,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:59,399 INFO L195 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:17:59,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:17:59,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:17:59,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1261364147, now seen corresponding path program 1 times [2023-11-29 02:17:59,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:17:59,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749721998] [2023-11-29 02:17:59,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:59,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:17:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:17:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:17:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:17:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:17:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:17:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:17:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:17:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:17:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:17:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:17:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:17:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:17:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:17:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:17:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:17:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 02:17:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 02:17:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 02:17:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 02:17:59,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:17:59,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749721998] [2023-11-29 02:17:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749721998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:17:59,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038288711] [2023-11-29 02:17:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:17:59,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:17:59,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:17:59,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:18:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:00,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:18:00,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-29 02:18:00,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:18:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 02:18:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038288711] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:18:00,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:18:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2023-11-29 02:18:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23349758] [2023-11-29 02:18:00,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:18:00,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:18:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:18:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:18:00,822 INFO L87 Difference]: Start difference. First operand 2036 states and 3031 transitions. Second operand has 12 states, 12 states have (on average 13.916666666666666) internal successors, (167), 10 states have internal predecessors, (167), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2023-11-29 02:18:04,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:18:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:08,942 INFO L93 Difference]: Finished difference Result 3861 states and 5854 transitions. [2023-11-29 02:18:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:18:08,943 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.916666666666666) internal successors, (167), 10 states have internal predecessors, (167), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 156 [2023-11-29 02:18:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:08,953 INFO L225 Difference]: With dead ends: 3861 [2023-11-29 02:18:08,954 INFO L226 Difference]: Without dead ends: 2358 [2023-11-29 02:18:08,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:18:08,959 INFO L413 NwaCegarLoop]: 971 mSDtfsCounter, 3293 mSDsluCounter, 2546 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 1406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3430 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 5261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1406 IncrementalHoareTripleChecker+Valid, 3855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:08,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3430 Valid, 3517 Invalid, 5261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1406 Valid, 3855 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-11-29 02:18:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2358 states. [2023-11-29 02:18:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2358 to 2041. [2023-11-29 02:18:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 1432 states have (on average 1.4518156424581006) internal successors, (2079), 1473 states have internal predecessors, (2079), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-29 02:18:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 3038 transitions. [2023-11-29 02:18:09,083 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 3038 transitions. Word has length 156 [2023-11-29 02:18:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:09,083 INFO L495 AbstractCegarLoop]: Abstraction has 2041 states and 3038 transitions. [2023-11-29 02:18:09,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.916666666666666) internal successors, (167), 10 states have internal predecessors, (167), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2023-11-29 02:18:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 3038 transitions. [2023-11-29 02:18:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 02:18:09,093 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:09,093 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:09,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:18:09,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:18:09,294 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:09,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1552070226, now seen corresponding path program 2 times [2023-11-29 02:18:09,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:09,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309112551] [2023-11-29 02:18:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:09,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:18:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:18:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:18:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:18:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:18:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:18:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:18:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:18:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:18:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:18:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:18:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:18:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:18:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 02:18:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 02:18:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:18:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 02:18:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 02:18:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:09,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309112551] [2023-11-29 02:18:09,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309112551] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447333570] [2023-11-29 02:18:09,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:18:09,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:18:09,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:18:09,861 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:18:09,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:18:11,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:18:11,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:18:11,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:18:11,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-29 02:18:11,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:18:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 02:18:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447333570] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:18:11,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:18:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 21 [2023-11-29 02:18:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329043613] [2023-11-29 02:18:11,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:18:11,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 02:18:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 02:18:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2023-11-29 02:18:11,748 INFO L87 Difference]: Start difference. First operand 2041 states and 3038 transitions. Second operand has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 19 states have internal predecessors, (185), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2023-11-29 02:18:16,949 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 [] [2023-11-29 02:18:19,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:18:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:24,346 INFO L93 Difference]: Finished difference Result 3986 states and 6053 transitions. [2023-11-29 02:18:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:18:24,347 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 19 states have internal predecessors, (185), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 162 [2023-11-29 02:18:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:24,358 INFO L225 Difference]: With dead ends: 3986 [2023-11-29 02:18:24,358 INFO L226 Difference]: Without dead ends: 2478 [2023-11-29 02:18:24,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:18:24,362 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 3176 mSDsluCounter, 3738 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 1237 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 6486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1237 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:24,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 4703 Invalid, 6486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1237 Valid, 5248 Invalid, 1 Unknown, 0 Unchecked, 12.2s Time] [2023-11-29 02:18:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2023-11-29 02:18:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2053. [2023-11-29 02:18:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1444 states have (on average 1.4522160664819945) internal successors, (2097), 1485 states have internal predecessors, (2097), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-29 02:18:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3056 transitions. [2023-11-29 02:18:24,540 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3056 transitions. Word has length 162 [2023-11-29 02:18:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:24,540 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 3056 transitions. [2023-11-29 02:18:24,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 19 states have internal predecessors, (185), 4 states have call successors, (54), 5 states have call predecessors, (54), 3 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2023-11-29 02:18:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3056 transitions. [2023-11-29 02:18:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 02:18:24,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:24,548 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:24,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:18:24,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:18:24,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:24,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2114550077, now seen corresponding path program 1 times [2023-11-29 02:18:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:24,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263869476] [2023-11-29 02:18:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:18:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:18:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:18:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:18:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:18:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:18:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:18:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:18:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:18:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:18:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:18:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 02:18:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:18:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 02:18:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:18:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 02:18:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 02:18:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 02:18:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-29 02:18:25,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263869476] [2023-11-29 02:18:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263869476] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780655201] [2023-11-29 02:18:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:25,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:18:25,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:18:25,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:18:25,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:18:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:26,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:18:26,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 02:18:26,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:18:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780655201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:26,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:18:26,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-29 02:18:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943945348] [2023-11-29 02:18:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:26,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:18:26,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:26,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:18:26,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:18:26,467 INFO L87 Difference]: Start difference. First operand 2053 states and 3056 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 02:18:29,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:18:30,994 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 [] [2023-11-29 02:18:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:31,379 INFO L93 Difference]: Finished difference Result 3588 states and 5353 transitions. [2023-11-29 02:18:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:18:31,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2023-11-29 02:18:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:31,391 INFO L225 Difference]: With dead ends: 3588 [2023-11-29 02:18:31,391 INFO L226 Difference]: Without dead ends: 2053 [2023-11-29 02:18:31,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:18:31,396 INFO L413 NwaCegarLoop]: 1398 mSDtfsCounter, 2 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:31,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2794 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-29 02:18:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2023-11-29 02:18:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2053. [2023-11-29 02:18:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 1444 states have (on average 1.4501385041551247) internal successors, (2094), 1485 states have internal predecessors, (2094), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-29 02:18:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3053 transitions. [2023-11-29 02:18:31,549 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3053 transitions. Word has length 164 [2023-11-29 02:18:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:31,549 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 3053 transitions. [2023-11-29 02:18:31,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 02:18:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3053 transitions. [2023-11-29 02:18:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 02:18:31,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:31,560 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:31,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:18:31,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 02:18:31,761 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:31,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash 957243163, now seen corresponding path program 1 times [2023-11-29 02:18:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840960434] [2023-11-29 02:18:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:18:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:18:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:18:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:18:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:18:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:18:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:18:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:18:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:18:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:18:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 02:18:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 02:18:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 02:18:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:18:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 02:18:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 02:18:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 02:18:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 02:18:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-11-29 02:18:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840960434] [2023-11-29 02:18:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840960434] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316457014] [2023-11-29 02:18:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:32,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:18:32,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:18:32,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:18:32,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 02:18:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:33,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:18:33,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-11-29 02:18:33,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:18:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316457014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:33,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:18:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-29 02:18:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982309830] [2023-11-29 02:18:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:33,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:18:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:18:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:18:33,220 INFO L87 Difference]: Start difference. First operand 2053 states and 3053 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 02:18:36,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:18:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:38,194 INFO L93 Difference]: Finished difference Result 4069 states and 6141 transitions. [2023-11-29 02:18:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:18:38,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2023-11-29 02:18:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:38,207 INFO L225 Difference]: With dead ends: 4069 [2023-11-29 02:18:38,207 INFO L226 Difference]: Without dead ends: 2549 [2023-11-29 02:18:38,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:18:38,213 INFO L413 NwaCegarLoop]: 1872 mSDtfsCounter, 364 mSDsluCounter, 3326 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 5198 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:38,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 5198 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-29 02:18:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2023-11-29 02:18:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2055. [2023-11-29 02:18:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1446 states have (on average 1.4495159059474412) internal successors, (2096), 1487 states have internal predecessors, (2096), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-29 02:18:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3055 transitions. [2023-11-29 02:18:38,405 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3055 transitions. Word has length 165 [2023-11-29 02:18:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:38,405 INFO L495 AbstractCegarLoop]: Abstraction has 2055 states and 3055 transitions. [2023-11-29 02:18:38,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 02:18:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3055 transitions. [2023-11-29 02:18:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 02:18:38,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:38,416 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:38,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 02:18:38,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 02:18:38,626 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:38,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash -680474911, now seen corresponding path program 1 times [2023-11-29 02:18:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443787499] [2023-11-29 02:18:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:18:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:18:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:18:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:18:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:18:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:18:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:18:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:18:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:18:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:18:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 02:18:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 02:18:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 02:18:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:18:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 02:18:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:18:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 02:18:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 02:18:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 02:18:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 02:18:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-11-29 02:18:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:38,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443787499] [2023-11-29 02:18:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443787499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:18:38,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:18:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720919234] [2023-11-29 02:18:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:38,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:18:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:18:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:18:38,948 INFO L87 Difference]: Start difference. First operand 2055 states and 3055 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 02:18:41,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:18:44,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:18:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:47,147 INFO L93 Difference]: Finished difference Result 3970 states and 6007 transitions. [2023-11-29 02:18:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:18:47,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 170 [2023-11-29 02:18:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:47,156 INFO L225 Difference]: With dead ends: 3970 [2023-11-29 02:18:47,157 INFO L226 Difference]: Without dead ends: 2448 [2023-11-29 02:18:47,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:18:47,161 INFO L413 NwaCegarLoop]: 742 mSDtfsCounter, 1211 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 2818 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 3514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:47,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 2677 Invalid, 3514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2818 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-11-29 02:18:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2023-11-29 02:18:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2057. [2023-11-29 02:18:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 1448 states have (on average 1.4488950276243093) internal successors, (2098), 1489 states have internal predecessors, (2098), 480 states have call successors, (480), 129 states have call predecessors, (480), 128 states have return successors, (479), 474 states have call predecessors, (479), 479 states have call successors, (479) [2023-11-29 02:18:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3057 transitions. [2023-11-29 02:18:47,343 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3057 transitions. Word has length 170 [2023-11-29 02:18:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:47,343 INFO L495 AbstractCegarLoop]: Abstraction has 2057 states and 3057 transitions. [2023-11-29 02:18:47,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 02:18:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3057 transitions. [2023-11-29 02:18:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-29 02:18:47,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:47,353 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:47,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:18:47,353 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:18:47,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash -666013452, now seen corresponding path program 1 times [2023-11-29 02:18:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:18:47,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30434924] [2023-11-29 02:18:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:18:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:18:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:18:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:18:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:18:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:18:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:18:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:18:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:18:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:18:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:18:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:18:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 02:18:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 02:18:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 02:18:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 02:18:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 02:18:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 02:18:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 02:18:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 02:18:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 02:18:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 02:18:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 02:18:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-29 02:18:48,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:18:48,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30434924] [2023-11-29 02:18:48,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30434924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:48,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919354589] [2023-11-29 02:18:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:48,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:18:48,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:18:48,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:18:48,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 02:18:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:49,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 02:18:49,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-11-29 02:18:49,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:18:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919354589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:18:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:18:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 10 [2023-11-29 02:18:49,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102683985] [2023-11-29 02:18:49,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:18:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:18:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:18:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:18:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:18:49,066 INFO L87 Difference]: Start difference. First operand 2057 states and 3057 transitions. Second operand has 7 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 02:18:51,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:18:55,138 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 [] [2023-11-29 02:19:00,671 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 [] [2023-11-29 02:19:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:01,827 INFO L93 Difference]: Finished difference Result 3599 states and 5373 transitions. [2023-11-29 02:19:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:19:01,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) Word has length 177 [2023-11-29 02:19:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:01,836 INFO L225 Difference]: With dead ends: 3599 [2023-11-29 02:19:01,836 INFO L226 Difference]: Without dead ends: 2070 [2023-11-29 02:19:01,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:19:01,841 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 775 mSDsluCounter, 7013 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 8423 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:01,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 8423 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 654 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2023-11-29 02:19:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2023-11-29 02:19:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2069. [2023-11-29 02:19:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1454 states have (on average 1.4470426409903714) internal successors, (2104), 1498 states have internal predecessors, (2104), 480 states have call successors, (480), 129 states have call predecessors, (480), 134 states have return successors, (497), 477 states have call predecessors, (497), 479 states have call successors, (497) [2023-11-29 02:19:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3081 transitions. [2023-11-29 02:19:02,006 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3081 transitions. Word has length 177 [2023-11-29 02:19:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:02,007 INFO L495 AbstractCegarLoop]: Abstraction has 2069 states and 3081 transitions. [2023-11-29 02:19:02,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 02:19:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3081 transitions. [2023-11-29 02:19:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-29 02:19:02,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:02,017 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:19:02,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 02:19:02,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 02:19:02,218 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:19:02,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 206961270, now seen corresponding path program 1 times [2023-11-29 02:19:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627747690] [2023-11-29 02:19:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:19:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:19:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:19:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:19:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:19:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:19:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:19:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:19:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:19:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:19:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:19:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:19:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:19:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 02:19:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:19:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 02:19:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 02:19:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 02:19:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 02:19:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 02:19:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 02:19:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 02:19:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 02:19:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 02:19:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-11-29 02:19:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627747690] [2023-11-29 02:19:02,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627747690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:19:02,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:19:02,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:19:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966766864] [2023-11-29 02:19:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:19:02,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:19:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:19:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:19:02,762 INFO L87 Difference]: Start difference. First operand 2069 states and 3081 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 02:19:05,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:19:10,248 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 [] [2023-11-29 02:19:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:14,954 INFO L93 Difference]: Finished difference Result 3986 states and 6031 transitions. [2023-11-29 02:19:14,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:19:14,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 183 [2023-11-29 02:19:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:14,962 INFO L225 Difference]: With dead ends: 3986 [2023-11-29 02:19:14,962 INFO L226 Difference]: Without dead ends: 2454 [2023-11-29 02:19:14,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:19:14,967 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 1644 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 4366 mSolverCounterSat, 979 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 3528 SdHoareTripleChecker+Invalid, 5346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 979 IncrementalHoareTripleChecker+Valid, 4366 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:14,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 3528 Invalid, 5346 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [979 Valid, 4366 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2023-11-29 02:19:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2023-11-29 02:19:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2071. [2023-11-29 02:19:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 1456 states have (on average 1.4464285714285714) internal successors, (2106), 1499 states have internal predecessors, (2106), 480 states have call successors, (480), 129 states have call predecessors, (480), 134 states have return successors, (497), 478 states have call predecessors, (497), 479 states have call successors, (497) [2023-11-29 02:19:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3083 transitions. [2023-11-29 02:19:15,127 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3083 transitions. Word has length 183 [2023-11-29 02:19:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:15,127 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 3083 transitions. [2023-11-29 02:19:15,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 02:19:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3083 transitions. [2023-11-29 02:19:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-11-29 02:19:15,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:15,135 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:19:15,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:19:15,135 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:19:15,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1229600948, now seen corresponding path program 1 times [2023-11-29 02:19:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:19:15,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990364096] [2023-11-29 02:19:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:19:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:19:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 02:19:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:19:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 02:19:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:19:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:19:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 02:19:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 02:19:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 02:19:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:19:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 02:19:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:19:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:19:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 02:19:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:19:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 02:19:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 02:19:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:19:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:21,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:19:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 02:19:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:22,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 02:19:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 02:19:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:22,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 02:19:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 02:19:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 02:19:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-11-29 02:19:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:19:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990364096] [2023-11-29 02:19:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990364096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499730329] [2023-11-29 02:19:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:22,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:19:22,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:19:22,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:19:22,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d6e86e4-3ccd-40f3-ad7c-b56ad79d6d52/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 02:19:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:22,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 1485 conjuncts, 167 conjunts are in the unsatisfiable core [2023-11-29 02:19:22,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:19:22,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:19:23,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 02:19:23,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 02:19:23,562 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 02:19:23,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-29 02:19:23,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:23,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:23,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-29 02:19:23,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 02:19:23,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 02:19:23,931 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 02:19:23,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 02:19:24,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:19:24,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-29 02:19:24,508 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:24,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2023-11-29 02:19:24,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-29 02:19:25,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:19:25,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:19:25,071 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:25,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 31 [2023-11-29 02:19:25,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-11-29 02:19:25,482 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:25,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 53 [2023-11-29 02:19:25,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2023-11-29 02:19:25,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2023-11-29 02:19:25,515 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:25,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-11-29 02:19:25,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 02:19:25,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 18 [2023-11-29 02:19:25,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-29 02:19:25,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 02:19:25,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-29 02:19:25,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 02:19:25,976 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:25,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 02:19:25,986 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:25,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-11-29 02:19:26,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 02:19:26,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 02:19:26,585 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:26,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 02:19:27,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 02:19:27,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 02:19:27,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-11-29 02:19:27,253 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:27,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2023-11-29 02:19:28,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:28,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 75 [2023-11-29 02:19:28,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:19:28,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:19:28,401 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 02:19:28,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 35 [2023-11-29 02:19:28,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 02:19:28,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 02:19:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-11-29 02:19:28,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:19:28,559 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (v_ArrVal_1002 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int#5| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1004) (select (select (store |c_#memory_$Pointer$#5.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1003) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$#5.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1002) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (< .cse0 1) (< 2147483647 .cse0)))) is different from false [2023-11-29 02:19:28,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499730329] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:28,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:19:28,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 61 [2023-11-29 02:19:28,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150594515] [2023-11-29 02:19:28,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:19:28,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-29 02:19:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:19:28,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-29 02:19:28,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3468, Unknown=1, NotChecked=118, Total=3782 [2023-11-29 02:19:28,587 INFO L87 Difference]: Start difference. First operand 2071 states and 3083 transitions. Second operand has 61 states, 54 states have (on average 3.7222222222222223) internal successors, (201), 46 states have internal predecessors, (201), 22 states have call successors, (48), 12 states have call predecessors, (48), 16 states have return successors, (40), 25 states have call predecessors, (40), 21 states have call successors, (40) [2023-11-29 02:19:36,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:19:38,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:19:40,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:19:47,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:19:51,073 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 [0] [2023-11-29 02:19:55,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:19:56,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:19:59,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:20:01,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:20:05,091 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 [0] [2023-11-29 02:20:09,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:20:12,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:20:20,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:21:09,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:13,851 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 [] [2023-11-29 02:21:16,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:21:19,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:21,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:21:25,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:32,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:36,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:21:38,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:45,368 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 [] [2023-11-29 02:21:51,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:21:56,431 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 [0] [2023-11-29 02:21:58,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:03,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:22:05,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:07,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:09,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:12,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:16,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:22:19,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:23,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:26,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:30,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:31,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:35,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:39,280 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 [] [2023-11-29 02:22:43,294 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 [] [2023-11-29 02:22:47,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:49,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:22:59,126 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 [0] [2023-11-29 02:23:03,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:06,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:10,477 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 [0] [2023-11-29 02:23:14,921 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 [0] [2023-11-29 02:23:17,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:26,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:29,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:33,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:38,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:42,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:44,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:51,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:54,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:23:56,706 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 [0] [2023-11-29 02:23:59,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:24:01,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:24:06,231 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 [0] [2023-11-29 02:24:10,242 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 [0] [2023-11-29 02:24:13,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:24:16,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:24:24,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:24:27,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:24:29,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:24:34,055 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 [0] [2023-11-29 02:24:39,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:09,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:11,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:14,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:19,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:21,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:23,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:27,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:31,459 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 [0] [2023-11-29 02:26:35,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:39,256 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 [0] [2023-11-29 02:26:43,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:51,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:54,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:26:59,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:03,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:06,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:10,467 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 [0] [2023-11-29 02:27:22,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:26,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:29,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:32,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:36,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:38,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:39,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:41,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:45,743 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 [0] [2023-11-29 02:27:46,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:27:51,436 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 [0] [2023-11-29 02:27:55,914 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 [0] [2023-11-29 02:27:59,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:02,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:05,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:07,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:09,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:14,830 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 [0] [2023-11-29 02:28:17,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:22,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:24,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:29,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:40,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:28:43,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:28:48,097 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 [0] [2023-11-29 02:28:52,109 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 [] [2023-11-29 02:28:55,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:29:01,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:29:04,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:29:12,818 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 [] [2023-11-29 02:29:14,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 02:29:19,106 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 [0] [2023-11-29 02:29:25,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]