./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 08:19:38,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 08:19:38,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 08:19:38,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 08:19:38,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 08:19:38,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 08:19:38,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 08:19:38,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 08:19:38,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 08:19:38,379 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 08:19:38,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 08:19:38,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 08:19:38,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 08:19:38,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 08:19:38,380 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 08:19:38,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 08:19:38,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 08:19:38,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 08:19:38,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 08:19:38,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 08:19:38,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:19:38,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 08:19:38,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 08:19:38,382 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/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-03-17 08:19:38,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 08:19:38,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 08:19:38,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 08:19:38,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 08:19:38,690 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 08:19:38,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-17 08:19:39,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4901d1df/7ffb216a3765490b8a3594e724c2cefb/FLAG5b4570883 [2025-03-17 08:19:40,364 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 08:19:40,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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-03-17 08:19:40,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4901d1df/7ffb216a3765490b8a3594e724c2cefb/FLAG5b4570883 [2025-03-17 08:19:40,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4901d1df/7ffb216a3765490b8a3594e724c2cefb [2025-03-17 08:19:40,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 08:19:40,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 08:19:40,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 08:19:40,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 08:19:40,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 08:19:40,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:19:40" (1/1) ... [2025-03-17 08:19:40,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70dcca76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:40, skipping insertion in model container [2025-03-17 08:19:40,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:19:40" (1/1) ... [2025-03-17 08:19:40,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 08:19:41,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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-03-17 08:19:42,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:19:42,081 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 08:19:42,202 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-03-17 08:19:42,204 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-03-17 08:19:42,204 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-03-17 08:19:42,205 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-03-17 08:19:42,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5320] [2025-03-17 08:19:42,208 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-03-17 08:19:42,209 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-03-17 08:19:42,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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-03-17 08:19:42,245 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-03-17 08:19:42,246 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-03-17 08:19:42,246 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-03-17 08:19:42,246 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-03-17 08:19:42,247 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-03-17 08:19:42,247 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-03-17 08:19:42,247 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-03-17 08:19:42,248 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-03-17 08:19:42,248 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-03-17 08:19:42,248 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-03-17 08:19:42,249 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-03-17 08:19:42,249 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-03-17 08:19:42,249 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-03-17 08:19:42,249 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-03-17 08:19:42,249 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-03-17 08:19:42,253 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-03-17 08:19:42,254 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-03-17 08:19:42,254 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-03-17 08:19:42,254 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-03-17 08:19:42,255 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-03-17 08:19:42,255 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-03-17 08:19:42,257 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-03-17 08:19:42,257 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-03-17 08:19:42,257 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-03-17 08:19:42,257 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-03-17 08:19:42,257 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-03-17 08:19:42,258 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-03-17 08:19:42,258 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-03-17 08:19:42,258 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-03-17 08:19:42,258 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-03-17 08:19:42,258 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-03-17 08:19:42,258 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-03-17 08:19:42,258 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-03-17 08:19:42,261 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-03-17 08:19:42,261 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-03-17 08:19:42,261 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-03-17 08:19:42,262 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-03-17 08:19:42,262 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-03-17 08:19:42,262 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-03-17 08:19:42,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:19:42,389 INFO L204 MainTranslator]: Completed translation [2025-03-17 08:19:42,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42 WrapperNode [2025-03-17 08:19:42,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 08:19:42,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 08:19:42,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 08:19:42,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 08:19:42,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,552 INFO L138 Inliner]: procedures = 180, calls = 596, calls flagged for inlining = 99, calls inlined = 93, statements flattened = 2725 [2025-03-17 08:19:42,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 08:19:42,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 08:19:42,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 08:19:42,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 08:19:42,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,799 INFO L175 MemorySlicer]: Split 317 memory accesses to 7 slices as follows [229, 2, 13, 1, 28, 20, 24]. 72 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [6, 2, 0, 0, 0, 15, 0]. The 152 writes are split as follows [100, 0, 13, 0, 13, 2, 24]. [2025-03-17 08:19:42,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 08:19:42,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 08:19:42,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 08:19:42,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 08:19:42,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (1/1) ... [2025-03-17 08:19:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:19:42,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:19:42,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 08:19:42,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 08:19:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-17 08:19:42,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-17 08:19:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 08:19:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 08:19:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 08:19:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 08:19:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 08:19:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 08:19:42,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_async_push [2025-03-17 08:19:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_async_push [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2025-03-17 08:19:42,975 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 08:19:42,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 08:19:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 08:19:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 08:19:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 08:19:42,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt_byte [2025-03-17 08:19:42,977 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt_byte [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure ap_put [2025-03-17 08:19:42,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_put [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2025-03-17 08:19:42,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:19:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_hangup [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_hangup [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 08:19:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 08:19:42,978 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-17 08:19:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 08:19:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_close [2025-03-17 08:19:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_close [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_poll [2025-03-17 08:19:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_poll [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-03-17 08:19:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-17 08:19:42,979 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 08:19:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 08:19:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 08:19:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-17 08:19:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-17 08:19:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure ap_get [2025-03-17 08:19:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ap_get [2025-03-17 08:19:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-03-17 08:19:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-03-17 08:19:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 08:19:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 08:19:42,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 08:19:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 08:19:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 08:19:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 08:19:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 08:19:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-03-17 08:19:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-03-17 08:19:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-03-17 08:19:42,983 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-03-17 08:19:42,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure async_lcp_peek [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure async_lcp_peek [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_asynctty_ioctl [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_asynctty_ioctl [2025-03-17 08:19:42,984 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-17 08:19:42,984 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-17 08:19:43,416 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 08:19:43,418 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 08:19:43,915 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 08:19:43,964 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5759: havoc #t~bitwise124;havoc #t~mem125;havoc #t~bitwise126; [2025-03-17 08:19:44,002 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5314: havoc #t~mem1;havoc #t~bitwise2; [2025-03-17 08:19:44,038 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5327: havoc __fswab16_#t~bitwise3#1; [2025-03-17 08:19:44,308 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7647: havoc #t~nondet424; [2025-03-17 08:19:44,332 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7719: havoc #t~nondet430; [2025-03-17 08:19:44,428 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7643: havoc #t~nondet423; [2025-03-17 08:19:53,309 INFO L1322 $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-03-17 08:19:53,309 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7767: havoc tty_unregister_ldisc_#t~nondet439#1; [2025-03-17 08:19:53,309 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5455: havoc __kmalloc_#t~ret35#1.base, __kmalloc_#t~ret35#1.offset; [2025-03-17 08:19:53,309 INFO L1322 $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-03-17 08:19:53,309 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7708: havoc ppp_register_channel_#t~nondet428#1; [2025-03-17 08:19:53,309 INFO L1322 $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-03-17 08:19:53,310 INFO L1322 $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-03-17 08:19:53,310 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5569: havoc skb_is_nonlinear_#t~mem59#1; [2025-03-17 08:19:53,310 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5540: havoc skb_queue_empty_#t~mem55#1.base, skb_queue_empty_#t~mem55#1.offset; [2025-03-17 08:19:53,310 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7722: havoc skb_pull_#t~ret431#1.base, skb_pull_#t~ret431#1.offset; [2025-03-17 08:19:53,310 INFO L1322 $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-03-17 08:19:53,310 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7725: havoc skb_push_#t~ret432#1.base, skb_push_#t~ret432#1.offset; [2025-03-17 08:19:53,310 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7759: havoc tty_register_ldisc_#t~nondet437#1; [2025-03-17 08:19:53,310 INFO L1322 $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-03-17 08:19:53,310 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7663: havoc _raw_spin_lock_irqsave_#t~nondet425#1; [2025-03-17 08:19:53,310 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7763: havoc tty_termios_baud_rate_#t~nondet438#1; [2025-03-17 08:19:53,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7695: havoc ppp_channel_index_#t~nondet427#1; [2025-03-17 08:19:53,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7691: havoc n_tty_ioctl_helper_#t~nondet426#1; [2025-03-17 08:19:53,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7712: havoc ppp_unit_number_#t~nondet429#1; [2025-03-17 08:19:53,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7755: havoc tty_mode_ioctl_#t~nondet436#1; [2025-03-17 08:19:53,649 INFO L? ?]: Removed 1067 outVars from TransFormulas that were not future-live. [2025-03-17 08:19:53,649 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 08:19:53,706 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 08:19:53,706 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 08:19:53,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:19:53 BoogieIcfgContainer [2025-03-17 08:19:53,706 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 08:19:53,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 08:19:53,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 08:19:53,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 08:19:53,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 08:19:40" (1/3) ... [2025-03-17 08:19:53,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b56f501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:19:53, skipping insertion in model container [2025-03-17 08:19:53,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:19:42" (2/3) ... [2025-03-17 08:19:53,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b56f501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:19:53, skipping insertion in model container [2025-03-17 08:19:53,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:19:53" (3/3) ... [2025-03-17 08:19:53,718 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-03-17 08:19:53,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 08:19:53,735 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, 826 locations, 1 initial locations, 17 loop locations, and 1 error locations. [2025-03-17 08:19:53,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 08:19:53,804 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;@4ac6faff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 08:19:53,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 08:19:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 795 states, 637 states have (on average 1.500784929356358) internal successors, (956), 651 states have internal predecessors, (956), 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-03-17 08:19:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 08:19:53,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:19:53,816 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] [2025-03-17 08:19:53,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:19:53,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:19:53,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2019773629, now seen corresponding path program 1 times [2025-03-17 08:19:53,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:19:53,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878874906] [2025-03-17 08:19:53,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:19:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:19:54,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 08:19:54,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 08:19:54,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:19:54,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:19:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 08:19:54,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:19:54,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878874906] [2025-03-17 08:19:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878874906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:19:54,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:19:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:19:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78928460] [2025-03-17 08:19:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:19:54,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:19:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:19:54,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:19:54,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:19:54,515 INFO L87 Difference]: Start difference. First operand has 795 states, 637 states have (on average 1.500784929356358) internal successors, (956), 651 states have internal predecessors, (956), 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 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-03-17 08:19:58,541 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-03-17 08:19:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:19:58,855 INFO L93 Difference]: Finished difference Result 2335 states and 3557 transitions. [2025-03-17 08:19:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:19:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 74 [2025-03-17 08:19:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:19:58,879 INFO L225 Difference]: With dead ends: 2335 [2025-03-17 08:19:58,880 INFO L226 Difference]: Without dead ends: 1529 [2025-03-17 08:19:58,887 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-03-17 08:19:58,889 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 1115 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 2266 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-03-17 08:19:58,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 2266 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 08:19:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-03-17 08:19:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1529. [2025-03-17 08:19:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1241 states have (on average 1.4818694601128122) internal successors, (1839), 1257 states have internal predecessors, (1839), 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-03-17 08:19:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2268 transitions. [2025-03-17 08:19:59,055 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2268 transitions. Word has length 74 [2025-03-17 08:19:59,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:19:59,055 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2268 transitions. [2025-03-17 08:19:59,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-03-17 08:19:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2268 transitions. [2025-03-17 08:19:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 08:19:59,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:19:59,064 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] [2025-03-17 08:19:59,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 08:19:59,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:19:59,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:19:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1799103442, now seen corresponding path program 1 times [2025-03-17 08:19:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:19:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767049456] [2025-03-17 08:19:59,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:19:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:19:59,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 08:19:59,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 08:19:59,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:19:59,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:19:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 08:19:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:19:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767049456] [2025-03-17 08:19:59,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767049456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:19:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:19:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:19:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075272571] [2025-03-17 08:19:59,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:19:59,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:19:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:19:59,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:19:59,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:19:59,536 INFO L87 Difference]: Start difference. First operand 1529 states and 2268 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-03-17 08:19:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:19:59,894 INFO L93 Difference]: Finished difference Result 4542 states and 6772 transitions. [2025-03-17 08:19:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:19:59,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 77 [2025-03-17 08:19:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:19:59,927 INFO L225 Difference]: With dead ends: 4542 [2025-03-17 08:19:59,927 INFO L226 Difference]: Without dead ends: 3027 [2025-03-17 08:19:59,937 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-03-17 08:19:59,938 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 1144 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:19:59,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 3380 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:19:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states. [2025-03-17 08:20:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 3023. [2025-03-17 08:20:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3023 states, 2460 states have (on average 1.4829268292682927) internal successors, (3648), 2492 states have internal predecessors, (3648), 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-03-17 08:20:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 4513 transitions. [2025-03-17 08:20:00,139 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 4513 transitions. Word has length 77 [2025-03-17 08:20:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 3023 states and 4513 transitions. [2025-03-17 08:20:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-03-17 08:20:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 4513 transitions. [2025-03-17 08:20:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 08:20:00,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:00,157 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:20:00,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 08:20:00,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:00,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1406648456, now seen corresponding path program 1 times [2025-03-17 08:20:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:00,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63264215] [2025-03-17 08:20:00,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:00,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 08:20:00,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 08:20:00,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:00,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-17 08:20:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:00,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63264215] [2025-03-17 08:20:00,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63264215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:00,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:20:00,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:20:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213080830] [2025-03-17 08:20:00,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:00,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:20:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:00,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:20:00,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:20:00,452 INFO L87 Difference]: Start difference. First operand 3023 states and 4513 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-17 08:20:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:00,769 INFO L93 Difference]: Finished difference Result 7554 states and 11272 transitions. [2025-03-17 08:20:00,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:20:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 127 [2025-03-17 08:20:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:00,799 INFO L225 Difference]: With dead ends: 7554 [2025-03-17 08:20:00,799 INFO L226 Difference]: Without dead ends: 4552 [2025-03-17 08:20:00,809 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-03-17 08:20:00,811 INFO L435 NwaCegarLoop]: 1136 mSDtfsCounter, 616 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:20:00,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2195 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:20:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2025-03-17 08:20:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4543. [2025-03-17 08:20:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4543 states, 3718 states have (on average 1.4870898332436795) internal successors, (5529), 3761 states have internal predecessors, (5529), 605 states have call successors, (605), 220 states have call predecessors, (605), 219 states have return successors, (644), 601 states have call predecessors, (644), 604 states have call successors, (644) [2025-03-17 08:20:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4543 states to 4543 states and 6778 transitions. [2025-03-17 08:20:01,020 INFO L78 Accepts]: Start accepts. Automaton has 4543 states and 6778 transitions. Word has length 127 [2025-03-17 08:20:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:01,020 INFO L471 AbstractCegarLoop]: Abstraction has 4543 states and 6778 transitions. [2025-03-17 08:20:01,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-17 08:20:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4543 states and 6778 transitions. [2025-03-17 08:20:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 08:20:01,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:01,038 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] [2025-03-17 08:20:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 08:20:01,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:01,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1193330695, now seen corresponding path program 1 times [2025-03-17 08:20:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:01,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240036187] [2025-03-17 08:20:01,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:01,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 08:20:01,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 08:20:01,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:01,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-03-17 08:20:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240036187] [2025-03-17 08:20:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240036187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:01,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:20:01,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:20:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008405644] [2025-03-17 08:20:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:01,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:20:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:01,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:20:01,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:20:01,328 INFO L87 Difference]: Start difference. First operand 4543 states and 6778 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-03-17 08:20:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:01,663 INFO L93 Difference]: Finished difference Result 11097 states and 16455 transitions. [2025-03-17 08:20:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:20:01,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 158 [2025-03-17 08:20:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:01,707 INFO L225 Difference]: With dead ends: 11097 [2025-03-17 08:20:01,707 INFO L226 Difference]: Without dead ends: 6575 [2025-03-17 08:20:01,727 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-03-17 08:20:01,728 INFO L435 NwaCegarLoop]: 1682 mSDtfsCounter, 735 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:20:01,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 2769 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:20:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6575 states. [2025-03-17 08:20:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6575 to 6562. [2025-03-17 08:20:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 5367 states have (on average 1.4779206260480715) internal successors, (7932), 5435 states have internal predecessors, (7932), 847 states have call successors, (847), 348 states have call predecessors, (847), 347 states have return successors, (908), 842 states have call predecessors, (908), 846 states have call successors, (908) [2025-03-17 08:20:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 9687 transitions. [2025-03-17 08:20:02,019 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 9687 transitions. Word has length 158 [2025-03-17 08:20:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:02,020 INFO L471 AbstractCegarLoop]: Abstraction has 6562 states and 9687 transitions. [2025-03-17 08:20:02,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-03-17 08:20:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 9687 transitions. [2025-03-17 08:20:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 08:20:02,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:02,030 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] [2025-03-17 08:20:02,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 08:20:02,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:02,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1902451716, now seen corresponding path program 1 times [2025-03-17 08:20:02,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:02,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374748364] [2025-03-17 08:20:02,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:02,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 08:20:02,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 08:20:02,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:02,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-17 08:20:02,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:02,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374748364] [2025-03-17 08:20:02,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374748364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:02,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:20:02,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:20:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368227183] [2025-03-17 08:20:02,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:02,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:20:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:02,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:20:02,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:20:02,275 INFO L87 Difference]: Start difference. First operand 6562 states and 9687 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-03-17 08:20:06,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:20:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:06,773 INFO L93 Difference]: Finished difference Result 15844 states and 23345 transitions. [2025-03-17 08:20:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:20:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 148 [2025-03-17 08:20:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:06,842 INFO L225 Difference]: With dead ends: 15844 [2025-03-17 08:20:06,842 INFO L226 Difference]: Without dead ends: 9313 [2025-03-17 08:20:06,865 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-03-17 08:20:06,865 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 805 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 08:20:06,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2202 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 115 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 08:20:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9313 states. [2025-03-17 08:20:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9313 to 9292. [2025-03-17 08:20:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9292 states, 7575 states have (on average 1.4698349834983497) internal successors, (11134), 7669 states have internal predecessors, (11134), 1175 states have call successors, (1175), 542 states have call predecessors, (1175), 541 states have return successors, (1264), 1168 states have call predecessors, (1264), 1174 states have call successors, (1264) [2025-03-17 08:20:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9292 states to 9292 states and 13573 transitions. [2025-03-17 08:20:07,355 INFO L78 Accepts]: Start accepts. Automaton has 9292 states and 13573 transitions. Word has length 148 [2025-03-17 08:20:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:07,355 INFO L471 AbstractCegarLoop]: Abstraction has 9292 states and 13573 transitions. [2025-03-17 08:20:07,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-03-17 08:20:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 9292 states and 13573 transitions. [2025-03-17 08:20:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 08:20:07,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:07,369 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] [2025-03-17 08:20:07,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 08:20:07,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:07,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 293415041, now seen corresponding path program 1 times [2025-03-17 08:20:07,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:07,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453849469] [2025-03-17 08:20:07,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:07,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:07,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 08:20:07,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 08:20:07,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:07,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-17 08:20:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453849469] [2025-03-17 08:20:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453849469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:07,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:20:07,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:20:07,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510910884] [2025-03-17 08:20:07,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:07,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:20:07,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:07,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:20:07,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:20:07,615 INFO L87 Difference]: Start difference. First operand 9292 states and 13573 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-03-17 08:20:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:07,889 INFO L93 Difference]: Finished difference Result 13962 states and 20541 transitions. [2025-03-17 08:20:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:20:07,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 153 [2025-03-17 08:20:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:07,953 INFO L225 Difference]: With dead ends: 13962 [2025-03-17 08:20:07,953 INFO L226 Difference]: Without dead ends: 9312 [2025-03-17 08:20:08,090 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-03-17 08:20:08,092 INFO L435 NwaCegarLoop]: 1126 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2246 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-03-17 08:20:08,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2246 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:20:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9312 states. [2025-03-17 08:20:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9312 to 9312. [2025-03-17 08:20:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9312 states, 7595 states have (on average 1.4685977616853192) internal successors, (11154), 7689 states have internal predecessors, (11154), 1175 states have call successors, (1175), 542 states have call predecessors, (1175), 541 states have return successors, (1264), 1168 states have call predecessors, (1264), 1174 states have call successors, (1264) [2025-03-17 08:20:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9312 states to 9312 states and 13593 transitions. [2025-03-17 08:20:08,361 INFO L78 Accepts]: Start accepts. Automaton has 9312 states and 13593 transitions. Word has length 153 [2025-03-17 08:20:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:08,364 INFO L471 AbstractCegarLoop]: Abstraction has 9312 states and 13593 transitions. [2025-03-17 08:20:08,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-03-17 08:20:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 9312 states and 13593 transitions. [2025-03-17 08:20:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 08:20:08,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:08,377 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:20:08,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 08:20:08,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:08,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:08,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1112609529, now seen corresponding path program 1 times [2025-03-17 08:20:08,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:08,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411470879] [2025-03-17 08:20:08,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:08,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 08:20:08,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 08:20:08,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:08,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-17 08:20:09,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:09,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411470879] [2025-03-17 08:20:09,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411470879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:20:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159943056] [2025-03-17 08:20:09,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:09,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:20:09,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:20:09,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:20:09,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 08:20:09,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 08:20:09,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 08:20:09,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:09,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:09,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 08:20:09,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:20:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 88 proven. 5 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-17 08:20:09,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:20:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-17 08:20:10,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159943056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:20:10,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:20:10,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-03-17 08:20:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432853358] [2025-03-17 08:20:10,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:20:10,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 08:20:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:10,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 08:20:10,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-17 08:20:10,703 INFO L87 Difference]: Start difference. First operand 9312 states and 13593 transitions. Second operand has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 14 states have internal predecessors, (143), 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-03-17 08:20:14,712 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-03-17 08:20:18,719 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-03-17 08:20:22,728 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-03-17 08:20:26,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-03-17 08:20:30,742 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-03-17 08:20:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:35,236 INFO L93 Difference]: Finished difference Result 26357 states and 38877 transitions. [2025-03-17 08:20:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 08:20:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 14 states have internal predecessors, (143), 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 154 [2025-03-17 08:20:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:35,321 INFO L225 Difference]: With dead ends: 26357 [2025-03-17 08:20:35,322 INFO L226 Difference]: Without dead ends: 17076 [2025-03-17 08:20:35,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 309 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-03-17 08:20:35,365 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 5886 mSDsluCounter, 6580 mSDsCounter, 0 mSdLazyCounter, 4047 mSolverCounterSat, 1312 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6030 SdHoareTripleChecker+Valid, 7812 SdHoareTripleChecker+Invalid, 5364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1312 IncrementalHoareTripleChecker+Valid, 4047 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2025-03-17 08:20:35,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6030 Valid, 7812 Invalid, 5364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1312 Valid, 4047 Invalid, 5 Unknown, 0 Unchecked, 23.8s Time] [2025-03-17 08:20:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17076 states. [2025-03-17 08:20:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17076 to 16753. [2025-03-17 08:20:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16753 states, 13703 states have (on average 1.4671969641684304) internal successors, (20105), 13903 states have internal predecessors, (20105), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 938 states have return successors, (2340), 2094 states have call predecessors, (2340), 2110 states have call successors, (2340) [2025-03-17 08:20:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16753 states to 16753 states and 24556 transitions. [2025-03-17 08:20:35,973 INFO L78 Accepts]: Start accepts. Automaton has 16753 states and 24556 transitions. Word has length 154 [2025-03-17 08:20:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:35,974 INFO L471 AbstractCegarLoop]: Abstraction has 16753 states and 24556 transitions. [2025-03-17 08:20:35,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 14 states have internal predecessors, (143), 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-03-17 08:20:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 16753 states and 24556 transitions. [2025-03-17 08:20:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 08:20:35,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:35,992 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] [2025-03-17 08:20:36,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 08:20:36,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:20:36,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:36,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1803045058, now seen corresponding path program 1 times [2025-03-17 08:20:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:36,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388846507] [2025-03-17 08:20:36,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:36,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 08:20:36,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 08:20:36,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:36,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-17 08:20:36,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:36,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388846507] [2025-03-17 08:20:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388846507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:20:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:20:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112898127] [2025-03-17 08:20:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:36,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:20:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:36,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:20:36,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:20:36,595 INFO L87 Difference]: Start difference. First operand 16753 states and 24556 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-03-17 08:20:40,608 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-03-17 08:20:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:41,233 INFO L93 Difference]: Finished difference Result 39085 states and 57078 transitions. [2025-03-17 08:20:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:20:41,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 188 [2025-03-17 08:20:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:41,368 INFO L225 Difference]: With dead ends: 39085 [2025-03-17 08:20:41,368 INFO L226 Difference]: Without dead ends: 22363 [2025-03-17 08:20:41,403 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-03-17 08:20:41,404 INFO L435 NwaCegarLoop]: 1921 mSDtfsCounter, 819 mSDsluCounter, 3036 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 4957 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:20:41,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 4957 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 08:20:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22363 states. [2025-03-17 08:20:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22363 to 16777. [2025-03-17 08:20:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16777 states, 13727 states have (on average 1.4663801267574852) internal successors, (20129), 13927 states have internal predecessors, (20129), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 938 states have return successors, (2340), 2094 states have call predecessors, (2340), 2110 states have call successors, (2340) [2025-03-17 08:20:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16777 states to 16777 states and 24580 transitions. [2025-03-17 08:20:41,953 INFO L78 Accepts]: Start accepts. Automaton has 16777 states and 24580 transitions. Word has length 188 [2025-03-17 08:20:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:41,953 INFO L471 AbstractCegarLoop]: Abstraction has 16777 states and 24580 transitions. [2025-03-17 08:20:41,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-03-17 08:20:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 16777 states and 24580 transitions. [2025-03-17 08:20:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 08:20:41,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:41,968 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] [2025-03-17 08:20:41,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 08:20:41,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1153564174, now seen corresponding path program 1 times [2025-03-17 08:20:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939961603] [2025-03-17 08:20:41,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:42,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 08:20:42,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 08:20:42,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:42,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-17 08:20:42,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939961603] [2025-03-17 08:20:42,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939961603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:42,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:20:42,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:20:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313508098] [2025-03-17 08:20:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:42,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:20:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:42,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:20:42,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:20:42,492 INFO L87 Difference]: Start difference. First operand 16777 states and 24580 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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-03-17 08:20:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:43,223 INFO L93 Difference]: Finished difference Result 33585 states and 49232 transitions. [2025-03-17 08:20:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:20:43,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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 199 [2025-03-17 08:20:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:43,312 INFO L225 Difference]: With dead ends: 33585 [2025-03-17 08:20:43,312 INFO L226 Difference]: Without dead ends: 16839 [2025-03-17 08:20:43,352 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-03-17 08:20:43,353 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 0 mSDsluCounter, 3370 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4495 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-03-17 08:20:43,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4495 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:20:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16839 states. [2025-03-17 08:20:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16839 to 16825. [2025-03-17 08:20:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16825 states, 13763 states have (on average 1.4651602121630458) internal successors, (20165), 13963 states have internal predecessors, (20165), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 950 states have return successors, (2355), 2106 states have call predecessors, (2355), 2110 states have call successors, (2355) [2025-03-17 08:20:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16825 states to 16825 states and 24631 transitions. [2025-03-17 08:20:43,851 INFO L78 Accepts]: Start accepts. Automaton has 16825 states and 24631 transitions. Word has length 199 [2025-03-17 08:20:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:43,852 INFO L471 AbstractCegarLoop]: Abstraction has 16825 states and 24631 transitions. [2025-03-17 08:20:43,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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-03-17 08:20:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 16825 states and 24631 transitions. [2025-03-17 08:20:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 08:20:43,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:43,870 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] [2025-03-17 08:20:43,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 08:20:43,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1477880883, now seen corresponding path program 1 times [2025-03-17 08:20:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068398012] [2025-03-17 08:20:43,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:43,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 08:20:43,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 08:20:43,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:43,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-17 08:20:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068398012] [2025-03-17 08:20:44,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068398012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:20:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037446555] [2025-03-17 08:20:44,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:44,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:20:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:20:44,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:20:44,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 08:20:44,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 08:20:44,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 08:20:44,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:44,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:44,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 08:20:44,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:20:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-17 08:20:44,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:20:44,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037446555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:44,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:20:44,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-17 08:20:44,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397233014] [2025-03-17 08:20:44,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:44,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:20:44,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:44,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:20:44,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 08:20:44,907 INFO L87 Difference]: Start difference. First operand 16825 states and 24631 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-03-17 08:20:48,915 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-03-17 08:20:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:49,616 INFO L93 Difference]: Finished difference Result 39265 states and 57264 transitions. [2025-03-17 08:20:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 08:20:49,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 205 [2025-03-17 08:20:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:49,700 INFO L225 Difference]: With dead ends: 39265 [2025-03-17 08:20:49,701 INFO L226 Difference]: Without dead ends: 22471 [2025-03-17 08:20:49,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 203 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-03-17 08:20:49,735 INFO L435 NwaCegarLoop]: 1912 mSDtfsCounter, 825 mSDsluCounter, 4891 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 6803 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-03-17 08:20:49,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 6803 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 08:20:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22471 states. [2025-03-17 08:20:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22471 to 16837. [2025-03-17 08:20:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16837 states, 13775 states have (on average 1.46475499092559) internal successors, (20177), 13963 states have internal predecessors, (20177), 2111 states have call successors, (2111), 913 states have call predecessors, (2111), 950 states have return successors, (2355), 2106 states have call predecessors, (2355), 2110 states have call successors, (2355) [2025-03-17 08:20:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16837 states to 16837 states and 24643 transitions. [2025-03-17 08:20:50,564 INFO L78 Accepts]: Start accepts. Automaton has 16837 states and 24643 transitions. Word has length 205 [2025-03-17 08:20:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:50,565 INFO L471 AbstractCegarLoop]: Abstraction has 16837 states and 24643 transitions. [2025-03-17 08:20:50,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-03-17 08:20:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 16837 states and 24643 transitions. [2025-03-17 08:20:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-17 08:20:50,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:50,578 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] [2025-03-17 08:20:50,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 08:20:50,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 08:20:50,779 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:50,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1317845447, now seen corresponding path program 1 times [2025-03-17 08:20:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226762907] [2025-03-17 08:20:50,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:51,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 08:20:51,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 08:20:51,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:51,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-17 08:20:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226762907] [2025-03-17 08:20:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226762907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:20:51,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724374669] [2025-03-17 08:20:51,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:51,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:20:51,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:20:51,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:20:51,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 08:20:52,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 08:20:52,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 08:20:52,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:52,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:52,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:20:52,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:20:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-03-17 08:20:52,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:20:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724374669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:20:52,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 08:20:52,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008383813] [2025-03-17 08:20:52,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:52,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:20:52,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:52,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:20:52,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:20:52,468 INFO L87 Difference]: Start difference. First operand 16837 states and 24643 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-03-17 08:20:56,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:20:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:20:57,328 INFO L93 Difference]: Finished difference Result 22512 states and 32718 transitions. [2025-03-17 08:20:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:20:57,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 238 [2025-03-17 08:20:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:20:57,476 INFO L225 Difference]: With dead ends: 22512 [2025-03-17 08:20:57,477 INFO L226 Difference]: Without dead ends: 22475 [2025-03-17 08:20:57,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 238 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-03-17 08:20:57,494 INFO L435 NwaCegarLoop]: 1901 mSDtfsCounter, 1818 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 08:20:57,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 2550 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 08:20:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22475 states. [2025-03-17 08:20:58,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22475 to 20909. [2025-03-17 08:20:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20909 states, 17045 states have (on average 1.457142857142857) internal successors, (24837), 17273 states have internal predecessors, (24837), 2657 states have call successors, (2657), 1159 states have call predecessors, (2657), 1206 states have return successors, (2989), 2656 states have call predecessors, (2989), 2656 states have call successors, (2989) [2025-03-17 08:20:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20909 states to 20909 states and 30483 transitions. [2025-03-17 08:20:58,217 INFO L78 Accepts]: Start accepts. Automaton has 20909 states and 30483 transitions. Word has length 238 [2025-03-17 08:20:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:20:58,222 INFO L471 AbstractCegarLoop]: Abstraction has 20909 states and 30483 transitions. [2025-03-17 08:20:58,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-03-17 08:20:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 20909 states and 30483 transitions. [2025-03-17 08:20:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-17 08:20:58,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:20:58,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 08:20:58,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 08:20:58,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:20:58,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:20:58,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:20:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash 745809180, now seen corresponding path program 1 times [2025-03-17 08:20:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:20:58,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585664479] [2025-03-17 08:20:58,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:20:58,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:20:58,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-17 08:20:58,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-17 08:20:58,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:20:58,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:20:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-17 08:20:58,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:20:58,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585664479] [2025-03-17 08:20:58,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585664479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:20:58,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:20:58,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:20:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007910757] [2025-03-17 08:20:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:20:58,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:20:58,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:20:58,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:20:58,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:20:58,902 INFO L87 Difference]: Start difference. First operand 20909 states and 30483 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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)