./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 c00e63dc 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-?-c00e63d-m [2025-02-06 06:24:03,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:24:03,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:24:03,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:24:03,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:24:03,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:24:03,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:24:03,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:24:03,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:24:03,771 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:24:03,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:24:03,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:24:03,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:24:03,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:24:03,771 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:24:03,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:24:03,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:24:03,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:24:03,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:24:03,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:24:03,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:24:03,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:24:03,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:24:03,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:24:03,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:24:03,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:24:03,773 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-02-06 06:24:04,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:24:04,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:24:04,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:24:04,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:24:04,040 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:24:04,041 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-02-06 06:24:05,259 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1a56dc2/c6a1e6c06d264fa9a4c96aca9260bc90/FLAGf06e8295e [2025-02-06 06:24:05,638 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:24:05,640 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-02-06 06:24:05,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1a56dc2/c6a1e6c06d264fa9a4c96aca9260bc90/FLAGf06e8295e [2025-02-06 06:24:05,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1a56dc2/c6a1e6c06d264fa9a4c96aca9260bc90 [2025-02-06 06:24:05,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:24:05,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:24:05,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:24:05,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:24:05,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:24:05,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:24:05" (1/1) ... [2025-02-06 06:24:05,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552f1551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:05, skipping insertion in model container [2025-02-06 06:24:05,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:24:05" (1/1) ... [2025-02-06 06:24:05,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:24:06,335 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-02-06 06:24:06,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:24:06,685 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:24:06,787 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-02-06 06:24:06,789 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-02-06 06:24:06,789 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-02-06 06:24:06,790 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-02-06 06:24:06,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5320] [2025-02-06 06:24:06,794 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-02-06 06:24:06,795 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-02-06 06:24:06,811 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-02-06 06:24:06,832 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-02-06 06:24:06,835 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-02-06 06:24:06,835 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-02-06 06:24:06,835 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-02-06 06:24:06,835 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-02-06 06:24:06,836 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-02-06 06:24:06,836 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-02-06 06:24:06,836 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-02-06 06:24:06,836 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-02-06 06:24:06,836 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-02-06 06:24:06,837 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-02-06 06:24:06,837 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-02-06 06:24:06,837 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-02-06 06:24:06,837 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-02-06 06:24:06,837 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-02-06 06:24:06,843 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-02-06 06:24:06,844 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-02-06 06:24:06,845 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-02-06 06:24:06,845 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-02-06 06:24:06,845 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-02-06 06:24:06,847 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-02-06 06:24:06,848 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-02-06 06:24:06,848 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-02-06 06:24:06,848 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-02-06 06:24:06,849 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-02-06 06:24:06,849 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-02-06 06:24:06,849 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-02-06 06:24:06,849 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-02-06 06:24:06,850 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-02-06 06:24:06,850 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-02-06 06:24:06,850 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-02-06 06:24:06,850 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-02-06 06:24:06,851 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-02-06 06:24:06,852 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-02-06 06:24:06,852 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-02-06 06:24:06,853 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-02-06 06:24:06,853 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-02-06 06:24:06,853 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-02-06 06:24:06,854 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-02-06 06:24:06,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:24:07,040 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:24:07,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07 WrapperNode [2025-02-06 06:24:07,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:24:07,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:24:07,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:24:07,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:24:07,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,173 INFO L138 Inliner]: procedures = 180, calls = 596, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2725 [2025-02-06 06:24:07,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:24:07,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:24:07,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:24:07,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:24:07,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,396 INFO L175 MemorySlicer]: Split 317 memory accesses to 7 slices as follows [2, 1, 28, 20, 229, 13, 24]. 72 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 0, 0, 15, 6, 0, 0]. The 152 writes are split as follows [0, 0, 13, 2, 100, 13, 24]. [2025-02-06 06:24:07,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,451 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:24:07,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:24:07,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:24:07,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:24:07,498 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (1/1) ... [2025-02-06 06:24:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:24:07,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:24:07,527 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-02-06 06:24:07,534 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-02-06 06:24:07,556 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-02-06 06:24:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-02-06 06:24:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:24:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2025-02-06 06:24:07,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2025-02-06 06:24:07,558 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 06:24:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 06:24:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 06:24:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 06:24:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:24:07,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:24:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:24:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:24:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2025-02-06 06:24:07,561 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2025-02-06 06:24:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2025-02-06 06:24:07,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2025-02-06 06:24:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2025-02-06 06:24:07,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2025-02-06 06:24:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:24:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:24:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:24:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:24:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:24:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:24:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:24:07,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:24:07,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:24:07,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:24:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2025-02-06 06:24:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2025-02-06 06:24:07,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-02-06 06:24:07,564 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-02-06 06:24:07,564 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-02-06 06:24:07,564 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2025-02-06 06:24:07,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-02-06 06:24:07,564 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-02-06 06:24:07,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-02-06 06:24:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-02-06 06:24:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-02-06 06:24:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-02-06 06:24:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 06:24:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 06:24:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-02-06 06:24:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-02-06 06:24:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2025-02-06 06:24:07,568 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2025-02-06 06:24:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:24:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-02-06 06:24:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 06:24:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-02-06 06:24:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:24:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2025-02-06 06:24:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2025-02-06 06:24:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-02-06 06:24:07,569 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-02-06 06:24:07,946 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:24:07,949 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:24:08,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:24:08,415 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5759: havoc #t~bitwise124;havoc #t~mem125;havoc #t~bitwise126; [2025-02-06 06:24:08,439 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5314: havoc #t~mem1;havoc #t~bitwise2; [2025-02-06 06:24:08,470 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5327: havoc __fswab16_#t~bitwise3#1; [2025-02-06 06:24:08,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7647: havoc #t~nondet424; [2025-02-06 06:24:08,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7719: havoc #t~nondet430; [2025-02-06 06:24:08,842 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7643: havoc #t~nondet423; [2025-02-06 06:24:17,628 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5586: havoc skb_tailroom_#t~ite71#1;havoc skb_tailroom_#t~mem69#1;havoc skb_tailroom_#t~mem70#1; [2025-02-06 06:24:17,628 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7767: havoc tty_unregister_ldisc_#t~nondet439#1; [2025-02-06 06:24:17,628 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5455: havoc __kmalloc_#t~ret35#1.base, __kmalloc_#t~ret35#1.offset; [2025-02-06 06:24:17,628 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5556: call ULTIMATE.dealloc(skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset);havoc skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7708: havoc ppp_register_channel_#t~nondet428#1; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5830: call ULTIMATE.dealloc(ppp_asynctty_open_~#__key~2#1.base, ppp_asynctty_open_~#__key~2#1.offset);havoc ppp_asynctty_open_~#__key~2#1.base, ppp_asynctty_open_~#__key~2#1.offset;call ULTIMATE.dealloc(ppp_asynctty_open_~#__key___0~0#1.base, ppp_asynctty_open_~#__key___0~0#1.offset);havoc ppp_asynctty_open_~#__key___0~0#1.base, ppp_asynctty_open_~#__key___0~0#1.offset; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5700: call ULTIMATE.dealloc(sema_init_~#__key~1#1.base, sema_init_~#__key~1#1.offset);havoc sema_init_~#__key~1#1.base, sema_init_~#__key~1#1.offset;call ULTIMATE.dealloc(sema_init_~#__constr_expr_0~0#1.base, sema_init_~#__constr_expr_0~0#1.offset);havoc sema_init_~#__constr_expr_0~0#1.base, sema_init_~#__constr_expr_0~0#1.offset; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5569: havoc skb_is_nonlinear_#t~mem59#1; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5540: havoc skb_queue_empty_#t~mem55#1.base, skb_queue_empty_#t~mem55#1.offset; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7722: havoc skb_pull_#t~ret431#1.base, skb_pull_#t~ret431#1.offset; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5578: havoc skb_headroom_#t~mem66#1.base, skb_headroom_#t~mem66#1.offset;havoc skb_headroom_#t~mem67#1.base, skb_headroom_#t~mem67#1.offset; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7725: havoc skb_push_#t~ret432#1.base, skb_push_#t~ret432#1.offset; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7759: havoc tty_register_ldisc_#t~nondet437#1; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6143: call ULTIMATE.dealloc(ppp_async_ioctl_~#accm~0#1.base, ppp_async_ioctl_~#accm~0#1.offset);havoc ppp_async_ioctl_~#accm~0#1.base, ppp_async_ioctl_~#accm~0#1.offset; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7663: havoc _raw_spin_lock_irqsave_#t~nondet425#1; [2025-02-06 06:24:17,629 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7763: havoc tty_termios_baud_rate_#t~nondet438#1; [2025-02-06 06:24:17,695 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc ppp_channel_index_#t~nondet427#1; [2025-02-06 06:24:17,695 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7691: havoc n_tty_ioctl_helper_#t~nondet426#1; [2025-02-06 06:24:17,695 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7712: havoc ppp_unit_number_#t~nondet429#1; [2025-02-06 06:24:17,695 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7755: havoc tty_mode_ioctl_#t~nondet436#1; [2025-02-06 06:24:17,917 INFO L? ?]: Removed 1325 outVars from TransFormulas that were not future-live. [2025-02-06 06:24:17,917 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:24:17,957 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:24:17,957 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 06:24:17,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:24:17 BoogieIcfgContainer [2025-02-06 06:24:17,958 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:24:17,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:24:17,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:24:17,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:24:17,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:24:05" (1/3) ... [2025-02-06 06:24:17,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654ad6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:24:17, skipping insertion in model container [2025-02-06 06:24:17,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:24:07" (2/3) ... [2025-02-06 06:24:17,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654ad6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:24:17, skipping insertion in model container [2025-02-06 06:24:17,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:24:17" (3/3) ... [2025-02-06 06:24:17,965 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-02-06 06:24:17,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:24:17,983 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-02-06 06:24:18,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:24:18,042 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;@3dbdc104, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:24:18,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:24:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 867 states, 705 states have (on average 1.4524822695035462) internal successors, (1024), 723 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-02-06 06:24:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 06:24:18,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:24:18,057 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-02-06 06:24:18,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:24:18,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:24:18,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2005532218, now seen corresponding path program 1 times [2025-02-06 06:24:18,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:24:18,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255112528] [2025-02-06 06:24:18,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:24:18,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 06:24:18,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 06:24:18,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:18,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 06:24:18,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:24:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255112528] [2025-02-06 06:24:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255112528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:24:18,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:24:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:24:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238651041] [2025-02-06 06:24:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:24:18,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:24:18,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:24:18,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:24:18,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:24:18,713 INFO L87 Difference]: Start difference. First operand has 867 states, 705 states have (on average 1.4524822695035462) internal successors, (1024), 723 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-02-06 06:24:22,739 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-02-06 06:24:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:24:23,066 INFO L93 Difference]: Finished difference Result 2541 states and 3752 transitions. [2025-02-06 06:24:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:24:23,068 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-02-06 06:24:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:24:23,087 INFO L225 Difference]: With dead ends: 2541 [2025-02-06 06:24:23,087 INFO L226 Difference]: Without dead ends: 1656 [2025-02-06 06:24:23,096 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-02-06 06:24:23,098 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 1176 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:24:23,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 2402 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 06:24:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-02-06 06:24:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2025-02-06 06:24:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1368 states have (on average 1.4320175438596492) internal successors, (1959), 1384 states have internal predecessors, (1959), 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-02-06 06:24:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2388 transitions. [2025-02-06 06:24:23,244 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2388 transitions. Word has length 78 [2025-02-06 06:24:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:24:23,246 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2388 transitions. [2025-02-06 06:24:23,247 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-02-06 06:24:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2388 transitions. [2025-02-06 06:24:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 06:24:23,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:24:23,252 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-02-06 06:24:23,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:24:23,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:24:23,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:24:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash -850686644, now seen corresponding path program 1 times [2025-02-06 06:24:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:24:23,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164327117] [2025-02-06 06:24:23,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:24:23,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 06:24:23,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 06:24:23,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:23,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 06:24:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:24:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164327117] [2025-02-06 06:24:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164327117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:24:23,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:24:23,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:24:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474746464] [2025-02-06 06:24:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:24:23,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:24:23,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:24:23,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:24:23,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:24:23,657 INFO L87 Difference]: Start difference. First operand 1656 states and 2388 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-02-06 06:24:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:24:24,028 INFO L93 Difference]: Finished difference Result 4917 states and 7126 transitions. [2025-02-06 06:24:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:24:24,029 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-02-06 06:24:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:24:24,047 INFO L225 Difference]: With dead ends: 4917 [2025-02-06 06:24:24,047 INFO L226 Difference]: Without dead ends: 3277 [2025-02-06 06:24:24,053 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-02-06 06:24:24,053 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 1204 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:24:24,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 4753 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:24:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2025-02-06 06:24:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3271. [2025-02-06 06:24:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 2708 states have (on average 1.4335302806499262) internal successors, (3882), 2740 states have internal predecessors, (3882), 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-02-06 06:24:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4747 transitions. [2025-02-06 06:24:24,224 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4747 transitions. Word has length 82 [2025-02-06 06:24:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:24:24,225 INFO L471 AbstractCegarLoop]: Abstraction has 3271 states and 4747 transitions. [2025-02-06 06:24:24,225 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-02-06 06:24:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4747 transitions. [2025-02-06 06:24:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 06:24:24,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:24:24,239 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-02-06 06:24:24,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:24:24,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:24:24,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:24:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash 255311801, now seen corresponding path program 1 times [2025-02-06 06:24:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:24:24,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757610384] [2025-02-06 06:24:24,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:24,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:24:24,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 06:24:24,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 06:24:24,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:24,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-06 06:24:24,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:24:24,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757610384] [2025-02-06 06:24:24,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757610384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:24:24,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:24:24,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:24:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382170564] [2025-02-06 06:24:24,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:24:24,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:24:24,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:24:24,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:24:24,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:24:24,463 INFO L87 Difference]: Start difference. First operand 3271 states and 4747 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-02-06 06:24:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:24:24,741 INFO L93 Difference]: Finished difference Result 7361 states and 10673 transitions. [2025-02-06 06:24:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:24:24,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 140 [2025-02-06 06:24:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:24:24,766 INFO L225 Difference]: With dead ends: 7361 [2025-02-06 06:24:24,766 INFO L226 Difference]: Without dead ends: 4112 [2025-02-06 06:24:24,776 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-02-06 06:24:24,777 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 637 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:24:24,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 2308 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:24:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2025-02-06 06:24:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 4102. [2025-02-06 06:24:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 3403 states have (on average 1.4354980899206582) internal successors, (4885), 3441 states have internal predecessors, (4885), 514 states have call successors, (514), 185 states have call predecessors, (514), 184 states have return successors, (548), 511 states have call predecessors, (548), 513 states have call successors, (548) [2025-02-06 06:24:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5947 transitions. [2025-02-06 06:24:24,956 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5947 transitions. Word has length 140 [2025-02-06 06:24:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:24:24,957 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 5947 transitions. [2025-02-06 06:24:24,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-02-06 06:24:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5947 transitions. [2025-02-06 06:24:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 06:24:24,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:24:24,970 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, 1, 1] [2025-02-06 06:24:24,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:24:24,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:24:24,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:24:24,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1016585852, now seen corresponding path program 1 times [2025-02-06 06:24:24,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:24:24,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129593804] [2025-02-06 06:24:24,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:24,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:24:25,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 06:24:25,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 06:24:25,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:25,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-02-06 06:24:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:24:25,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129593804] [2025-02-06 06:24:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129593804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:24:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:24:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:24:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557892849] [2025-02-06 06:24:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:24:25,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:24:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:24:25,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:24:25,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:24:25,167 INFO L87 Difference]: Start difference. First operand 4102 states and 5947 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-02-06 06:24:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:24:25,340 INFO L93 Difference]: Finished difference Result 7397 states and 10715 transitions. [2025-02-06 06:24:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:24:25,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 169 [2025-02-06 06:24:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:24:25,356 INFO L225 Difference]: With dead ends: 7397 [2025-02-06 06:24:25,356 INFO L226 Difference]: Without dead ends: 3318 [2025-02-06 06:24:25,367 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-02-06 06:24:25,367 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 68 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:24:25,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 2338 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:24:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2025-02-06 06:24:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 3318. [2025-02-06 06:24:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 2746 states have (on average 1.4300801165331392) internal successors, (3927), 2779 states have internal predecessors, (3927), 422 states have call successors, (422), 150 states have call predecessors, (422), 149 states have return successors, (451), 420 states have call predecessors, (451), 421 states have call successors, (451) [2025-02-06 06:24:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4800 transitions. [2025-02-06 06:24:25,504 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4800 transitions. Word has length 169 [2025-02-06 06:24:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:24:25,504 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 4800 transitions. [2025-02-06 06:24:25,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-02-06 06:24:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4800 transitions. [2025-02-06 06:24:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 06:24:25,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:24:25,510 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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] [2025-02-06 06:24:25,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:24:25,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:24:25,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:24:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1250746376, now seen corresponding path program 1 times [2025-02-06 06:24:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:24:25,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770518423] [2025-02-06 06:24:25,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:24:25,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 06:24:25,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 06:24:25,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:25,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-02-06 06:24:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:24:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770518423] [2025-02-06 06:24:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770518423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:24:25,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:24:25,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:24:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118417458] [2025-02-06 06:24:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:24:25,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:24:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:24:25,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:24:25,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:24:25,728 INFO L87 Difference]: Start difference. First operand 3318 states and 4800 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-02-06 06:24:29,736 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-02-06 06:24:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:24:30,017 INFO L93 Difference]: Finished difference Result 8775 states and 12703 transitions. [2025-02-06 06:24:30,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:24:30,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 163 [2025-02-06 06:24:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:24:30,051 INFO L225 Difference]: With dead ends: 8775 [2025-02-06 06:24:30,052 INFO L226 Difference]: Without dead ends: 5528 [2025-02-06 06:24:30,063 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-02-06 06:24:30,065 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 853 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:24:30,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 2317 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 116 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 06:24:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2025-02-06 06:24:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5516. [2025-02-06 06:24:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5516 states, 4568 states have (on average 1.429509632224168) internal successors, (6530), 4620 states have internal predecessors, (6530), 677 states have call successors, (677), 271 states have call predecessors, (677), 270 states have return successors, (724), 672 states have call predecessors, (724), 676 states have call successors, (724) [2025-02-06 06:24:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5516 states to 5516 states and 7931 transitions. [2025-02-06 06:24:30,237 INFO L78 Accepts]: Start accepts. Automaton has 5516 states and 7931 transitions. Word has length 163 [2025-02-06 06:24:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:24:30,238 INFO L471 AbstractCegarLoop]: Abstraction has 5516 states and 7931 transitions. [2025-02-06 06:24:30,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-02-06 06:24:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5516 states and 7931 transitions. [2025-02-06 06:24:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 06:24:30,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:24:30,245 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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] [2025-02-06 06:24:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:24:30,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:24:30,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:24:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1316554156, now seen corresponding path program 1 times [2025-02-06 06:24:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:24:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072397638] [2025-02-06 06:24:30,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:24:30,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 06:24:30,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 06:24:30,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:30,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-06 06:24:30,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:24:30,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072397638] [2025-02-06 06:24:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072397638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:24:30,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:24:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:24:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192245968] [2025-02-06 06:24:30,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:24:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:24:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:24:30,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:24:30,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:24:30,425 INFO L87 Difference]: Start difference. First operand 5516 states and 7931 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-02-06 06:24:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:24:30,584 INFO L93 Difference]: Finished difference Result 8261 states and 11958 transitions. [2025-02-06 06:24:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:24:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 168 [2025-02-06 06:24:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:24:30,640 INFO L225 Difference]: With dead ends: 8261 [2025-02-06 06:24:30,641 INFO L226 Difference]: Without dead ends: 5524 [2025-02-06 06:24:30,648 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-02-06 06:24:30,649 INFO L435 NwaCegarLoop]: 1189 mSDtfsCounter, 2 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:24:30,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2371 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:24:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2025-02-06 06:24:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5524. [2025-02-06 06:24:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 4576 states have (on average 1.4287587412587412) internal successors, (6538), 4628 states have internal predecessors, (6538), 677 states have call successors, (677), 271 states have call predecessors, (677), 270 states have return successors, (724), 672 states have call predecessors, (724), 676 states have call successors, (724) [2025-02-06 06:24:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7939 transitions. [2025-02-06 06:24:30,806 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7939 transitions. Word has length 168 [2025-02-06 06:24:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:24:30,806 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 7939 transitions. [2025-02-06 06:24:30,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-02-06 06:24:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7939 transitions. [2025-02-06 06:24:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 06:24:30,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:24:30,815 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, 1, 1, 1, 1] [2025-02-06 06:24:30,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:24:30,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:24:30,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:24:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash 189283925, now seen corresponding path program 1 times [2025-02-06 06:24:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:24:30,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122834938] [2025-02-06 06:24:30,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:24:30,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 06:24:30,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 06:24:30,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:30,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-06 06:24:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:24:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122834938] [2025-02-06 06:24:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122834938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:24:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401691908] [2025-02-06 06:24:31,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:31,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:24:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:24:31,613 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-02-06 06:24:31,615 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-02-06 06:24:32,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 06:24:32,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 06:24:32,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:32,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:32,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 06:24:32,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:24:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-06 06:24:32,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:24:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-06 06:24:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401691908] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:24:33,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:24:33,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-02-06 06:24:33,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013761693] [2025-02-06 06:24:33,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:24:33,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 06:24:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:24:33,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 06:24:33,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-06 06:24:33,512 INFO L87 Difference]: Start difference. First operand 5524 states and 7939 transitions. Second operand has 15 states, 15 states have (on average 11.866666666666667) internal successors, (178), 14 states have internal predecessors, (178), 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-02-06 06:24:37,520 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-02-06 06:24:41,529 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-02-06 06:24:45,535 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-02-06 06:24:49,546 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-02-06 06:24:53,556 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-02-06 06:24:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:24:58,344 INFO L93 Difference]: Finished difference Result 15750 states and 22932 transitions. [2025-02-06 06:24:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 06:24:58,345 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.866666666666667) internal successors, (178), 14 states have internal predecessors, (178), 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 169 [2025-02-06 06:24:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:24:58,403 INFO L225 Difference]: With dead ends: 15750 [2025-02-06 06:24:58,403 INFO L226 Difference]: Without dead ends: 10297 [2025-02-06 06:24:58,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 339 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-02-06 06:24:58,429 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 5215 mSDsluCounter, 9924 mSDsCounter, 0 mSdLazyCounter, 5161 mSolverCounterSat, 1079 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5359 SdHoareTripleChecker+Valid, 11259 SdHoareTripleChecker+Invalid, 6245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1079 IncrementalHoareTripleChecker+Valid, 5161 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:24:58,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5359 Valid, 11259 Invalid, 6245 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1079 Valid, 5161 Invalid, 5 Unknown, 0 Unchecked, 24.3s Time] [2025-02-06 06:24:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10297 states. [2025-02-06 06:24:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10297 to 10125. [2025-02-06 06:24:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10125 states, 8420 states have (on average 1.434560570071259) internal successors, (12079), 8536 states have internal predecessors, (12079), 1234 states have call successors, (1234), 457 states have call predecessors, (1234), 470 states have return successors, (1359), 1219 states have call predecessors, (1359), 1233 states have call successors, (1359) [2025-02-06 06:24:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10125 states to 10125 states and 14672 transitions. [2025-02-06 06:24:58,767 INFO L78 Accepts]: Start accepts. Automaton has 10125 states and 14672 transitions. Word has length 169 [2025-02-06 06:24:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:24:58,768 INFO L471 AbstractCegarLoop]: Abstraction has 10125 states and 14672 transitions. [2025-02-06 06:24:58,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.866666666666667) internal successors, (178), 14 states have internal predecessors, (178), 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-02-06 06:24:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 10125 states and 14672 transitions. [2025-02-06 06:24:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-06 06:24:58,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:24:58,778 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] [2025-02-06 06:24:58,788 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-02-06 06:24:58,981 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-02-06 06:24:58,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:24:58,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:24:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash 581148999, now seen corresponding path program 1 times [2025-02-06 06:24:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:24:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318354676] [2025-02-06 06:24:58,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:24:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:24:59,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 06:24:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 06:24:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:24:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:24:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-06 06:24:59,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:24:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318354676] [2025-02-06 06:24:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318354676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:24:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:24:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:24:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849574040] [2025-02-06 06:24:59,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:24:59,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:24:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:24:59,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:24:59,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:24:59,260 INFO L87 Difference]: Start difference. First operand 10125 states and 14672 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-02-06 06:25:03,268 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-02-06 06:25:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:25:03,678 INFO L93 Difference]: Finished difference Result 24730 states and 35772 transitions. [2025-02-06 06:25:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:25:03,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 203 [2025-02-06 06:25:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:25:03,730 INFO L225 Difference]: With dead ends: 24730 [2025-02-06 06:25:03,730 INFO L226 Difference]: Without dead ends: 14676 [2025-02-06 06:25:03,753 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-02-06 06:25:03,754 INFO L435 NwaCegarLoop]: 2031 mSDtfsCounter, 868 mSDsluCounter, 3209 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 5240 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:25:03,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 5240 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:25:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14676 states. [2025-02-06 06:25:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14676 to 10137. [2025-02-06 06:25:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10137 states, 8432 states have (on average 1.4339421252371916) internal successors, (12091), 8548 states have internal predecessors, (12091), 1234 states have call successors, (1234), 457 states have call predecessors, (1234), 470 states have return successors, (1359), 1219 states have call predecessors, (1359), 1233 states have call successors, (1359) [2025-02-06 06:25:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10137 states to 10137 states and 14684 transitions. [2025-02-06 06:25:04,029 INFO L78 Accepts]: Start accepts. Automaton has 10137 states and 14684 transitions. Word has length 203 [2025-02-06 06:25:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:25:04,030 INFO L471 AbstractCegarLoop]: Abstraction has 10137 states and 14684 transitions. [2025-02-06 06:25:04,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-02-06 06:25:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 10137 states and 14684 transitions. [2025-02-06 06:25:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-06 06:25:04,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:25:04,040 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, 1, 1] [2025-02-06 06:25:04,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:25:04,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:25:04,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:25:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1047300610, now seen corresponding path program 1 times [2025-02-06 06:25:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:25:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895447468] [2025-02-06 06:25:04,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:25:04,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 06:25:04,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 06:25:04,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:04,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 06:25:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:25:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895447468] [2025-02-06 06:25:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895447468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:25:04,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:25:04,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:25:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398016303] [2025-02-06 06:25:04,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:25:04,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:25:04,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:25:04,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:25:04,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:25:04,385 INFO L87 Difference]: Start difference. First operand 10137 states and 14684 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-02-06 06:25:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:25:04,695 INFO L93 Difference]: Finished difference Result 21337 states and 31057 transitions. [2025-02-06 06:25:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:25:04,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 216 [2025-02-06 06:25:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:25:04,733 INFO L225 Difference]: With dead ends: 21337 [2025-02-06 06:25:04,733 INFO L226 Difference]: Without dead ends: 11271 [2025-02-06 06:25:04,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:25:04,753 INFO L435 NwaCegarLoop]: 1204 mSDtfsCounter, 358 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:25:04,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2486 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:25:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2025-02-06 06:25:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 10161. [2025-02-06 06:25:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10161 states, 8456 states have (on average 1.4334200567644275) internal successors, (12121), 8572 states have internal predecessors, (12121), 1234 states have call successors, (1234), 457 states have call predecessors, (1234), 470 states have return successors, (1359), 1219 states have call predecessors, (1359), 1233 states have call successors, (1359) [2025-02-06 06:25:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10161 states to 10161 states and 14714 transitions. [2025-02-06 06:25:05,007 INFO L78 Accepts]: Start accepts. Automaton has 10161 states and 14714 transitions. Word has length 216 [2025-02-06 06:25:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:25:05,007 INFO L471 AbstractCegarLoop]: Abstraction has 10161 states and 14714 transitions. [2025-02-06 06:25:05,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-02-06 06:25:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10161 states and 14714 transitions. [2025-02-06 06:25:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-06 06:25:05,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:25:05,017 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, 1, 1, 1, 1] [2025-02-06 06:25:05,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:25:05,018 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:25:05,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:25:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2076448634, now seen corresponding path program 1 times [2025-02-06 06:25:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:25:05,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297906618] [2025-02-06 06:25:05,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:25:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-06 06:25:05,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-06 06:25:05,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:05,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 06:25:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:25:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297906618] [2025-02-06 06:25:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297906618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:25:05,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:25:05,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:25:05,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873747762] [2025-02-06 06:25:05,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:25:05,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:25:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:25:05,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:25:05,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:25:05,241 INFO L87 Difference]: Start difference. First operand 10161 states and 14714 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-02-06 06:25:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:25:05,458 INFO L93 Difference]: Finished difference Result 20257 states and 29353 transitions. [2025-02-06 06:25:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:25:05,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 218 [2025-02-06 06:25:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:25:05,494 INFO L225 Difference]: With dead ends: 20257 [2025-02-06 06:25:05,494 INFO L226 Difference]: Without dead ends: 10167 [2025-02-06 06:25:05,514 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-02-06 06:25:05,515 INFO L435 NwaCegarLoop]: 1189 mSDtfsCounter, 0 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:25:05,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2371 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:25:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10167 states. [2025-02-06 06:25:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10167 to 10167. [2025-02-06 06:25:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10167 states, 8462 states have (on average 1.4331127393051288) internal successors, (12127), 8578 states have internal predecessors, (12127), 1234 states have call successors, (1234), 457 states have call predecessors, (1234), 470 states have return successors, (1359), 1219 states have call predecessors, (1359), 1233 states have call successors, (1359) [2025-02-06 06:25:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10167 states to 10167 states and 14720 transitions. [2025-02-06 06:25:05,883 INFO L78 Accepts]: Start accepts. Automaton has 10167 states and 14720 transitions. Word has length 218 [2025-02-06 06:25:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:25:05,884 INFO L471 AbstractCegarLoop]: Abstraction has 10167 states and 14720 transitions. [2025-02-06 06:25:05,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-02-06 06:25:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 10167 states and 14720 transitions. [2025-02-06 06:25:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-06 06:25:05,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:25:05,895 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, 1, 1, 1, 1, 1] [2025-02-06 06:25:05,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:25:05,895 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:25:05,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:25:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1914616395, now seen corresponding path program 1 times [2025-02-06 06:25:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:25:05,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562902910] [2025-02-06 06:25:05,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:05,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:25:06,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-06 06:25:06,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-06 06:25:06,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:06,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-02-06 06:25:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:25:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562902910] [2025-02-06 06:25:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562902910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:25:06,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:25:06,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:25:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111546931] [2025-02-06 06:25:06,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:25:06,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:25:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:25:06,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:25:06,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:25:06,441 INFO L87 Difference]: Start difference. First operand 10167 states and 14720 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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-02-06 06:25:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:25:06,746 INFO L93 Difference]: Finished difference Result 20297 states and 29420 transitions. [2025-02-06 06:25:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:25:06,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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 219 [2025-02-06 06:25:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:25:06,781 INFO L225 Difference]: With dead ends: 20297 [2025-02-06 06:25:06,781 INFO L226 Difference]: Without dead ends: 10201 [2025-02-06 06:25:06,799 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-02-06 06:25:06,800 INFO L435 NwaCegarLoop]: 1188 mSDtfsCounter, 0 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4747 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:25:06,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4747 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:25:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10201 states. [2025-02-06 06:25:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10201 to 10191. [2025-02-06 06:25:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10191 states, 8480 states have (on average 1.432193396226415) internal successors, (12145), 8596 states have internal predecessors, (12145), 1234 states have call successors, (1234), 457 states have call predecessors, (1234), 476 states have return successors, (1368), 1225 states have call predecessors, (1368), 1233 states have call successors, (1368) [2025-02-06 06:25:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 14747 transitions. [2025-02-06 06:25:07,106 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 14747 transitions. Word has length 219 [2025-02-06 06:25:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:25:07,107 INFO L471 AbstractCegarLoop]: Abstraction has 10191 states and 14747 transitions. [2025-02-06 06:25:07,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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-02-06 06:25:07,107 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 14747 transitions. [2025-02-06 06:25:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-06 06:25:07,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:25:07,116 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, 1, 1, 1, 1, 1] [2025-02-06 06:25:07,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 06:25:07,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:25:07,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:25:07,116 INFO L85 PathProgramCache]: Analyzing trace with hash 830961922, now seen corresponding path program 1 times [2025-02-06 06:25:07,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:25:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484280441] [2025-02-06 06:25:07,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:25:07,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-06 06:25:07,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-06 06:25:07,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:07,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 06:25:07,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:25:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484280441] [2025-02-06 06:25:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484280441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:25:07,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:25:07,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:25:07,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998856542] [2025-02-06 06:25:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:25:07,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:25:07,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:25:07,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:25:07,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:25:07,461 INFO L87 Difference]: Start difference. First operand 10191 states and 14747 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-02-06 06:25:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:25:07,835 INFO L93 Difference]: Finished difference Result 20773 states and 30133 transitions. [2025-02-06 06:25:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 06:25:07,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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 226 [2025-02-06 06:25:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:25:07,875 INFO L225 Difference]: With dead ends: 20773 [2025-02-06 06:25:07,875 INFO L226 Difference]: Without dead ends: 10653 [2025-02-06 06:25:07,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:25:07,893 INFO L435 NwaCegarLoop]: 1240 mSDtfsCounter, 93 mSDsluCounter, 4887 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 6127 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:25:07,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 6127 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:25:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10653 states. [2025-02-06 06:25:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10653 to 10329. [2025-02-06 06:25:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10329 states, 8618 states have (on average 1.4329310744952426) internal successors, (12349), 8734 states have internal predecessors, (12349), 1234 states have call successors, (1234), 457 states have call predecessors, (1234), 476 states have return successors, (1368), 1225 states have call predecessors, (1368), 1233 states have call successors, (1368) [2025-02-06 06:25:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10329 states to 10329 states and 14951 transitions. [2025-02-06 06:25:08,192 INFO L78 Accepts]: Start accepts. Automaton has 10329 states and 14951 transitions. Word has length 226 [2025-02-06 06:25:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:25:08,194 INFO L471 AbstractCegarLoop]: Abstraction has 10329 states and 14951 transitions. [2025-02-06 06:25:08,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-02-06 06:25:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 10329 states and 14951 transitions. [2025-02-06 06:25:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-06 06:25:08,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:25:08,220 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, 1, 1, 1, 1, 1] [2025-02-06 06:25:08,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 06:25:08,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:25:08,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:25:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash -935630235, now seen corresponding path program 1 times [2025-02-06 06:25:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:25:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189942771] [2025-02-06 06:25:08,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:25:08,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-06 06:25:08,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-06 06:25:08,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:08,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-02-06 06:25:08,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:25:08,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189942771] [2025-02-06 06:25:08,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189942771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:25:08,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434291886] [2025-02-06 06:25:08,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:08,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:25:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:25:08,652 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-02-06 06:25:08,653 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-02-06 06:25:09,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-06 06:25:09,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-06 06:25:09,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:09,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:09,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 06:25:09,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:25:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-06 06:25:09,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:25:09,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434291886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:25:09,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:25:09,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-02-06 06:25:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761534415] [2025-02-06 06:25:09,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:25:09,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:25:09,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:25:09,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:25:09,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:25:09,340 INFO L87 Difference]: Start difference. First operand 10329 states and 14951 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-02-06 06:25:13,348 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-02-06 06:25:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:25:13,776 INFO L93 Difference]: Finished difference Result 25156 states and 36348 transitions. [2025-02-06 06:25:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 06:25:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 226 [2025-02-06 06:25:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:25:13,838 INFO L225 Difference]: With dead ends: 25156 [2025-02-06 06:25:13,838 INFO L226 Difference]: Without dead ends: 14898 [2025-02-06 06:25:13,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 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-02-06 06:25:13,864 INFO L435 NwaCegarLoop]: 2022 mSDtfsCounter, 879 mSDsluCounter, 5160 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 7182 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:25:13,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 7182 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 06:25:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14898 states. [2025-02-06 06:25:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14898 to 10335. [2025-02-06 06:25:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10335 states, 8624 states have (on average 1.43262987012987) internal successors, (12355), 8734 states have internal predecessors, (12355), 1234 states have call successors, (1234), 457 states have call predecessors, (1234), 476 states have return successors, (1368), 1225 states have call predecessors, (1368), 1233 states have call successors, (1368) [2025-02-06 06:25:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10335 states to 10335 states and 14957 transitions. [2025-02-06 06:25:14,203 INFO L78 Accepts]: Start accepts. Automaton has 10335 states and 14957 transitions. Word has length 226 [2025-02-06 06:25:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:25:14,204 INFO L471 AbstractCegarLoop]: Abstraction has 10335 states and 14957 transitions. [2025-02-06 06:25:14,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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-02-06 06:25:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 10335 states and 14957 transitions. [2025-02-06 06:25:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-06 06:25:14,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:25:14,214 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, 1, 1, 1, 1, 1] [2025-02-06 06:25:14,224 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-02-06 06:25:14,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:25:14,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:25:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:25:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1284759569, now seen corresponding path program 1 times [2025-02-06 06:25:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:25:14,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722843637] [2025-02-06 06:25:14,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:25:14,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-06 06:25:14,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-06 06:25:14,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:14,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-02-06 06:25:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:25:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722843637] [2025-02-06 06:25:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722843637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:25:15,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986811738] [2025-02-06 06:25:15,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:15,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:25:15,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:25:15,050 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-02-06 06:25:15,051 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-02-06 06:25:15,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-06 06:25:15,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-06 06:25:15,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:15,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:15,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 2380 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:25:15,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:25:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-02-06 06:25:16,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:25:16,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986811738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:25:16,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:25:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 06:25:16,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170319346] [2025-02-06 06:25:16,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:25:16,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:25:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:25:16,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:25:16,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:25:16,058 INFO L87 Difference]: Start difference. First operand 10335 states and 14957 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-02-06 06:25:20,065 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-02-06 06:25:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:25:20,606 INFO L93 Difference]: Finished difference Result 14904 states and 21487 transitions. [2025-02-06 06:25:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:25:20,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 264 [2025-02-06 06:25:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:25:20,660 INFO L225 Difference]: With dead ends: 14904 [2025-02-06 06:25:20,660 INFO L226 Difference]: Without dead ends: 14878 [2025-02-06 06:25:20,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 264 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-02-06 06:25:20,669 INFO L435 NwaCegarLoop]: 2010 mSDtfsCounter, 2146 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2146 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:25:20,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2146 Valid, 2710 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 268 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 06:25:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14878 states. [2025-02-06 06:25:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14878 to 13679. [2025-02-06 06:25:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13679 states, 11398 states have (on average 1.4294613090015793) internal successors, (16293), 11540 states have internal predecessors, (16293), 1646 states have call successors, (1646), 609 states have call predecessors, (1646), 634 states have return successors, (1838), 1635 states have call predecessors, (1838), 1645 states have call successors, (1838) [2025-02-06 06:25:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13679 states to 13679 states and 19777 transitions. [2025-02-06 06:25:21,110 INFO L78 Accepts]: Start accepts. Automaton has 13679 states and 19777 transitions. Word has length 264 [2025-02-06 06:25:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:25:21,111 INFO L471 AbstractCegarLoop]: Abstraction has 13679 states and 19777 transitions. [2025-02-06 06:25:21,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-02-06 06:25:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13679 states and 19777 transitions. [2025-02-06 06:25:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-06 06:25:21,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:25:21,124 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, 1, 1, 1, 1, 1] [2025-02-06 06:25:21,139 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-02-06 06:25:21,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:25:21,327 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:25:21,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:25:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash 910454517, now seen corresponding path program 1 times [2025-02-06 06:25:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:25:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737940103] [2025-02-06 06:25:21,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:21,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:25:21,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-06 06:25:21,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-06 06:25:21,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:21,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-02-06 06:25:21,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:25:21,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737940103] [2025-02-06 06:25:21,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737940103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:25:21,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:25:21,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:25:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246276203] [2025-02-06 06:25:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:25:21,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:25:21,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:25:21,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:25:21,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:25:21,725 INFO L87 Difference]: Start difference. First operand 13679 states and 19777 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-02-06 06:25:25,732 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-02-06 06:25:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:25:25,963 INFO L93 Difference]: Finished difference Result 20427 states and 29548 transitions. [2025-02-06 06:25:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:25:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 268 [2025-02-06 06:25:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:25:25,989 INFO L225 Difference]: With dead ends: 20427 [2025-02-06 06:25:25,989 INFO L226 Difference]: Without dead ends: 6819 [2025-02-06 06:25:26,007 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-02-06 06:25:26,008 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1077 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:25:26,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1287 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:25:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6819 states. [2025-02-06 06:25:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6819 to 6819. [2025-02-06 06:25:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6819 states, 5682 states have (on average 1.4283702921506511) internal successors, (8116), 5751 states have internal predecessors, (8116), 820 states have call successors, (820), 304 states have call predecessors, (820), 316 states have return successors, (914), 816 states have call predecessors, (914), 819 states have call successors, (914) [2025-02-06 06:25:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6819 states to 6819 states and 9850 transitions. [2025-02-06 06:25:26,293 INFO L78 Accepts]: Start accepts. Automaton has 6819 states and 9850 transitions. Word has length 268 [2025-02-06 06:25:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:25:26,294 INFO L471 AbstractCegarLoop]: Abstraction has 6819 states and 9850 transitions. [2025-02-06 06:25:26,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-02-06 06:25:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 6819 states and 9850 transitions. [2025-02-06 06:25:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-02-06 06:25:26,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:25:26,302 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, 1, 1, 1, 1, 1] [2025-02-06 06:25:26,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 06:25:26,303 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:25:26,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:25:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash -438593277, now seen corresponding path program 1 times [2025-02-06 06:25:26,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:25:26,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106671942] [2025-02-06 06:25:26,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:25:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:25:26,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-02-06 06:25:26,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-02-06 06:25:26,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:25:26,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:25:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-02-06 06:25:27,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:25:27,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106671942] [2025-02-06 06:25:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106671942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:25:27,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:25:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 06:25:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906147420] [2025-02-06 06:25:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:25:27,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 06:25:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:25:27,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 06:25:27,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 06:25:27,670 INFO L87 Difference]: Start difference. First operand 6819 states and 9850 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 states have internal predecessors, (170), 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)