./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:29:37,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:29:37,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:29:37,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:29:37,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:29:37,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:29:37,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:29:37,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:29:37,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:29:37,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:29:37,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:29:37,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:29:37,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:29:37,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:29:37,448 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:29:37,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:29:37,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:37,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:29:37,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:37,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:29:37,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:29:37,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:29:37,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f78e25bf76e2d1d395e5e41868c5ddb628a36f1efdf095bb509ea6a3a366617b [2025-01-09 18:29:37,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:29:37,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:29:37,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:29:37,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:29:37,787 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:29:37,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2025-01-09 18:29:38,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/738c58555/615e3777f63a4c269bd007353a782e35/FLAG2088481d5 [2025-01-09 18:29:39,416 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:29:39,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2025-01-09 18:29:39,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/738c58555/615e3777f63a4c269bd007353a782e35/FLAG2088481d5 [2025-01-09 18:29:39,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/738c58555/615e3777f63a4c269bd007353a782e35 [2025-01-09 18:29:39,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:29:39,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:29:39,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:29:39,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:29:39,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:29:39,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:29:39" (1/1) ... [2025-01-09 18:29:39,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d6b9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:39, skipping insertion in model container [2025-01-09 18:29:39,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:29:39" (1/1) ... [2025-01-09 18:29:39,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:29:40,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2025-01-09 18:29:40,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:29:40,743 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:29:40,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5282] [2025-01-09 18:29:40,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5289] [2025-01-09 18:29:40,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [5297-5298] [2025-01-09 18:29:40,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [5306-5307] [2025-01-09 18:29:40,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5320] [2025-01-09 18:29:40,849 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [5383] [2025-01-09 18:29:40,849 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0; sete %1": "+m" (v->counter), "=qm" (c): : "memory"); [5391-5392] [2025-01-09 18:29:40,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i[162928,162941] [2025-01-09 18:29:40,870 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"); [5963] [2025-01-09 18:29:40,870 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"); [5966] [2025-01-09 18:29:40,870 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"); [5969] [2025-01-09 18:29:40,870 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"); [5972] [2025-01-09 18:29:40,871 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"); [5975] [2025-01-09 18:29:40,871 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"); [5991-5992] [2025-01-09 18:29:40,871 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"); [5995-5996] [2025-01-09 18:29:40,872 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"); [5999-6000] [2025-01-09 18:29:40,872 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"); [6003-6004] [2025-01-09 18:29:40,872 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"); [6007-6008] [2025-01-09 18:29:40,930 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"); [6031-6032] [2025-01-09 18:29:40,930 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"); [6035-6036] [2025-01-09 18:29:40,931 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"); [6039-6040] [2025-01-09 18:29:40,931 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"); [6043-6044] [2025-01-09 18:29:40,931 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"); [6047-6048] [2025-01-09 18:29:40,934 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"); [6176] [2025-01-09 18:29:40,935 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"); [6179] [2025-01-09 18:29:40,935 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"); [6182] [2025-01-09 18:29:40,935 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"); [6185] [2025-01-09 18:29:40,935 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"); [6188] [2025-01-09 18:29:40,935 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu), "=r" (__val_gu): "0" (p), "i" (4UL)); [6200-6201] [2025-01-09 18:29:40,936 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" ((u32 *)argp): "ebx"); [6218-6219] [2025-01-09 18:29:40,936 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" ((u32 *)argp): "ebx"); [6222-6223] [2025-01-09 18:29:40,936 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" ((u32 *)argp): "ebx"); [6226-6227] [2025-01-09 18:29:40,936 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" ((u32 *)argp): "ebx"); [6230-6231] [2025-01-09 18:29:40,937 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" ((u32 *)argp): "ebx"); [6234-6235] [2025-01-09 18:29:40,937 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu___0), "=r" (__val_gu___0): "0" ((u32 *)argp), "i" (4UL)); [6247-6248] [2025-01-09 18:29:40,937 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" ((u32 *)argp): "ebx"); [6261-6262] [2025-01-09 18:29:40,937 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" ((u32 *)argp): "ebx"); [6265-6266] [2025-01-09 18:29:40,937 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" ((u32 *)argp): "ebx"); [6269-6270] [2025-01-09 18:29:40,938 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" ((u32 *)argp): "ebx"); [6273-6274] [2025-01-09 18:29:40,938 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" ((u32 *)argp): "ebx"); [6277-6278] [2025-01-09 18:29:40,938 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu___1), "=r" (__val_gu___1): "0" ((u32 *)argp), "i" (4UL)); [6290-6291] [2025-01-09 18:29:40,939 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6328-6329] [2025-01-09 18:29:40,939 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6332-6333] [2025-01-09 18:29:40,940 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6336-6337] [2025-01-09 18:29:40,940 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6340-6341] [2025-01-09 18:29:40,940 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___2): "0" (__pu_val___2), "c" (p): "ebx"); [6344-6345] [2025-01-09 18:29:40,940 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu___2), "=r" (__val_gu___2): "0" (p), "i" (4UL)); [6357-6358] [2025-01-09 18:29:41,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:29:41,053 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:29:41,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41 WrapperNode [2025-01-09 18:29:41,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:29:41,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:29:41,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:29:41,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:29:41,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,189 INFO L138 Inliner]: procedures = 180, calls = 596, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2725 [2025-01-09 18:29:41,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:29:41,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:29:41,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:29:41,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:29:41,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,462 INFO L175 MemorySlicer]: Split 317 memory accesses to 7 slices as follows [2, 28, 229, 20, 24, 1, 13]. 72 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 0, 6, 15, 0, 0, 0]. The 152 writes are split as follows [0, 13, 100, 2, 24, 0, 13]. [2025-01-09 18:29:41,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:29:41,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:29:41,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:29:41,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:29:41,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (1/1) ... [2025-01-09 18:29:41,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:29:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:29:41,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:29:41,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:29:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-01-09 18:29:41,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-01-09 18:29:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:29:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:29:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:29:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:29:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:29:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:29:41,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:29:41,652 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2025-01-09 18:29:41,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2025-01-09 18:29:41,652 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2025-01-09 18:29:41,652 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:29:41,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:29:41,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2025-01-09 18:29:41,654 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2025-01-09 18:29:41,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2025-01-09 18:29:41,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:29:41,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:29:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:29:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:29:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:29:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:29:41,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:29:41,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:29:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-01-09 18:29:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:29:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2025-01-09 18:29:41,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2025-01-09 18:29:41,656 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 18:29:41,658 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 18:29:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2025-01-09 18:29:41,658 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2025-01-09 18:29:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2025-01-09 18:29:41,658 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2025-01-09 18:29:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-01-09 18:29:41,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-01-09 18:29:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-09 18:29:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:29:41,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2025-01-09 18:29:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:29:41,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-01-09 18:29:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 18:29:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-01-09 18:29:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:29:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:29:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2025-01-09 18:29:41,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2025-01-09 18:29:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-01-09 18:29:41,662 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-01-09 18:29:42,048 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:29:42,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:29:42,467 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:29:51,966 INFO L? ?]: Removed 1325 outVars from TransFormulas that were not future-live. [2025-01-09 18:29:51,967 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:29:51,993 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:29:51,993 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 18:29:51,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:29:51 BoogieIcfgContainer [2025-01-09 18:29:51,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:29:51,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:29:51,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:29:51,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:29:51,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:29:39" (1/3) ... [2025-01-09 18:29:51,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a42464b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:29:51, skipping insertion in model container [2025-01-09 18:29:51,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:29:41" (2/3) ... [2025-01-09 18:29:51,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a42464b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:29:51, skipping insertion in model container [2025-01-09 18:29:51,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:29:51" (3/3) ... [2025-01-09 18:29:52,000 INFO L128 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i [2025-01-09 18:29:52,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:29:52,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_async.ko-entry_point.cil.out.i that has 45 procedures, 894 locations, 1 initial locations, 17 loop locations, and 1 error locations. [2025-01-09 18:29:52,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:29:52,073 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ab4e099, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:29:52,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:29:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 863 states, 705 states have (on average 1.4524822695035462) internal successors, (1024), 719 states have internal predecessors, (1024), 119 states have call successors, (119), 38 states have call predecessors, (119), 37 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2025-01-09 18:29:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 18:29:52,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:52,087 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:29:52,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:52,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash -456277, now seen corresponding path program 1 times [2025-01-09 18:29:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:52,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075797070] [2025-01-09 18:29:52,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:52,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 18:29:52,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 18:29:52,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 18:29:52,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075797070] [2025-01-09 18:29:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075797070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:29:52,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243466467] [2025-01-09 18:29:52,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:52,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:29:52,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:52,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:29:52,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:52,730 INFO L87 Difference]: Start difference. First operand has 863 states, 705 states have (on average 1.4524822695035462) internal successors, (1024), 719 states have internal predecessors, (1024), 119 states have call successors, (119), 38 states have call predecessors, (119), 37 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 18:29:56,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:29:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:56,937 INFO L93 Difference]: Finished difference Result 2530 states and 3752 transitions. [2025-01-09 18:29:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:29:56,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2025-01-09 18:29:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:56,960 INFO L225 Difference]: With dead ends: 2530 [2025-01-09 18:29:56,960 INFO L226 Difference]: Without dead ends: 1656 [2025-01-09 18:29:56,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:56,976 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1176 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:56,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 2476 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:29:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-01-09 18:29:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2025-01-09 18:29:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1368 states have (on average 1.4371345029239766) internal successors, (1966), 1384 states have internal predecessors, (1966), 215 states have call successors, (215), 73 states have call predecessors, (215), 72 states have return successors, (214), 214 states have call predecessors, (214), 214 states have call successors, (214) [2025-01-09 18:29:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2395 transitions. [2025-01-09 18:29:57,118 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2395 transitions. Word has length 78 [2025-01-09 18:29:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:57,119 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2395 transitions. [2025-01-09 18:29:57,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 18:29:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2395 transitions. [2025-01-09 18:29:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 18:29:57,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:57,125 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:29:57,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:29:57,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -627224147, now seen corresponding path program 1 times [2025-01-09 18:29:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016579298] [2025-01-09 18:29:57,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:57,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 18:29:57,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 18:29:57,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:57,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 18:29:57,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:57,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016579298] [2025-01-09 18:29:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016579298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:29:57,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991607074] [2025-01-09 18:29:57,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:57,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:29:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:57,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:29:57,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:29:57,563 INFO L87 Difference]: Start difference. First operand 1656 states and 2395 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 18:29:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:57,723 INFO L93 Difference]: Finished difference Result 4917 states and 7147 transitions. [2025-01-09 18:29:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:29:57,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2025-01-09 18:29:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:57,737 INFO L225 Difference]: With dead ends: 4917 [2025-01-09 18:29:57,737 INFO L226 Difference]: Without dead ends: 3277 [2025-01-09 18:29:57,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:29:57,741 INFO L435 NwaCegarLoop]: 1231 mSDtfsCounter, 1208 mSDsluCounter, 3652 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:57,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 4883 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:29:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-01-09 18:29:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3271. [2025-01-09 18:29:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 2708 states have (on average 1.4387001477104875) internal successors, (3896), 2740 states have internal predecessors, (3896), 418 states have call successors, (418), 145 states have call predecessors, (418), 144 states have return successors, (447), 417 states have call predecessors, (447), 417 states have call successors, (447) [2025-01-09 18:29:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4761 transitions. [2025-01-09 18:29:57,863 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4761 transitions. Word has length 82 [2025-01-09 18:29:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:57,864 INFO L471 AbstractCegarLoop]: Abstraction has 3271 states and 4761 transitions. [2025-01-09 18:29:57,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 18:29:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4761 transitions. [2025-01-09 18:29:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 18:29:57,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:57,872 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-01-09 18:29:57,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:29:57,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash -724107336, now seen corresponding path program 1 times [2025-01-09 18:29:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:57,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831448499] [2025-01-09 18:29:57,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:58,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 18:29:58,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 18:29:58,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:58,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 18:29:58,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831448499] [2025-01-09 18:29:58,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831448499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:58,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:58,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:29:58,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796813432] [2025-01-09 18:29:58,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:58,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:29:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:58,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:29:58,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:58,136 INFO L87 Difference]: Start difference. First operand 3271 states and 4761 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:29:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:58,283 INFO L93 Difference]: Finished difference Result 8156 states and 11874 transitions. [2025-01-09 18:29:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:29:58,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2025-01-09 18:29:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:58,304 INFO L225 Difference]: With dead ends: 8156 [2025-01-09 18:29:58,304 INFO L226 Difference]: Without dead ends: 4909 [2025-01-09 18:29:58,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:58,314 INFO L435 NwaCegarLoop]: 1240 mSDtfsCounter, 649 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:58,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 2398 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:29:58,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2025-01-09 18:29:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 4897. [2025-01-09 18:29:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4897 states, 4072 states have (on average 1.4447445972495088) internal successors, (5883), 4115 states have internal predecessors, (5883), 605 states have call successors, (605), 220 states have call predecessors, (605), 219 states have return successors, (644), 601 states have call predecessors, (644), 604 states have call successors, (644) [2025-01-09 18:29:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 7132 transitions. [2025-01-09 18:29:58,495 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 7132 transitions. Word has length 137 [2025-01-09 18:29:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:58,496 INFO L471 AbstractCegarLoop]: Abstraction has 4897 states and 7132 transitions. [2025-01-09 18:29:58,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 18:29:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 7132 transitions. [2025-01-09 18:29:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 18:29:58,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:58,503 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:29:58,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:29:58,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:58,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1634167659, now seen corresponding path program 1 times [2025-01-09 18:29:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:58,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049717876] [2025-01-09 18:29:58,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:58,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 18:29:58,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 18:29:58,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-01-09 18:29:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049717876] [2025-01-09 18:29:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049717876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:29:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018847699] [2025-01-09 18:29:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:58,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:29:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:58,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:29:58,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:58,711 INFO L87 Difference]: Start difference. First operand 4897 states and 7132 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:29:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:58,892 INFO L93 Difference]: Finished difference Result 11990 states and 17348 transitions. [2025-01-09 18:29:58,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:29:58,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 167 [2025-01-09 18:29:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:58,927 INFO L225 Difference]: With dead ends: 11990 [2025-01-09 18:29:58,929 INFO L226 Difference]: Without dead ends: 7117 [2025-01-09 18:29:58,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:58,946 INFO L435 NwaCegarLoop]: 1828 mSDtfsCounter, 786 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:58,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 3016 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:29:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2025-01-09 18:29:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 7103. [2025-01-09 18:29:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7103 states, 5908 states have (on average 1.4341570751523358) internal successors, (8473), 5976 states have internal predecessors, (8473), 847 states have call successors, (847), 348 states have call predecessors, (847), 347 states have return successors, (908), 842 states have call predecessors, (908), 846 states have call successors, (908) [2025-01-09 18:29:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7103 states to 7103 states and 10228 transitions. [2025-01-09 18:29:59,163 INFO L78 Accepts]: Start accepts. Automaton has 7103 states and 10228 transitions. Word has length 167 [2025-01-09 18:29:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:59,163 INFO L471 AbstractCegarLoop]: Abstraction has 7103 states and 10228 transitions. [2025-01-09 18:29:59,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 18:29:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7103 states and 10228 transitions. [2025-01-09 18:29:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 18:29:59,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:59,175 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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] [2025-01-09 18:29:59,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:29:59,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:59,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:59,176 INFO L85 PathProgramCache]: Analyzing trace with hash -543444676, now seen corresponding path program 1 times [2025-01-09 18:29:59,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:59,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654214985] [2025-01-09 18:29:59,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:59,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:59,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 18:29:59,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 18:29:59,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:59,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-01-09 18:29:59,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654214985] [2025-01-09 18:29:59,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654214985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:59,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:59,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:29:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110558399] [2025-01-09 18:29:59,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:59,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:29:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:59,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:29:59,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:29:59,494 INFO L87 Difference]: Start difference. First operand 7103 states and 10228 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 18:30:03,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:30:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:03,859 INFO L93 Difference]: Finished difference Result 17151 states and 24652 transitions. [2025-01-09 18:30:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:03,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-01-09 18:30:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:03,908 INFO L225 Difference]: With dead ends: 17151 [2025-01-09 18:30:03,909 INFO L226 Difference]: Without dead ends: 10083 [2025-01-09 18:30:03,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:03,932 INFO L435 NwaCegarLoop]: 1276 mSDtfsCounter, 855 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:03,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 2406 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:30:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10083 states. [2025-01-09 18:30:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10083 to 10059. [2025-01-09 18:30:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10059 states, 8342 states have (on average 1.4266362982498202) internal successors, (11901), 8436 states have internal predecessors, (11901), 1175 states have call successors, (1175), 542 states have call predecessors, (1175), 541 states have return successors, (1264), 1168 states have call predecessors, (1264), 1174 states have call successors, (1264) [2025-01-09 18:30:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10059 states to 10059 states and 14340 transitions. [2025-01-09 18:30:04,294 INFO L78 Accepts]: Start accepts. Automaton has 10059 states and 14340 transitions. Word has length 160 [2025-01-09 18:30:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:04,295 INFO L471 AbstractCegarLoop]: Abstraction has 10059 states and 14340 transitions. [2025-01-09 18:30:04,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 18:30:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 10059 states and 14340 transitions. [2025-01-09 18:30:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 18:30:04,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:04,308 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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] [2025-01-09 18:30:04,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:30:04,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:04,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:04,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1400541358, now seen corresponding path program 1 times [2025-01-09 18:30:04,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:04,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678988749] [2025-01-09 18:30:04,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:04,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:04,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 18:30:04,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 18:30:04,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:04,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 18:30:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678988749] [2025-01-09 18:30:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678988749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:04,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056788020] [2025-01-09 18:30:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:04,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:04,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:04,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:04,486 INFO L87 Difference]: Start difference. First operand 10059 states and 14340 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:30:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:04,692 INFO L93 Difference]: Finished difference Result 15116 states and 21695 transitions. [2025-01-09 18:30:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2025-01-09 18:30:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:04,738 INFO L225 Difference]: With dead ends: 15116 [2025-01-09 18:30:04,739 INFO L226 Difference]: Without dead ends: 10079 [2025-01-09 18:30:04,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:04,754 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 3 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:04,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2453 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:30:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10079 states. [2025-01-09 18:30:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10079 to 10079. [2025-01-09 18:30:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10079 states, 8362 states have (on average 1.4256158813680937) internal successors, (11921), 8456 states have internal predecessors, (11921), 1175 states have call successors, (1175), 542 states have call predecessors, (1175), 541 states have return successors, (1264), 1168 states have call predecessors, (1264), 1174 states have call successors, (1264) [2025-01-09 18:30:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10079 states to 10079 states and 14360 transitions. [2025-01-09 18:30:04,974 INFO L78 Accepts]: Start accepts. Automaton has 10079 states and 14360 transitions. Word has length 165 [2025-01-09 18:30:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:04,974 INFO L471 AbstractCegarLoop]: Abstraction has 10079 states and 14360 transitions. [2025-01-09 18:30:04,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:30:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 10079 states and 14360 transitions. [2025-01-09 18:30:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 18:30:04,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:04,986 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:30:04,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:30:04,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:04,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash -175977619, now seen corresponding path program 1 times [2025-01-09 18:30:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:04,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458966469] [2025-01-09 18:30:04,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:05,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 18:30:05,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 18:30:05,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:05,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-01-09 18:30:05,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458966469] [2025-01-09 18:30:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458966469] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889332415] [2025-01-09 18:30:05,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:05,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:05,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:05,649 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:30:05,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:30:06,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 18:30:06,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 18:30:06,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:06,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:06,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 18:30:06,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 88 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-09 18:30:06,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:30:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 18:30:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889332415] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:30:07,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:30:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-01-09 18:30:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84714807] [2025-01-09 18:30:07,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:30:07,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 18:30:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:07,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 18:30:07,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 18:30:07,456 INFO L87 Difference]: Start difference. First operand 10079 states and 14360 transitions. Second operand has 15 states, 15 states have (on average 11.466666666666667) internal successors, (172), 14 states have internal predecessors, (172), 9 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 9 states have call predecessors, (38), 8 states have call successors, (38) [2025-01-09 18:30:11,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 [] [2025-01-09 18:30:15,472 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 [] [2025-01-09 18:30:19,477 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 [] [2025-01-09 18:30:23,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:30:27,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:30:31,501 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 [] [2025-01-09 18:30:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:35,845 INFO L93 Difference]: Finished difference Result 28364 states and 40884 transitions. [2025-01-09 18:30:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 18:30:35,846 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.466666666666667) internal successors, (172), 14 states have internal predecessors, (172), 9 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 9 states have call predecessors, (38), 8 states have call successors, (38) Word has length 167 [2025-01-09 18:30:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:35,902 INFO L225 Difference]: With dead ends: 28364 [2025-01-09 18:30:35,903 INFO L226 Difference]: Without dead ends: 18320 [2025-01-09 18:30:35,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 335 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2025-01-09 18:30:35,930 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 3967 mSDsluCounter, 10317 mSDsCounter, 0 mSdLazyCounter, 4635 mSolverCounterSat, 684 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 SdHoareTripleChecker+Valid, 11669 SdHoareTripleChecker+Invalid, 5325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 684 IncrementalHoareTripleChecker+Valid, 4635 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:35,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 11669 Invalid, 5325 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [684 Valid, 4635 Invalid, 6 Unknown, 0 Unchecked, 27.7s Time] [2025-01-09 18:30:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18320 states. [2025-01-09 18:30:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18320 to 17984. [2025-01-09 18:30:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17984 states, 14934 states have (on average 1.428686219365207) internal successors, (21336), 15134 states have internal predecessors, (21336), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 938 states have return successors, (2340), 2094 states have call predecessors, (2340), 2110 states have call successors, (2340) [2025-01-09 18:30:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17984 states to 17984 states and 25787 transitions. [2025-01-09 18:30:36,345 INFO L78 Accepts]: Start accepts. Automaton has 17984 states and 25787 transitions. Word has length 167 [2025-01-09 18:30:36,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:36,346 INFO L471 AbstractCegarLoop]: Abstraction has 17984 states and 25787 transitions. [2025-01-09 18:30:36,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.466666666666667) internal successors, (172), 14 states have internal predecessors, (172), 9 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 9 states have call predecessors, (38), 8 states have call successors, (38) [2025-01-09 18:30:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 17984 states and 25787 transitions. [2025-01-09 18:30:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 18:30:36,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:36,362 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:30:36,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 18:30:36,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:36,564 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:36,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1812732415, now seen corresponding path program 1 times [2025-01-09 18:30:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:36,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783376835] [2025-01-09 18:30:36,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:36,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:36,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 18:30:36,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 18:30:36,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:36,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-01-09 18:30:36,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:36,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783376835] [2025-01-09 18:30:36,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783376835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:36,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:36,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:30:36,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357273760] [2025-01-09 18:30:36,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:36,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:30:36,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:36,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:30:36,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:30:36,822 INFO L87 Difference]: Start difference. First operand 17984 states and 25787 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:30:40,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:30:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:41,228 INFO L93 Difference]: Finished difference Result 42003 states and 59996 transitions. [2025-01-09 18:30:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:30:41,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 201 [2025-01-09 18:30:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:41,312 INFO L225 Difference]: With dead ends: 42003 [2025-01-09 18:30:41,313 INFO L226 Difference]: Without dead ends: 24054 [2025-01-09 18:30:41,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:41,354 INFO L435 NwaCegarLoop]: 2098 mSDtfsCounter, 870 mSDsluCounter, 3317 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:41,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5415 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:30:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24054 states. [2025-01-09 18:30:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24054 to 18008. [2025-01-09 18:30:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18008 states, 14958 states have (on average 1.4279983955074207) internal successors, (21360), 15158 states have internal predecessors, (21360), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 938 states have return successors, (2340), 2094 states have call predecessors, (2340), 2110 states have call successors, (2340) [2025-01-09 18:30:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18008 states to 18008 states and 25811 transitions. [2025-01-09 18:30:42,138 INFO L78 Accepts]: Start accepts. Automaton has 18008 states and 25811 transitions. Word has length 201 [2025-01-09 18:30:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:42,138 INFO L471 AbstractCegarLoop]: Abstraction has 18008 states and 25811 transitions. [2025-01-09 18:30:42,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 18:30:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 18008 states and 25811 transitions. [2025-01-09 18:30:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 18:30:42,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:42,153 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:30:42,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:30:42,153 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:42,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash -940705690, now seen corresponding path program 1 times [2025-01-09 18:30:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:42,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772682297] [2025-01-09 18:30:42,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:42,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:42,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 18:30:42,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 18:30:42,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:42,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 18:30:42,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:42,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772682297] [2025-01-09 18:30:42,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772682297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:42,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190293145] [2025-01-09 18:30:42,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:42,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:42,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:42,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:42,448 INFO L87 Difference]: Start difference. First operand 18008 states and 25811 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:30:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:42,787 INFO L93 Difference]: Finished difference Result 35993 states and 51601 transitions. [2025-01-09 18:30:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:30:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 214 [2025-01-09 18:30:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:42,850 INFO L225 Difference]: With dead ends: 35993 [2025-01-09 18:30:42,850 INFO L226 Difference]: Without dead ends: 18020 [2025-01-09 18:30:42,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:42,877 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 0 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:42,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2454 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:30:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18020 states. [2025-01-09 18:30:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18020 to 18020. [2025-01-09 18:30:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18020 states, 14970 states have (on average 1.4276553106212424) internal successors, (21372), 15170 states have internal predecessors, (21372), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 938 states have return successors, (2340), 2094 states have call predecessors, (2340), 2110 states have call successors, (2340) [2025-01-09 18:30:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18020 states to 18020 states and 25823 transitions. [2025-01-09 18:30:43,356 INFO L78 Accepts]: Start accepts. Automaton has 18020 states and 25823 transitions. Word has length 214 [2025-01-09 18:30:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 18020 states and 25823 transitions. [2025-01-09 18:30:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:30:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 18020 states and 25823 transitions. [2025-01-09 18:30:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 18:30:43,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:43,376 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:30:43,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:30:43,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:43,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2093344356, now seen corresponding path program 1 times [2025-01-09 18:30:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:43,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506569239] [2025-01-09 18:30:43,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:43,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 18:30:43,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 18:30:43,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:43,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-01-09 18:30:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506569239] [2025-01-09 18:30:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506569239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:43,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:30:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380509523] [2025-01-09 18:30:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:43,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:30:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:43,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:30:43,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:43,885 INFO L87 Difference]: Start difference. First operand 18020 states and 25823 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:30:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:44,280 INFO L93 Difference]: Finished difference Result 36067 states and 51714 transitions. [2025-01-09 18:30:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:30:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 214 [2025-01-09 18:30:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:44,363 INFO L225 Difference]: With dead ends: 36067 [2025-01-09 18:30:44,363 INFO L226 Difference]: Without dead ends: 18082 [2025-01-09 18:30:44,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:44,409 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 0 mSDsluCounter, 3682 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4911 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:44,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4911 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:30:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18082 states. [2025-01-09 18:30:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18082 to 18068. [2025-01-09 18:30:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18068 states, 15006 states have (on average 1.4266293482606958) internal successors, (21408), 15206 states have internal predecessors, (21408), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 950 states have return successors, (2355), 2106 states have call predecessors, (2355), 2110 states have call successors, (2355) [2025-01-09 18:30:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18068 states to 18068 states and 25874 transitions. [2025-01-09 18:30:45,044 INFO L78 Accepts]: Start accepts. Automaton has 18068 states and 25874 transitions. Word has length 214 [2025-01-09 18:30:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:45,044 INFO L471 AbstractCegarLoop]: Abstraction has 18068 states and 25874 transitions. [2025-01-09 18:30:45,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:30:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 18068 states and 25874 transitions. [2025-01-09 18:30:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 18:30:45,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:45,057 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:30:45,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:30:45,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:45,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:45,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1816690450, now seen corresponding path program 1 times [2025-01-09 18:30:45,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:45,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975083094] [2025-01-09 18:30:45,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:45,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 18:30:45,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 18:30:45,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:45,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-01-09 18:30:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975083094] [2025-01-09 18:30:45,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975083094] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110993806] [2025-01-09 18:30:45,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:45,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:45,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:45,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:30:45,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:30:45,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 18:30:45,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 18:30:45,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:45,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:45,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1620 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:30:45,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-01-09 18:30:45,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:30:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110993806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:45,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:30:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-01-09 18:30:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47196799] [2025-01-09 18:30:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:45,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:30:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:45,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:30:45,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:30:45,951 INFO L87 Difference]: Start difference. First operand 18068 states and 25874 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 18:30:49,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:30:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:50,453 INFO L93 Difference]: Finished difference Result 42207 states and 60206 transitions. [2025-01-09 18:30:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 18:30:50,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 221 [2025-01-09 18:30:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:50,537 INFO L225 Difference]: With dead ends: 42207 [2025-01-09 18:30:50,537 INFO L226 Difference]: Without dead ends: 24174 [2025-01-09 18:30:50,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 18:30:50,566 INFO L435 NwaCegarLoop]: 2089 mSDtfsCounter, 881 mSDsluCounter, 5333 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 7422 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:50,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 7422 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:30:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24174 states. [2025-01-09 18:30:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24174 to 18080. [2025-01-09 18:30:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18080 states, 15018 states have (on average 1.4262884538553735) internal successors, (21420), 15206 states have internal predecessors, (21420), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 950 states have return successors, (2355), 2106 states have call predecessors, (2355), 2110 states have call successors, (2355) [2025-01-09 18:30:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18080 states to 18080 states and 25886 transitions. [2025-01-09 18:30:50,980 INFO L78 Accepts]: Start accepts. Automaton has 18080 states and 25886 transitions. Word has length 221 [2025-01-09 18:30:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:50,981 INFO L471 AbstractCegarLoop]: Abstraction has 18080 states and 25886 transitions. [2025-01-09 18:30:50,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 18:30:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 18080 states and 25886 transitions. [2025-01-09 18:30:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-09 18:30:50,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:50,994 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:30:51,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 18:30:51,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:51,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:51,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2078812227, now seen corresponding path program 1 times [2025-01-09 18:30:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:51,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760557300] [2025-01-09 18:30:51,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-09 18:30:51,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-09 18:30:51,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:51,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-09 18:30:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760557300] [2025-01-09 18:30:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760557300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:30:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248343055] [2025-01-09 18:30:51,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:51,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:51,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:30:51,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:30:51,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 18:30:52,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-09 18:30:52,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-09 18:30:52,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:52,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:52,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 2364 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:30:52,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:30:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-09 18:30:52,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:30:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248343055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:30:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 18:30:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847124902] [2025-01-09 18:30:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:30:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:52,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:30:52,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:52,639 INFO L87 Difference]: Start difference. First operand 18080 states and 25886 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 4 states have call successors, (28), 4 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 18:30:56,650 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 [] [2025-01-09 18:30:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:30:57,285 INFO L93 Difference]: Finished difference Result 24218 states and 34424 transitions. [2025-01-09 18:30:57,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:30:57,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 4 states have call successors, (28), 4 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 259 [2025-01-09 18:30:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:30:57,468 INFO L225 Difference]: With dead ends: 24218 [2025-01-09 18:30:57,469 INFO L226 Difference]: Without dead ends: 24180 [2025-01-09 18:30:57,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:30:57,483 INFO L435 NwaCegarLoop]: 2075 mSDtfsCounter, 2165 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:30:57,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 2800 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 187 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 18:30:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24180 states. [2025-01-09 18:30:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24180 to 22474. [2025-01-09 18:30:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22474 states, 18610 states have (on average 1.4186996238581409) internal successors, (26402), 18838 states have internal predecessors, (26402), 2657 states have call successors, (2657), 1159 states have call predecessors, (2657), 1206 states have return successors, (2989), 2656 states have call predecessors, (2989), 2656 states have call successors, (2989) [2025-01-09 18:30:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 32048 transitions. [2025-01-09 18:30:58,489 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 32048 transitions. Word has length 259 [2025-01-09 18:30:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:30:58,491 INFO L471 AbstractCegarLoop]: Abstraction has 22474 states and 32048 transitions. [2025-01-09 18:30:58,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 4 states have call successors, (28), 4 states have call predecessors, (28), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 18:30:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 32048 transitions. [2025-01-09 18:30:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-09 18:30:58,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:30:58,505 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:30:58,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 18:30:58,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:30:58,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:30:58,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:30:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2007156415, now seen corresponding path program 1 times [2025-01-09 18:30:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:30:58,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044037603] [2025-01-09 18:30:58,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:30:58,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:30:58,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 18:30:58,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 18:30:58,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:30:58,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:30:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-01-09 18:30:59,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:30:59,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044037603] [2025-01-09 18:30:59,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044037603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:30:59,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:30:59,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:30:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093549519] [2025-01-09 18:30:59,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:30:59,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:30:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:30:59,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:30:59,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:30:59,198 INFO L87 Difference]: Start difference. First operand 22474 states and 32048 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 18:31:03,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:31:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:31:03,658 INFO L93 Difference]: Finished difference Result 33585 states and 47928 transitions. [2025-01-09 18:31:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:31:03,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 263 [2025-01-09 18:31:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:31:03,703 INFO L225 Difference]: With dead ends: 33585 [2025-01-09 18:31:03,704 INFO L226 Difference]: Without dead ends: 9496 [2025-01-09 18:31:03,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:31:03,743 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 1084 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:31:03,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:31:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9496 states. [2025-01-09 18:31:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9496 to 9496. [2025-01-09 18:31:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9496 states, 7826 states have (on average 1.4081267569639662) internal successors, (11020), 7924 states have internal predecessors, (11020), 1135 states have call successors, (1135), 512 states have call predecessors, (1135), 534 states have return successors, (1282), 1140 states have call predecessors, (1282), 1134 states have call successors, (1282) [2025-01-09 18:31:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9496 states to 9496 states and 13437 transitions. [2025-01-09 18:31:03,980 INFO L78 Accepts]: Start accepts. Automaton has 9496 states and 13437 transitions. Word has length 263 [2025-01-09 18:31:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:31:03,981 INFO L471 AbstractCegarLoop]: Abstraction has 9496 states and 13437 transitions. [2025-01-09 18:31:03,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 3 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 18:31:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 9496 states and 13437 transitions. [2025-01-09 18:31:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-09 18:31:03,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:31:03,989 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:31:03,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:31:03,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:31:03,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:31:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1766326382, now seen corresponding path program 1 times [2025-01-09 18:31:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:31:03,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545448522] [2025-01-09 18:31:03,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:31:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:31:04,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 18:31:04,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 18:31:04,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:31:04,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:31:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-01-09 18:31:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:31:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545448522] [2025-01-09 18:31:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545448522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:31:04,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:31:04,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 18:31:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59229482] [2025-01-09 18:31:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:31:04,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 18:31:04,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:31:04,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 18:31:04,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 18:31:04,944 INFO L87 Difference]: Start difference. First operand 9496 states and 13437 transitions. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 7 states have internal predecessors, (165), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28)