./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_synctty.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_synctty.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 389f662f7096bd36438270dc54f296be4073de8eeb864b893c17044d6fb4cc06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:00:38,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:00:38,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:00:38,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:00:38,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:00:39,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:00:39,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:00:39,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:00:39,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:00:39,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:00:39,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:00:39,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:00:39,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:00:39,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:00:39,006 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:00:39,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:00:39,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:00:39,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:00:39,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:00:39,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:00:39,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:00:39,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:00:39,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:00:39,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:00:39,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:00:39,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:00:39,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:00:39,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:39,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:00:39,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:00:39,008 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 -> 389f662f7096bd36438270dc54f296be4073de8eeb864b893c17044d6fb4cc06 [2025-03-04 04:00:39,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:00:39,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:00:39,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:00:39,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:00:39,229 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:00:39,230 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_synctty.ko-entry_point.cil.out.i [2025-03-04 04:00:40,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd4ae2ab/427c08e75fc042b985b02cc56aef48e4/FLAG5a9c38653 [2025-03-04 04:00:40,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:00:40,740 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_synctty.ko-entry_point.cil.out.i [2025-03-04 04:00:40,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd4ae2ab/427c08e75fc042b985b02cc56aef48e4/FLAG5a9c38653 [2025-03-04 04:00:40,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd4ae2ab/427c08e75fc042b985b02cc56aef48e4 [2025-03-04 04:00:40,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:00:40,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:00:40,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:40,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:00:40,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:00:40,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:40" (1/1) ... [2025-03-04 04:00:40,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2846c585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:40, skipping insertion in model container [2025-03-04 04:00:40,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:40" (1/1) ... [2025-03-04 04:00:40,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:00:41,608 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_synctty.ko-entry_point.cil.out.i[163507,163520] [2025-03-04 04:00:41,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:41,975 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:00:42,090 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"); [5277] [2025-03-04 04:00:42,092 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)); [5284] [2025-03-04 04:00:42,093 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"); [5292-5293] [2025-03-04 04:00:42,094 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"); [5301-5302] [2025-03-04 04:00:42,096 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)); [5349] [2025-03-04 04:00:42,098 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"); [5357-5358] [2025-03-04 04:00:42,110 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_synctty.ko-entry_point.cil.out.i[163507,163520] [2025-03-04 04:00:42,125 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"); [5939] [2025-03-04 04:00:42,127 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"); [5942] [2025-03-04 04:00:42,127 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"); [5945] [2025-03-04 04:00:42,128 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"); [5948] [2025-03-04 04:00:42,128 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"); [5951] [2025-03-04 04:00:42,128 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"); [5967-5968] [2025-03-04 04:00:42,128 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"); [5971-5972] [2025-03-04 04:00:42,129 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"); [5975-5976] [2025-03-04 04:00:42,129 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"); [5979-5980] [2025-03-04 04:00:42,129 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"); [5983-5984] [2025-03-04 04:00:42,130 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"); [6007-6008] [2025-03-04 04:00:42,130 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"); [6011-6012] [2025-03-04 04:00:42,131 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"); [6015-6016] [2025-03-04 04:00:42,131 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"); [6019-6020] [2025-03-04 04:00:42,132 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"); [6023-6024] [2025-03-04 04:00:42,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)argp): "ebx"); [6152] [2025-03-04 04:00:42,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)argp): "ebx"); [6155] [2025-03-04 04:00:42,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)argp): "ebx"); [6158] [2025-03-04 04:00:42,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)argp): "ebx"); [6161] [2025-03-04 04:00:42,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)argp): "ebx"); [6164] [2025-03-04 04:00:42,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu), "=r" (__val_gu): "0" ((int *)argp), "i" (4UL)); [6176-6177] [2025-03-04 04:00:42,141 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"); [6194-6195] [2025-03-04 04:00:42,141 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"); [6198-6199] [2025-03-04 04:00:42,142 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"); [6202-6203] [2025-03-04 04:00:42,142 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"); [6206-6207] [2025-03-04 04:00:42,142 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"); [6210-6211] [2025-03-04 04:00:42,142 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" (p), "i" (4UL)); [6223-6224] [2025-03-04 04:00:42,143 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"); [6237-6238] [2025-03-04 04:00:42,143 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"); [6241-6242] [2025-03-04 04:00:42,143 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"); [6245-6246] [2025-03-04 04:00:42,143 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"); [6249-6250] [2025-03-04 04:00:42,143 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"); [6253-6254] [2025-03-04 04:00:42,144 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" (p), "i" (4UL)); [6266-6267] [2025-03-04 04:00:42,146 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" ((int *)argp): "ebx"); [6304-6305] [2025-03-04 04:00:42,146 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" ((int *)argp): "ebx"); [6308-6309] [2025-03-04 04:00:42,146 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" ((int *)argp): "ebx"); [6312-6313] [2025-03-04 04:00:42,147 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" ((int *)argp): "ebx"); [6316-6317] [2025-03-04 04:00:42,147 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" ((int *)argp): "ebx"); [6320-6321] [2025-03-04 04:00:42,147 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" ((int *)argp), "i" (4UL)); [6333-6334] [2025-03-04 04:00:42,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:42,241 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:00:42,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42 WrapperNode [2025-03-04 04:00:42,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:42,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:42,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:00:42,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:00:42,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,363 INFO L138 Inliner]: procedures = 176, calls = 475, calls flagged for inlining = 92, calls inlined = 85, statements flattened = 1951 [2025-03-04 04:00:42,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:42,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:00:42,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:00:42,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:00:42,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,613 INFO L175 MemorySlicer]: Split 190 memory accesses to 9 slices as follows [2, 120, 1, 24, 2, 1, 13, 20, 7]. 63 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 10, 1, 0, 2, 1, 0, 15, 0]. The 86 writes are split as follows [0, 41, 0, 24, 0, 0, 13, 2, 6]. [2025-03-04 04:00:42,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,674 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:00:42,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:00:42,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:00:42,718 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:00:42,719 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (1/1) ... [2025-03-04 04:00:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:42,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:00:42,761 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-04 04:00:42,771 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-04 04:00:42,793 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-04 04:00:42,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-04 04:00:42,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_15 [2025-03-04 04:00:42,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_15 [2025-03-04 04:00:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_poll [2025-03-04 04:00:42,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_poll [2025-03-04 04:00:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:00:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:00:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:00:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:00:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:00:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:00:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:00:42,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:00:42,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2025-03-04 04:00:42,799 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:00:42,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2025-03-04 04:00:42,799 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_output_wakeup [2025-03-04 04:00:42,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_output_wakeup [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:00:42,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure spin_trylock_bh [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_trylock_bh [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_synctty_ioctl [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_synctty_ioctl [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:00:42,800 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:00:42,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_close [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_close [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_print_buffer [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_print_buffer [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2025-03-04 04:00:42,801 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:00:42,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-03-04 04:00:42,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-03-04 04:00:42,803 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure sp_put [2025-03-04 04:00:42,803 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_put [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:00:42,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2025-03-04 04:00:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_hangup [2025-03-04 04:00:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_hangup [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-04 04:00:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:00:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2025-03-04 04:00:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure sp_get [2025-03-04 04:00:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure sp_get [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 04:00:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-04 04:00:42,804 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:00:42,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 04:00:42,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-04 04:00:42,805 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:00:42,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:00:42,805 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_sync_push [2025-03-04 04:00:42,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_sync_push [2025-03-04 04:00:43,228 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:00:43,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:00:43,283 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:00:43,288 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7330: havoc #t~ret325.base, #t~ret325.offset; [2025-03-04 04:00:43,321 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7268: havoc _raw_spin_trylock_bh_#t~nondet318#1; [2025-03-04 04:00:43,334 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5309: havoc #t~mem1;havoc #t~bitwise2; [2025-03-04 04:00:43,479 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7354: havoc tty_mode_ioctl_#t~nondet329#1; [2025-03-04 04:00:43,479 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7297: havoc ppp_channel_index_#t~nondet320#1; [2025-03-04 04:00:43,479 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7293: havoc n_tty_ioctl_helper_#t~nondet319#1; [2025-03-04 04:00:43,480 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7314: havoc ppp_unit_number_#t~nondet322#1; [2025-03-04 04:00:43,486 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7327: havoc #t~ret324.base, #t~ret324.offset; [2025-03-04 04:00:43,541 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5754: call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; [2025-03-04 04:00:43,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7248: havoc #t~nondet316; [2025-03-04 04:00:43,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7324: havoc #t~nondet323; [2025-03-04 04:00:43,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7244: havoc #t~nondet315; [2025-03-04 04:00:48,518 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6117: call ULTIMATE.dealloc(ppp_sync_ioctl_~#accm~0#1.base, ppp_sync_ioctl_~#accm~0#1.offset);havoc ppp_sync_ioctl_~#accm~0#1.base, ppp_sync_ioctl_~#accm~0#1.offset; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5556: havoc skb_is_nonlinear_#t~mem66#1; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5426: call ULTIMATE.dealloc(init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset);havoc init_completion_~#__key~0#1.base, init_completion_~#__key~0#1.offset; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7310: havoc ppp_register_channel_#t~nondet321#1; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5527: havoc skb_queue_empty_#t~mem62#1.base, skb_queue_empty_#t~mem62#1.offset; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5565: havoc skb_headroom_#t~mem73#1.base, skb_headroom_#t~mem73#1.offset;havoc skb_headroom_#t~mem74#1.base, skb_headroom_#t~mem74#1.offset; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5440: havoc __kmalloc_#t~ret42#1.base, __kmalloc_#t~ret42#1.offset; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5573: havoc skb_tailroom_#t~ite78#1;havoc skb_tailroom_#t~mem76#1;havoc skb_tailroom_#t~mem77#1; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7358: havoc tty_register_ldisc_#t~nondet330#1; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5543: call ULTIMATE.dealloc(skb_queue_head_init_~#__key~1#1.base, skb_queue_head_init_~#__key~1#1.offset);havoc skb_queue_head_init_~#__key~1#1.base, skb_queue_head_init_~#__key~1#1.offset; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809: call ULTIMATE.dealloc(ppp_sync_open_~#__key~2#1.base, ppp_sync_open_~#__key~2#1.offset);havoc ppp_sync_open_~#__key~2#1.base, ppp_sync_open_~#__key~2#1.offset;call ULTIMATE.dealloc(ppp_sync_open_~#__key___0~0#1.base, ppp_sync_open_~#__key___0~0#1.offset);havoc ppp_sync_open_~#__key___0~0#1.base, ppp_sync_open_~#__key___0~0#1.offset; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7362: havoc tty_termios_baud_rate_#t~nondet331#1; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5315: havoc __fswab16_#t~bitwise3#1; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7264: havoc _raw_spin_lock_irqsave_#t~nondet317#1; [2025-03-04 04:00:48,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7366: havoc tty_unregister_ldisc_#t~nondet332#1; [2025-03-04 04:00:48,818 INFO L? ?]: Removed 1114 outVars from TransFormulas that were not future-live. [2025-03-04 04:00:48,818 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:00:48,858 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:00:48,858 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 04:00:48,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:48 BoogieIcfgContainer [2025-03-04 04:00:48,859 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:00:48,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:00:48,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:00:48,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:00:48,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:00:40" (1/3) ... [2025-03-04 04:00:48,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7beabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:00:48, skipping insertion in model container [2025-03-04 04:00:48,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:42" (2/3) ... [2025-03-04 04:00:48,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7beabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:00:48, skipping insertion in model container [2025-03-04 04:00:48,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:00:48" (3/3) ... [2025-03-04 04:00:48,871 INFO L128 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_synctty.ko-entry_point.cil.out.i [2025-03-04 04:00:48,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:00:48,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--ppp--ppp_synctty.ko-entry_point.cil.out.i that has 50 procedures, 731 locations, 1 initial locations, 21 loop locations, and 1 error locations. [2025-03-04 04:00:48,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:00:48,961 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;@5b3ebe3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:00:48,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:00:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 524 states have (on average 1.3950381679389312) internal successors, (731), 540 states have internal predecessors, (731), 124 states have call successors, (124), 41 states have call predecessors, (124), 40 states have return successors, (120), 118 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-04 04:00:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 04:00:48,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:48,979 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:00:48,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:48,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2080998293, now seen corresponding path program 1 times [2025-03-04 04:00:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:48,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760376263] [2025-03-04 04:00:48,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:49,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 04:00:49,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 04:00:49,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:49,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:49,660 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-04 04:00:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:49,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760376263] [2025-03-04 04:00:49,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760376263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:49,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:49,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609924651] [2025-03-04 04:00:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:49,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:49,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:49,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:49,688 INFO L87 Difference]: Start difference. First operand has 690 states, 524 states have (on average 1.3950381679389312) internal successors, (731), 540 states have internal predecessors, (731), 124 states have call successors, (124), 41 states have call predecessors, (124), 40 states have return successors, (120), 118 states have call predecessors, (120), 120 states have call successors, (120) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 04:00:53,707 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-04 04:00:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:53,925 INFO L93 Difference]: Finished difference Result 2011 states and 2919 transitions. [2025-03-04 04:00:53,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78 [2025-03-04 04:00:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:53,943 INFO L225 Difference]: With dead ends: 2011 [2025-03-04 04:00:53,943 INFO L226 Difference]: Without dead ends: 1310 [2025-03-04 04:00:53,951 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-04 04:00:53,953 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 898 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:53,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1898 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:00:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-03-04 04:00:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2025-03-04 04:00:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1006 states have (on average 1.3817097415506958) internal successors, (1390), 1026 states have internal predecessors, (1390), 225 states have call successors, (225), 79 states have call predecessors, (225), 78 states have return successors, (224), 220 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-04 04:00:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1839 transitions. [2025-03-04 04:00:54,081 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1839 transitions. Word has length 78 [2025-03-04 04:00:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:54,084 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 1839 transitions. [2025-03-04 04:00:54,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 04:00:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1839 transitions. [2025-03-04 04:00:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 04:00:54,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:54,087 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:00:54,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:00:54,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:54,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash -292895887, now seen corresponding path program 1 times [2025-03-04 04:00:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988573650] [2025-03-04 04:00:54,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:54,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:54,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 04:00:54,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 04:00:54,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:54,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:54,517 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-04 04:00:54,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:54,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988573650] [2025-03-04 04:00:54,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988573650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:54,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:54,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:00:54,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787103043] [2025-03-04 04:00:54,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:54,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:00:54,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:54,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:00:54,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:00:54,519 INFO L87 Difference]: Start difference. First operand 1310 states and 1839 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 04:00:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:54,734 INFO L93 Difference]: Finished difference Result 3879 states and 5493 transitions. [2025-03-04 04:00:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:00:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2025-03-04 04:00:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:54,754 INFO L225 Difference]: With dead ends: 3879 [2025-03-04 04:00:54,755 INFO L226 Difference]: Without dead ends: 2585 [2025-03-04 04:00:54,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:00:54,761 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 930 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 3804 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:54,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 3804 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:00:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2025-03-04 04:00:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2581. [2025-03-04 04:00:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 1986 states have (on average 1.3826787512588117) internal successors, (2746), 2026 states have internal predecessors, (2746), 438 states have call successors, (438), 157 states have call predecessors, (438), 156 states have return successors, (475), 429 states have call predecessors, (475), 437 states have call successors, (475) [2025-03-04 04:00:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 3659 transitions. [2025-03-04 04:00:54,911 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 3659 transitions. Word has length 82 [2025-03-04 04:00:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:54,911 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 3659 transitions. [2025-03-04 04:00:54,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 04:00:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3659 transitions. [2025-03-04 04:00:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 04:00:54,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:54,924 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-04 04:00:54,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:00:54,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:54,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash -245238346, now seen corresponding path program 1 times [2025-03-04 04:00:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:54,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393088316] [2025-03-04 04:00:54,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:55,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 04:00:55,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 04:00:55,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:55,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 04:00:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:55,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393088316] [2025-03-04 04:00:55,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393088316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:55,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:55,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:55,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863614789] [2025-03-04 04:00:55,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:55,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:55,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:55,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:55,162 INFO L87 Difference]: Start difference. First operand 2581 states and 3659 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 04:00:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:55,382 INFO L93 Difference]: Finished difference Result 6603 states and 9326 transitions. [2025-03-04 04:00:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:55,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-03-04 04:00:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:55,410 INFO L225 Difference]: With dead ends: 6603 [2025-03-04 04:00:55,411 INFO L226 Difference]: Without dead ends: 4046 [2025-03-04 04:00:55,419 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-04 04:00:55,422 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 555 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:55,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1820 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:00:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4046 states. [2025-03-04 04:00:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4046 to 4034. [2025-03-04 04:00:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 3126 states have (on average 1.3848368522072936) internal successors, (4329), 3173 states have internal predecessors, (4329), 651 states have call successors, (651), 257 states have call predecessors, (651), 256 states have return successors, (706), 639 states have call predecessors, (706), 650 states have call successors, (706) [2025-03-04 04:00:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5686 transitions. [2025-03-04 04:00:55,598 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 5686 transitions. Word has length 126 [2025-03-04 04:00:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:55,599 INFO L471 AbstractCegarLoop]: Abstraction has 4034 states and 5686 transitions. [2025-03-04 04:00:55,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 04:00:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 5686 transitions. [2025-03-04 04:00:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 04:00:55,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:55,616 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:00:55,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:00:55,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:55,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2146649929, now seen corresponding path program 1 times [2025-03-04 04:00:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912851706] [2025-03-04 04:00:55,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:55,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 04:00:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 04:00:55,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:55,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 04:00:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912851706] [2025-03-04 04:00:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912851706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818745875] [2025-03-04 04:00:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:55,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:55,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:55,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:55,905 INFO L87 Difference]: Start difference. First operand 4034 states and 5686 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 04:00:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:56,124 INFO L93 Difference]: Finished difference Result 9702 states and 13572 transitions. [2025-03-04 04:00:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:56,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-04 04:00:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:56,154 INFO L225 Difference]: With dead ends: 9702 [2025-03-04 04:00:56,154 INFO L226 Difference]: Without dead ends: 5692 [2025-03-04 04:00:56,163 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-04 04:00:56,165 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 564 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:56,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 2215 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:00:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5692 states. [2025-03-04 04:00:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5692 to 5684. [2025-03-04 04:00:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5684 states, 4380 states have (on average 1.3730593607305936) internal successors, (6014), 4465 states have internal predecessors, (6014), 906 states have call successors, (906), 398 states have call predecessors, (906), 397 states have return successors, (985), 884 states have call predecessors, (985), 905 states have call successors, (985) [2025-03-04 04:00:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5684 states to 5684 states and 7905 transitions. [2025-03-04 04:00:56,365 INFO L78 Accepts]: Start accepts. Automaton has 5684 states and 7905 transitions. Word has length 147 [2025-03-04 04:00:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:56,366 INFO L471 AbstractCegarLoop]: Abstraction has 5684 states and 7905 transitions. [2025-03-04 04:00:56,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 04:00:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5684 states and 7905 transitions. [2025-03-04 04:00:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 04:00:56,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:56,381 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:00:56,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:00:56,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:56,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash 740574291, now seen corresponding path program 1 times [2025-03-04 04:00:56,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:56,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336511913] [2025-03-04 04:00:56,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:56,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 04:00:56,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 04:00:56,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:56,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 04:00:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:56,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336511913] [2025-03-04 04:00:56,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336511913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:00:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638469213] [2025-03-04 04:00:56,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:56,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:56,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:56,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:56,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:00:56,666 INFO L87 Difference]: Start difference. First operand 5684 states and 7905 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 04:01:00,674 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-04 04:01:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:00,915 INFO L93 Difference]: Finished difference Result 14070 states and 19574 transitions. [2025-03-04 04:01:00,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:00,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 149 [2025-03-04 04:01:00,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:00,963 INFO L225 Difference]: With dead ends: 14070 [2025-03-04 04:01:00,963 INFO L226 Difference]: Without dead ends: 8421 [2025-03-04 04:01:00,981 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-04 04:01:00,982 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 750 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:00,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1838 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:01:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8421 states. [2025-03-04 04:01:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8421 to 8403. [2025-03-04 04:01:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8403 states, 6554 states have (on average 1.3730546231309124) internal successors, (8999), 6662 states have internal predecessors, (8999), 1241 states have call successors, (1241), 608 states have call predecessors, (1241), 607 states have return successors, (1352), 1216 states have call predecessors, (1352), 1240 states have call successors, (1352) [2025-03-04 04:01:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8403 states to 8403 states and 11592 transitions. [2025-03-04 04:01:01,244 INFO L78 Accepts]: Start accepts. Automaton has 8403 states and 11592 transitions. Word has length 149 [2025-03-04 04:01:01,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:01,245 INFO L471 AbstractCegarLoop]: Abstraction has 8403 states and 11592 transitions. [2025-03-04 04:01:01,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 04:01:01,246 INFO L276 IsEmpty]: Start isEmpty. Operand 8403 states and 11592 transitions. [2025-03-04 04:01:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 04:01:01,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:01,255 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:01,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:01:01,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:01,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2054308256, now seen corresponding path program 1 times [2025-03-04 04:01:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840508720] [2025-03-04 04:01:01,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:01,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 04:01:01,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 04:01:01,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:01,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2025-03-04 04:01:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840508720] [2025-03-04 04:01:01,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840508720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:01,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:01,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:01:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775651221] [2025-03-04 04:01:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:01:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:01,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:01:01,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:01:01,452 INFO L87 Difference]: Start difference. First operand 8403 states and 11592 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 04:01:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:01,609 INFO L93 Difference]: Finished difference Result 12630 states and 17572 transitions. [2025-03-04 04:01:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:01,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2025-03-04 04:01:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:01,656 INFO L225 Difference]: With dead ends: 12630 [2025-03-04 04:01:01,657 INFO L226 Difference]: Without dead ends: 8423 [2025-03-04 04:01:01,670 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-04 04:01:01,671 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 2 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:01,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1876 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:01:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8423 states. [2025-03-04 04:01:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8423 to 8423. [2025-03-04 04:01:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8423 states, 6574 states have (on average 1.3719196836020688) internal successors, (9019), 6682 states have internal predecessors, (9019), 1241 states have call successors, (1241), 608 states have call predecessors, (1241), 607 states have return successors, (1352), 1216 states have call predecessors, (1352), 1240 states have call successors, (1352) [2025-03-04 04:01:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 11612 transitions. [2025-03-04 04:01:01,982 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 11612 transitions. Word has length 154 [2025-03-04 04:01:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:01,982 INFO L471 AbstractCegarLoop]: Abstraction has 8423 states and 11612 transitions. [2025-03-04 04:01:01,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 04:01:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 11612 transitions. [2025-03-04 04:01:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 04:01:01,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:01,994 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:01,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:01:01,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:01,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash -756348128, now seen corresponding path program 1 times [2025-03-04 04:01:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287852877] [2025-03-04 04:01:01,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:02,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 04:01:02,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 04:01:02,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:02,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2025-03-04 04:01:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287852877] [2025-03-04 04:01:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287852877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:02,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:02,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 04:01:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184909650] [2025-03-04 04:01:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 04:01:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:02,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 04:01:02,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 04:01:02,687 INFO L87 Difference]: Start difference. First operand 8423 states and 11612 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 04:01:06,695 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-04 04:01:10,709 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-04 04:01:14,725 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-04 04:01:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:17,119 INFO L93 Difference]: Finished difference Result 18033 states and 24897 transitions. [2025-03-04 04:01:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 04:01:17,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 155 [2025-03-04 04:01:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:17,214 INFO L225 Difference]: With dead ends: 18033 [2025-03-04 04:01:17,214 INFO L226 Difference]: Without dead ends: 9645 [2025-03-04 04:01:17,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:01:17,232 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 2271 mSDsluCounter, 3102 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 741 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 3967 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:17,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 3967 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 2004 Invalid, 3 Unknown, 0 Unchecked, 14.1s Time] [2025-03-04 04:01:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9645 states. [2025-03-04 04:01:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9645 to 9265. [2025-03-04 04:01:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9265 states, 7156 states have (on average 1.3587199552822806) internal successors, (9723), 7302 states have internal predecessors, (9723), 1387 states have call successors, (1387), 686 states have call predecessors, (1387), 721 states have return successors, (1560), 1368 states have call predecessors, (1560), 1386 states have call successors, (1560) [2025-03-04 04:01:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9265 states to 9265 states and 12670 transitions. [2025-03-04 04:01:17,487 INFO L78 Accepts]: Start accepts. Automaton has 9265 states and 12670 transitions. Word has length 155 [2025-03-04 04:01:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:17,489 INFO L471 AbstractCegarLoop]: Abstraction has 9265 states and 12670 transitions. [2025-03-04 04:01:17,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-04 04:01:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 9265 states and 12670 transitions. [2025-03-04 04:01:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 04:01:17,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:17,505 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:01:17,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:01:17,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:17,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:17,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1277154395, now seen corresponding path program 1 times [2025-03-04 04:01:17,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:17,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111514417] [2025-03-04 04:01:17,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:17,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:17,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 04:01:17,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 04:01:17,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:17,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-04 04:01:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111514417] [2025-03-04 04:01:18,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111514417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:18,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:18,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:01:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036886750] [2025-03-04 04:01:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:18,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:01:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:18,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:01:18,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:01:18,008 INFO L87 Difference]: Start difference. First operand 9265 states and 12670 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 04:01:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:18,261 INFO L93 Difference]: Finished difference Result 18561 states and 25482 transitions. [2025-03-04 04:01:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:01:18,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 194 [2025-03-04 04:01:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:18,296 INFO L225 Difference]: With dead ends: 18561 [2025-03-04 04:01:18,297 INFO L226 Difference]: Without dead ends: 9331 [2025-03-04 04:01:18,316 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-04 04:01:18,317 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 0 mSDsluCounter, 2815 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3755 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:18,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3755 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9331 states. [2025-03-04 04:01:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9331 to 9329. [2025-03-04 04:01:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9329 states, 7204 states have (on average 1.3563298167684619) internal successors, (9771), 7350 states have internal predecessors, (9771), 1387 states have call successors, (1387), 686 states have call predecessors, (1387), 737 states have return successors, (1584), 1384 states have call predecessors, (1584), 1386 states have call successors, (1584) [2025-03-04 04:01:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9329 states to 9329 states and 12742 transitions. [2025-03-04 04:01:18,613 INFO L78 Accepts]: Start accepts. Automaton has 9329 states and 12742 transitions. Word has length 194 [2025-03-04 04:01:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:18,613 INFO L471 AbstractCegarLoop]: Abstraction has 9329 states and 12742 transitions. [2025-03-04 04:01:18,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 04:01:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 9329 states and 12742 transitions. [2025-03-04 04:01:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-04 04:01:18,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:18,627 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:01:18,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1335866075, now seen corresponding path program 1 times [2025-03-04 04:01:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614627269] [2025-03-04 04:01:18,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:18,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-04 04:01:18,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 04:01:18,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:18,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-04 04:01:19,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614627269] [2025-03-04 04:01:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614627269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061570050] [2025-03-04 04:01:19,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:19,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:19,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:19,433 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-04 04:01:19,436 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-04 04:01:19,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-04 04:01:20,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 04:01:20,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:20,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:20,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 04:01:20,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 98 proven. 8 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2025-03-04 04:01:20,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:01:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-04 04:01:20,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061570050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:01:20,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:01:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2025-03-04 04:01:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555780284] [2025-03-04 04:01:20,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:01:20,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 04:01:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:20,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 04:01:20,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-04 04:01:20,883 INFO L87 Difference]: Start difference. First operand 9329 states and 12742 transitions. Second operand has 19 states, 19 states have (on average 11.105263157894736) internal successors, (211), 19 states have internal predecessors, (211), 10 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 15 states have call predecessors, (45), 10 states have call successors, (45) [2025-03-04 04:01:24,892 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-04 04:01:28,896 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-04 04:01:32,900 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-04 04:01:36,904 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-04 04:01:40,911 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-04 04:01:44,917 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-04 04:01:48,923 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-04 04:01:52,929 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-04 04:01:56,937 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-04 04:02:00,944 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-04 04:02:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:02:05,302 INFO L93 Difference]: Finished difference Result 23760 states and 33326 transitions. [2025-03-04 04:02:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 04:02:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.105263157894736) internal successors, (211), 19 states have internal predecessors, (211), 10 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 15 states have call predecessors, (45), 10 states have call successors, (45) Word has length 201 [2025-03-04 04:02:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:02:05,381 INFO L225 Difference]: With dead ends: 23760 [2025-03-04 04:02:05,381 INFO L226 Difference]: Without dead ends: 18649 [2025-03-04 04:02:05,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 400 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2025-03-04 04:02:05,404 INFO L435 NwaCegarLoop]: 1425 mSDtfsCounter, 5144 mSDsluCounter, 6834 mSDsCounter, 0 mSdLazyCounter, 4038 mSolverCounterSat, 1863 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5358 SdHoareTripleChecker+Valid, 8259 SdHoareTripleChecker+Invalid, 5911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1863 IncrementalHoareTripleChecker+Valid, 4038 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.6s IncrementalHoareTripleChecker+Time [2025-03-04 04:02:05,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5358 Valid, 8259 Invalid, 5911 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1863 Valid, 4038 Invalid, 10 Unknown, 0 Unchecked, 43.6s Time] [2025-03-04 04:02:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18649 states. [2025-03-04 04:02:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18649 to 18049. [2025-03-04 04:02:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18049 states, 13986 states have (on average 1.363005863005863) internal successors, (19063), 14276 states have internal predecessors, (19063), 2703 states have call successors, (2703), 1276 states have call predecessors, (2703), 1359 states have return successors, (3186), 2672 states have call predecessors, (3186), 2702 states have call successors, (3186) [2025-03-04 04:02:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18049 states to 18049 states and 24952 transitions. [2025-03-04 04:02:06,033 INFO L78 Accepts]: Start accepts. Automaton has 18049 states and 24952 transitions. Word has length 201 [2025-03-04 04:02:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:02:06,035 INFO L471 AbstractCegarLoop]: Abstraction has 18049 states and 24952 transitions. [2025-03-04 04:02:06,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.105263157894736) internal successors, (211), 19 states have internal predecessors, (211), 10 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 15 states have call predecessors, (45), 10 states have call successors, (45) [2025-03-04 04:02:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 18049 states and 24952 transitions. [2025-03-04 04:02:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 04:02:06,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:02:06,050 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:02:06,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:02:06,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:02:06,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:02:06,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:02:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1419774203, now seen corresponding path program 1 times [2025-03-04 04:02:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:02:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907392680] [2025-03-04 04:02:06,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:02:06,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:02:06,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 04:02:06,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 04:02:06,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:02:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:02:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 04:02:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:02:06,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907392680] [2025-03-04 04:02:06,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907392680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:02:06,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:02:06,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:02:06,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459192678] [2025-03-04 04:02:06,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:02:06,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:02:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:02:06,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:02:06,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:02:06,545 INFO L87 Difference]: Start difference. First operand 18049 states and 24952 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 04:02:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:02:07,036 INFO L93 Difference]: Finished difference Result 31908 states and 44466 transitions. [2025-03-04 04:02:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:02:07,047 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 202 [2025-03-04 04:02:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:02:07,183 INFO L225 Difference]: With dead ends: 31908 [2025-03-04 04:02:07,188 INFO L226 Difference]: Without dead ends: 18069 [2025-03-04 04:02:07,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:02:07,243 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 0 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2806 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:02:07,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2806 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:02:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18069 states. [2025-03-04 04:02:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18069 to 18069. [2025-03-04 04:02:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18069 states, 14006 states have (on average 1.3632014850778238) internal successors, (19093), 14296 states have internal predecessors, (19093), 2703 states have call successors, (2703), 1276 states have call predecessors, (2703), 1359 states have return successors, (3186), 2672 states have call predecessors, (3186), 2702 states have call successors, (3186) [2025-03-04 04:02:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18069 states to 18069 states and 24982 transitions. [2025-03-04 04:02:07,878 INFO L78 Accepts]: Start accepts. Automaton has 18069 states and 24982 transitions. Word has length 202 [2025-03-04 04:02:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:02:07,878 INFO L471 AbstractCegarLoop]: Abstraction has 18069 states and 24982 transitions. [2025-03-04 04:02:07,879 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 04:02:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 18069 states and 24982 transitions. [2025-03-04 04:02:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-04 04:02:07,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:02:07,895 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:02:07,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:02:07,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:02:07,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:02:07,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1217291319, now seen corresponding path program 1 times [2025-03-04 04:02:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:02:07,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393532276] [2025-03-04 04:02:07,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:02:07,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:02:07,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 04:02:08,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 04:02:08,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:02:08,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:02:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2025-03-04 04:02:08,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:02:08,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393532276] [2025-03-04 04:02:08,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393532276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:02:08,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:02:08,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:02:08,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75952417] [2025-03-04 04:02:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:02:08,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:02:08,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:02:08,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:02:08,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:02:08,451 INFO L87 Difference]: Start difference. First operand 18069 states and 24982 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 04:02:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:02:08,897 INFO L93 Difference]: Finished difference Result 36151 states and 49991 transitions. [2025-03-04 04:02:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:02:08,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 203 [2025-03-04 04:02:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:02:08,989 INFO L225 Difference]: With dead ends: 36151 [2025-03-04 04:02:08,990 INFO L226 Difference]: Without dead ends: 18117 [2025-03-04 04:02:09,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:02:09,032 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 0 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:02:09,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2816 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:02:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18117 states. [2025-03-04 04:02:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18117 to 18117. [2025-03-04 04:02:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18117 states, 14054 states have (on average 1.3619610075423367) internal successors, (19141), 14344 states have internal predecessors, (19141), 2703 states have call successors, (2703), 1276 states have call predecessors, (2703), 1359 states have return successors, (3186), 2672 states have call predecessors, (3186), 2702 states have call successors, (3186) [2025-03-04 04:02:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18117 states to 18117 states and 25030 transitions. [2025-03-04 04:02:09,760 INFO L78 Accepts]: Start accepts. Automaton has 18117 states and 25030 transitions. Word has length 203 [2025-03-04 04:02:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:02:09,762 INFO L471 AbstractCegarLoop]: Abstraction has 18117 states and 25030 transitions. [2025-03-04 04:02:09,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-04 04:02:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 18117 states and 25030 transitions. [2025-03-04 04:02:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-04 04:02:09,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:02:09,781 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:02:09,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 04:02:09,781 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:02:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:02:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash -390657586, now seen corresponding path program 1 times [2025-03-04 04:02:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:02:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094675145] [2025-03-04 04:02:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:02:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:02:09,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-04 04:02:09,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-04 04:02:09,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:02:09,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat