./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.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 5bdb144d16ce690b0c83c76766410e2201d517c4cbaa861cb0d7e2bbbb9cb236 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:20:50,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:20:51,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:20:51,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:20:51,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:20:51,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:20:51,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:20:51,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:20:51,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:20:51,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:20:51,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:20:51,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:20:51,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:20:51,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:20:51,050 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:20:51,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:20:51,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:20:51,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:20:51,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:20:51,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:20:51,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:20:51,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:20:51,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:20:51,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:20:51,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:20:51,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:20:51,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:20:51,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:20:51,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:20:51,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:20:51,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:20:51,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:20:51,052 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 -> 5bdb144d16ce690b0c83c76766410e2201d517c4cbaa861cb0d7e2bbbb9cb236 [2025-03-04 04:20:51,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:20:51,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:20:51,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:20:51,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:20:51,267 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:20:51,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2025-03-04 04:20:52,426 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d2fe647/70fe054e968549068bdd10547de3e56f/FLAG298e00c39 [2025-03-04 04:20:52,843 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:20:52,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2025-03-04 04:20:52,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d2fe647/70fe054e968549068bdd10547de3e56f/FLAG298e00c39 [2025-03-04 04:20:52,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d2fe647/70fe054e968549068bdd10547de3e56f [2025-03-04 04:20:52,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:20:52,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:20:52,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:20:52,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:20:52,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:20:52,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:20:52" (1/1) ... [2025-03-04 04:20:52,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3009bf28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:52, skipping insertion in model container [2025-03-04 04:20:52,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:20:52" (1/1) ... [2025-03-04 04:20:53,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:20:53,717 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i[147706,147719] [2025-03-04 04:20:53,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:20:53,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:20:53,976 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"); [3376] [2025-03-04 04:20:53,978 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"); [3384-3385] [2025-03-04 04:20:53,978 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"); [3393-3394] [2025-03-04 04:20:53,978 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3402-3403] [2025-03-04 04:20:53,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3421] [2025-03-04 04:20:53,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3424] [2025-03-04 04:20:53,979 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3427] [2025-03-04 04:20:53,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3430] [2025-03-04 04:20:53,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& cpu_tss.x86_tss.sp0)); [3451] [2025-03-04 04:20:53,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& cpu_tss.x86_tss.sp0)); [3454] [2025-03-04 04:20:53,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& cpu_tss.x86_tss.sp0)); [3457] [2025-03-04 04:20:53,981 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& cpu_tss.x86_tss.sp0)); [3460] [2025-03-04 04:20:54,081 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i[147706,147719] [2025-03-04 04:20:54,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:20:54,184 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:20:54,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54 WrapperNode [2025-03-04 04:20:54,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:20:54,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:20:54,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:20:54,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:20:54,191 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:20:54" (1/1) ... [2025-03-04 04:20:54,229 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:20:54" (1/1) ... [2025-03-04 04:20:54,312 INFO L138 Inliner]: procedures = 224, calls = 1326, calls flagged for inlining = 80, calls inlined = 75, statements flattened = 3189 [2025-03-04 04:20:54,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:20:54,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:20:54,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:20:54,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:20:54,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,449 INFO L175 MemorySlicer]: Split 824 memory accesses to 20 slices as follows [2, 6, 5, 5, 16, 29, 647, 1, 15, 15, 26, 3, 5, 1, 12, 8, 3, 14, 8, 3]. 79 percent of accesses are in the largest equivalence class. The 518 initializations are split as follows [2, 6, 5, 5, 0, 0, 451, 0, 8, 8, 0, 3, 5, 0, 0, 8, 3, 3, 8, 3]. The 150 writes are split as follows [0, 0, 0, 0, 16, 29, 63, 1, 3, 0, 26, 0, 0, 0, 2, 0, 0, 10, 0, 0]. [2025-03-04 04:20:54,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,507 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:20:54,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:20:54,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:20:54,599 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:20:54,599 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (1/1) ... [2025-03-04 04:20:54,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:20:54,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:20:54,625 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:20:54,628 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:20:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_port_mutex_of_lp_struct [2025-03-04 04:20:54,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_port_mutex_of_lp_struct [2025-03-04 04:20:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure lp_error [2025-03-04 04:20:54,645 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_error [2025-03-04 04:20:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:20:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:20:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:20:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:20:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:20:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure lp_register [2025-03-04 04:20:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_register [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2025-03-04 04:20:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-04 04:20:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure lp_release_parport [2025-03-04 04:20:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_release_parport [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:20:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:20:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 04:20:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:20:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:20:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 04:20:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-03-04 04:20:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_port_mutex_of_lp_struct [2025-03-04 04:20:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_port_mutex_of_lp_struct [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure lp_set_timeout [2025-03-04 04:20:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_set_timeout [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure lp_reset [2025-03-04 04:20:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_reset [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_25 [2025-03-04 04:20:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_25 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:20:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 04:20:54,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2025-03-04 04:20:54,650 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-04 04:20:54,650 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure parport_write [2025-03-04 04:20:54,650 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_write [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 04:20:54,650 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 04:20:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-03-04 04:20:54,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-03-04 04:20:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lp_mutex [2025-03-04 04:20:54,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lp_mutex [2025-03-04 04:20:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2025-03-04 04:20:54,653 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2025-03-04 04:20:54,653 INFO L130 BoogieDeclarations]: Found specification of procedure parport_negotiate [2025-03-04 04:20:54,653 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_negotiate [2025-03-04 04:20:54,653 INFO L130 BoogieDeclarations]: Found specification of procedure parport_release [2025-03-04 04:20:54,653 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_release [2025-03-04 04:20:54,653 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_console [2025-03-04 04:20:54,654 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_console [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure parport_set_timeout [2025-03-04 04:20:54,654 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_set_timeout [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 04:20:54,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure parport_claim_or_block [2025-03-04 04:20:54,655 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_claim_or_block [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure lp_do_ioctl [2025-03-04 04:20:54,655 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_do_ioctl [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2025-03-04 04:20:54,655 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-04 04:20:54,655 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:20:54,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:20:54,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:20:54,655 INFO L130 BoogieDeclarations]: Found specification of procedure lp_claim_parport_or_block [2025-03-04 04:20:54,656 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_claim_parport_or_block [2025-03-04 04:20:54,656 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2025-03-04 04:20:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-03-04 04:20:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:20:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-04 04:20:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 04:20:54,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:20:54,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2025-03-04 04:20:54,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __bad_percpu_size [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure lp_detach [2025-03-04 04:20:54,658 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_detach [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lp_mutex [2025-03-04 04:20:54,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lp_mutex [2025-03-04 04:20:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 04:20:54,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure lp_negotiate [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_negotiate [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure lp_wait_ready [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_wait_ready [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure lp_write [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_write [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure parport_yield_blocking [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_yield_blocking [2025-03-04 04:20:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 04:20:54,659 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 04:20:55,074 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:20:55,077 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:20:55,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3868: call ULTIMATE.dealloc(~#wait~0.base, ~#wait~0.offset);havoc ~#wait~0.base, ~#wait~0.offset; [2025-03-04 04:20:55,157 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:20:55,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6259: havoc parport_register_device_#t~ret597#1.base, parport_register_device_#t~ret597#1.offset; [2025-03-04 04:20:55,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6189: havoc device_create_#t~ret583#1.base, device_create_#t~ret583#1.offset; [2025-03-04 04:20:55,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc #t~mem69.base, #t~mem69.offset; [2025-03-04 04:20:55,340 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6229: havoc #t~nondet590; [2025-03-04 04:20:55,343 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6276: havoc #t~nondet599; [2025-03-04 04:20:55,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6283: havoc #t~nondet600; [2025-03-04 04:20:55,355 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6252: havoc #t~nondet595; [2025-03-04 04:20:55,358 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6301: havoc #t~nondet603; [2025-03-04 04:20:55,360 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6266: havoc #t~nondet598; [2025-03-04 04:20:55,362 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6248: havoc #t~nondet594; [2025-03-04 04:20:55,509 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5267-1: ldv_mutex_lock_interruptible_18_#res#1 := ldv_mutex_lock_interruptible_18_~ldv_func_res~3#1; [2025-03-04 04:20:55,510 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4327: call ULTIMATE.dealloc(~#status~2#1.base, ~#status~2#1.offset);havoc ~#status~2#1.base, ~#status~2#1.offset; [2025-03-04 04:20:55,520 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6179: havoc _copy_to_user_#t~nondet581#1; [2025-03-04 04:20:55,567 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6175: havoc _copy_from_user_#t~nondet580#1; [2025-03-04 04:20:55,587 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3681: havoc #t~mem68; [2025-03-04 04:20:55,670 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6293: havoc #t~nondet601; [2025-03-04 04:20:55,783 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5209-1: ldv_mutex_lock_interruptible_12_#res#1 := ldv_mutex_lock_interruptible_12_~ldv_func_res~1#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6214: havoc ldv_probe_2_#t~nondet587#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6218: havoc ldv_release_1_#t~nondet588#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6186: havoc compat_get_timeval_#t~nondet582#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5230-1: ldv_mutex_lock_interruptible_14_#res#1 := ldv_mutex_lock_interruptible_14_~ldv_func_res~2#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6222: havoc ldv_release_2_#t~nondet589#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6256: havoc parport_read_#t~nondet596#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4475: call ULTIMATE.dealloc(lp_compat_ioctl_~#par_timeout~1#1.base, lp_compat_ioctl_~#par_timeout~1#1.offset);havoc lp_compat_ioctl_~#par_timeout~1#1.base, lp_compat_ioctl_~#par_timeout~1#1.offset; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6160: havoc __parport_register_driver_#t~nondet577#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4445: call ULTIMATE.dealloc(lp_ioctl_~#par_timeout~0#1.base, lp_ioctl_~#par_timeout~0#1.offset);havoc lp_ioctl_~#par_timeout~0#1.base, lp_ioctl_~#par_timeout~0#1.offset; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6164: havoc __register_chrdev_#t~nondet578#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6297: havoc simple_strtoul_#t~nondet602#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655: havoc __kmalloc_#t~ret65#1.base, __kmalloc_#t~ret65#1.offset; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6199: havoc ldv_close_1_#t~nondet584#1; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4118: call ULTIMATE.dealloc(lp_read_~#wait~1#1.base, lp_read_~#wait~1#1.offset);havoc lp_read_~#wait~1#1.base, lp_read_~#wait~1#1.offset; [2025-03-04 04:21:01,083 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4681: call ULTIMATE.dealloc(lp_init_~#__key~0#1.base, lp_init_~#__key~0#1.offset);havoc lp_init_~#__key~0#1.base, lp_init_~#__key~0#1.offset;call ULTIMATE.dealloc(lp_init_~#__key___0~0#1.base, lp_init_~#__key___0~0#1.offset);havoc lp_init_~#__key___0~0#1.base, lp_init_~#__key___0~0#1.offset;call ULTIMATE.dealloc(lp_init_~#__key___1~0#1.base, lp_init_~#__key___1~0#1.offset);havoc lp_init_~#__key___1~0#1.base, lp_init_~#__key___1~0#1.offset;call ULTIMATE.dealloc(lp_init_~#__key___2~0#1.base, lp_init_~#__key___2~0#1.offset);havoc lp_init_~#__key___2~0#1.base, lp_init_~#__key___2~0#1.offset; [2025-03-04 04:21:01,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6171: havoc _cond_resched_#t~nondet579#1; [2025-03-04 04:21:01,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6138: havoc __class_create_#t~ret576#1.base, __class_create_#t~ret576#1.offset; [2025-03-04 04:21:01,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6206: havoc ldv_open_1_#t~nondet585#1; [2025-03-04 04:21:01,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4753: call ULTIMATE.dealloc(lp_init_module_~#ep~0#1.base, lp_init_module_~#ep~0#1.offset);havoc lp_init_module_~#ep~0#1.base, lp_init_module_~#ep~0#1.offset; [2025-03-04 04:21:01,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6240: havoc noop_llseek_#t~nondet592#1; [2025-03-04 04:21:01,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6210: havoc ldv_probe_1_#t~nondet586#1; [2025-03-04 04:21:01,084 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4856: call ULTIMATE.dealloc(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset);havoc main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg10~0#1.base, main_~#ldvarg10~0#1.offset);havoc main_~#ldvarg10~0#1.base, main_~#ldvarg10~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg13~0#1.base, main_~#ldvarg13~0#1.offset);havoc main_~#ldvarg13~0#1.base, main_~#ldvarg13~0#1.offset; [2025-03-04 04:21:01,085 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6244: havoc parport_claim_#t~nondet593#1; [2025-03-04 04:21:01,362 INFO L? ?]: Removed 1071 outVars from TransFormulas that were not future-live. [2025-03-04 04:21:01,362 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:21:01,444 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:21:01,445 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:21:01,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:21:01 BoogieIcfgContainer [2025-03-04 04:21:01,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:21:01,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:21:01,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:21:01,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:21:01,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:20:52" (1/3) ... [2025-03-04 04:21:01,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ff4941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:21:01, skipping insertion in model container [2025-03-04 04:21:01,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:20:54" (2/3) ... [2025-03-04 04:21:01,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ff4941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:21:01, skipping insertion in model container [2025-03-04 04:21:01,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:21:01" (3/3) ... [2025-03-04 04:21:01,453 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2025-03-04 04:21:01,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:21:01,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i that has 58 procedures, 994 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 04:21:01,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:21:01,539 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;@7e538c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:21:01,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:21:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 993 states, 730 states have (on average 1.3821917808219177) internal successors, (1009), 754 states have internal predecessors, (1009), 205 states have call successors, (205), 57 states have call predecessors, (205), 56 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-04 04:21:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 04:21:01,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:01,562 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:01,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:01,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -996032846, now seen corresponding path program 1 times [2025-03-04 04:21:01,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:01,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503796026] [2025-03-04 04:21:01,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:02,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 04:21:02,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 04:21:02,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:02,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-04 04:21:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503796026] [2025-03-04 04:21:02,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503796026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:21:02,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361319197] [2025-03-04 04:21:02,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:02,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:21:02,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:21:02,896 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:21:02,898 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:21:03,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 04:21:04,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 04:21:04,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:04,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:04,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 3610 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:21:04,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:21:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-04 04:21:04,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:21:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361319197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:21:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:21:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499378481] [2025-03-04 04:21:04,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:04,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:21:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:04,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:21:04,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:21:04,403 INFO L87 Difference]: Start difference. First operand has 993 states, 730 states have (on average 1.3821917808219177) internal successors, (1009), 754 states have internal predecessors, (1009), 205 states have call successors, (205), 57 states have call predecessors, (205), 56 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:21:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:04,570 INFO L93 Difference]: Finished difference Result 1981 states and 2857 transitions. [2025-03-04 04:21:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:21:04,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 180 [2025-03-04 04:21:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:04,585 INFO L225 Difference]: With dead ends: 1981 [2025-03-04 04:21:04,585 INFO L226 Difference]: Without dead ends: 981 [2025-03-04 04:21:04,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:21:04,593 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:04,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1366 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:21:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-03-04 04:21:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-03-04 04:21:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 725 states have (on average 1.3668965517241378) internal successors, (991), 742 states have internal predecessors, (991), 200 states have call successors, (200), 56 states have call predecessors, (200), 55 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-04 04:21:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1382 transitions. [2025-03-04 04:21:04,672 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1382 transitions. Word has length 180 [2025-03-04 04:21:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:04,673 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1382 transitions. [2025-03-04 04:21:04,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:21:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1382 transitions. [2025-03-04 04:21:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 04:21:04,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:04,680 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:04,692 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:21:04,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 04:21:04,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:04,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1700897096, now seen corresponding path program 1 times [2025-03-04 04:21:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611381084] [2025-03-04 04:21:04,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:04,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:05,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 04:21:05,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 04:21:05,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:05,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611381084] [2025-03-04 04:21:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611381084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:21:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594453892] [2025-03-04 04:21:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:06,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:21:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:06,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:21:06,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:21:06,135 INFO L87 Difference]: Start difference. First operand 981 states and 1382 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:21:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:06,495 INFO L93 Difference]: Finished difference Result 2866 states and 4039 transitions. [2025-03-04 04:21:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:21:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 180 [2025-03-04 04:21:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:06,508 INFO L225 Difference]: With dead ends: 2866 [2025-03-04 04:21:06,509 INFO L226 Difference]: Without dead ends: 1923 [2025-03-04 04:21:06,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:21:06,512 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 1336 mSDsluCounter, 2703 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4118 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:06,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 4118 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:21:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-03-04 04:21:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1905. [2025-03-04 04:21:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1419 states have (on average 1.3706835799859056) internal successors, (1945), 1446 states have internal predecessors, (1945), 376 states have call successors, (376), 110 states have call predecessors, (376), 109 states have return successors, (367), 366 states have call predecessors, (367), 367 states have call successors, (367) [2025-03-04 04:21:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2688 transitions. [2025-03-04 04:21:06,590 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2688 transitions. Word has length 180 [2025-03-04 04:21:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:06,591 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2688 transitions. [2025-03-04 04:21:06,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:21:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2688 transitions. [2025-03-04 04:21:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 04:21:06,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:06,594 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:06,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:21:06,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:06,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1116780347, now seen corresponding path program 1 times [2025-03-04 04:21:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248498378] [2025-03-04 04:21:06,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:07,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 04:21:07,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 04:21:07,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:07,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:07,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248498378] [2025-03-04 04:21:07,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248498378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:07,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:07,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:21:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338431496] [2025-03-04 04:21:07,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:07,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:21:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:07,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:21:07,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:21:07,824 INFO L87 Difference]: Start difference. First operand 1905 states and 2688 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 04:21:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:08,229 INFO L93 Difference]: Finished difference Result 3793 states and 5351 transitions. [2025-03-04 04:21:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:21:08,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 181 [2025-03-04 04:21:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:08,245 INFO L225 Difference]: With dead ends: 3793 [2025-03-04 04:21:08,245 INFO L226 Difference]: Without dead ends: 1926 [2025-03-04 04:21:08,253 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:21:08,257 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1378 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:08,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 4053 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:21:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2025-03-04 04:21:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1913. [2025-03-04 04:21:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1427 states have (on average 1.368605466012614) internal successors, (1953), 1454 states have internal predecessors, (1953), 376 states have call successors, (376), 110 states have call predecessors, (376), 109 states have return successors, (367), 366 states have call predecessors, (367), 367 states have call successors, (367) [2025-03-04 04:21:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2696 transitions. [2025-03-04 04:21:08,362 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2696 transitions. Word has length 181 [2025-03-04 04:21:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:08,363 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2696 transitions. [2025-03-04 04:21:08,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 04:21:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2696 transitions. [2025-03-04 04:21:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 04:21:08,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:08,367 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:08,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:21:08,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:08,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:08,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2057003727, now seen corresponding path program 1 times [2025-03-04 04:21:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:08,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129416812] [2025-03-04 04:21:08,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:08,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 04:21:09,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 04:21:09,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:09,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:09,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129416812] [2025-03-04 04:21:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129416812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:09,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:09,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:09,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923204314] [2025-03-04 04:21:09,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:09,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:09,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:09,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:09,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:09,164 INFO L87 Difference]: Start difference. First operand 1913 states and 2696 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 04:21:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:09,453 INFO L93 Difference]: Finished difference Result 4337 states and 6060 transitions. [2025-03-04 04:21:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:09,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 184 [2025-03-04 04:21:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:09,465 INFO L225 Difference]: With dead ends: 4337 [2025-03-04 04:21:09,466 INFO L226 Difference]: Without dead ends: 2462 [2025-03-04 04:21:09,471 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:21:09,472 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 432 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:09,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 2600 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:21:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2025-03-04 04:21:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2400. [2025-03-04 04:21:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1800 states have (on average 1.3666666666666667) internal successors, (2460), 1831 states have internal predecessors, (2460), 445 states have call successors, (445), 155 states have call predecessors, (445), 154 states have return successors, (436), 433 states have call predecessors, (436), 436 states have call successors, (436) [2025-03-04 04:21:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3341 transitions. [2025-03-04 04:21:09,558 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3341 transitions. Word has length 184 [2025-03-04 04:21:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:09,560 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3341 transitions. [2025-03-04 04:21:09,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 04:21:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3341 transitions. [2025-03-04 04:21:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 04:21:09,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:09,563 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:21:09,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:09,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1073019466, now seen corresponding path program 1 times [2025-03-04 04:21:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305859897] [2025-03-04 04:21:09,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:09,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:10,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 04:21:10,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 04:21:10,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:10,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:10,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305859897] [2025-03-04 04:21:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305859897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:10,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:10,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355491670] [2025-03-04 04:21:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:10,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:10,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:10,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:10,459 INFO L87 Difference]: Start difference. First operand 2400 states and 3341 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 04:21:14,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:21:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:14,892 INFO L93 Difference]: Finished difference Result 6888 states and 9598 transitions. [2025-03-04 04:21:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 191 [2025-03-04 04:21:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:14,917 INFO L225 Difference]: With dead ends: 6888 [2025-03-04 04:21:14,917 INFO L226 Difference]: Without dead ends: 4526 [2025-03-04 04:21:14,925 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:21:14,926 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 1277 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:14,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2630 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:21:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4526 states. [2025-03-04 04:21:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4526 to 4513. [2025-03-04 04:21:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4513 states, 3391 states have (on average 1.3703922146859333) internal successors, (4647), 3440 states have internal predecessors, (4647), 824 states have call successors, (824), 298 states have call predecessors, (824), 297 states have return successors, (815), 812 states have call predecessors, (815), 815 states have call successors, (815) [2025-03-04 04:21:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6286 transitions. [2025-03-04 04:21:15,084 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6286 transitions. Word has length 191 [2025-03-04 04:21:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 4513 states and 6286 transitions. [2025-03-04 04:21:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 04:21:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6286 transitions. [2025-03-04 04:21:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 04:21:15,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:15,087 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:15,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:21:15,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:15,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 132547475, now seen corresponding path program 1 times [2025-03-04 04:21:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139010792] [2025-03-04 04:21:15,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:15,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 04:21:15,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 04:21:15,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:15,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:16,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:16,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139010792] [2025-03-04 04:21:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139010792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377012846] [2025-03-04 04:21:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:16,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:16,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:16,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:16,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:16,069 INFO L87 Difference]: Start difference. First operand 4513 states and 6286 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 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:21:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:16,242 INFO L93 Difference]: Finished difference Result 4515 states and 6287 transitions. [2025-03-04 04:21:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:16,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 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 190 [2025-03-04 04:21:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:16,261 INFO L225 Difference]: With dead ends: 4515 [2025-03-04 04:21:16,261 INFO L226 Difference]: Without dead ends: 4512 [2025-03-04 04:21:16,263 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:21:16,264 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1325 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:16,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 1348 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:21:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2025-03-04 04:21:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4512. [2025-03-04 04:21:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3391 states have (on average 1.370097316425833) internal successors, (4646), 3439 states have internal predecessors, (4646), 823 states have call successors, (823), 298 states have call predecessors, (823), 297 states have return successors, (815), 812 states have call predecessors, (815), 815 states have call successors, (815) [2025-03-04 04:21:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 6284 transitions. [2025-03-04 04:21:16,405 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 6284 transitions. Word has length 190 [2025-03-04 04:21:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:16,406 INFO L471 AbstractCegarLoop]: Abstraction has 4512 states and 6284 transitions. [2025-03-04 04:21:16,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 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:21:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 6284 transitions. [2025-03-04 04:21:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 04:21:16,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:16,408 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:16,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:21:16,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:16,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash -186891612, now seen corresponding path program 1 times [2025-03-04 04:21:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123924512] [2025-03-04 04:21:16,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:16,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 04:21:17,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 04:21:17,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:17,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:17,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123924512] [2025-03-04 04:21:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123924512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:17,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:17,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050903047] [2025-03-04 04:21:17,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:17,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:17,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:17,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:17,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:17,142 INFO L87 Difference]: Start difference. First operand 4512 states and 6284 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 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:21:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:17,312 INFO L93 Difference]: Finished difference Result 4514 states and 6285 transitions. [2025-03-04 04:21:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:17,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 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 191 [2025-03-04 04:21:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:17,334 INFO L225 Difference]: With dead ends: 4514 [2025-03-04 04:21:17,334 INFO L226 Difference]: Without dead ends: 4511 [2025-03-04 04:21:17,338 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:21:17,340 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 1322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:17,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1346 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:21:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2025-03-04 04:21:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4511. [2025-03-04 04:21:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4511 states, 3391 states have (on average 1.369802418165733) internal successors, (4645), 3438 states have internal predecessors, (4645), 822 states have call successors, (822), 298 states have call predecessors, (822), 297 states have return successors, (815), 812 states have call predecessors, (815), 815 states have call successors, (815) [2025-03-04 04:21:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 6282 transitions. [2025-03-04 04:21:17,522 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 6282 transitions. Word has length 191 [2025-03-04 04:21:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:17,523 INFO L471 AbstractCegarLoop]: Abstraction has 4511 states and 6282 transitions. [2025-03-04 04:21:17,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 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:21:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 6282 transitions. [2025-03-04 04:21:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 04:21:17,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:17,524 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:17,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:21:17,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:17,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1499569740, now seen corresponding path program 1 times [2025-03-04 04:21:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:17,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274082631] [2025-03-04 04:21:17,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:18,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 04:21:18,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 04:21:18,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:18,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274082631] [2025-03-04 04:21:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274082631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:18,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233895113] [2025-03-04 04:21:18,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:18,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:18,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:18,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:18,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:18,368 INFO L87 Difference]: Start difference. First operand 4511 states and 6282 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 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:21:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:18,579 INFO L93 Difference]: Finished difference Result 5009 states and 6786 transitions. [2025-03-04 04:21:18,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:18,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 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 192 [2025-03-04 04:21:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:18,615 INFO L225 Difference]: With dead ends: 5009 [2025-03-04 04:21:18,616 INFO L226 Difference]: Without dead ends: 5005 [2025-03-04 04:21:18,622 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:21:18,623 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 1010 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:18,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1768 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:21:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5005 states. [2025-03-04 04:21:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5005 to 5001. [2025-03-04 04:21:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5001 states, 3715 states have (on average 1.3448183041722745) internal successors, (4996), 3760 states have internal predecessors, (4996), 892 states have call successors, (892), 394 states have call predecessors, (892), 393 states have return successors, (887), 884 states have call predecessors, (887), 887 states have call successors, (887) [2025-03-04 04:21:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 6775 transitions. [2025-03-04 04:21:18,797 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 6775 transitions. Word has length 192 [2025-03-04 04:21:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:18,798 INFO L471 AbstractCegarLoop]: Abstraction has 5001 states and 6775 transitions. [2025-03-04 04:21:18,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 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:21:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 6775 transitions. [2025-03-04 04:21:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 04:21:18,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:18,801 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:18,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:21:18,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:18,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:18,801 INFO L85 PathProgramCache]: Analyzing trace with hash 757080229, now seen corresponding path program 1 times [2025-03-04 04:21:18,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:18,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191663454] [2025-03-04 04:21:18,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:19,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 04:21:19,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 04:21:19,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:19,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:19,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:19,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191663454] [2025-03-04 04:21:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191663454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:19,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:19,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:19,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8786450] [2025-03-04 04:21:19,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:19,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:19,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:19,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:19,653 INFO L87 Difference]: Start difference. First operand 5001 states and 6775 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 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:21:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:19,842 INFO L93 Difference]: Finished difference Result 5003 states and 6776 transitions. [2025-03-04 04:21:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 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 193 [2025-03-04 04:21:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:19,861 INFO L225 Difference]: With dead ends: 5003 [2025-03-04 04:21:19,862 INFO L226 Difference]: Without dead ends: 5000 [2025-03-04 04:21:19,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:19,865 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 1314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:19,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1340 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:21:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2025-03-04 04:21:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 5000. [2025-03-04 04:21:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5000 states, 3715 states have (on average 1.3445491251682369) internal successors, (4995), 3759 states have internal predecessors, (4995), 891 states have call successors, (891), 394 states have call predecessors, (891), 393 states have return successors, (887), 884 states have call predecessors, (887), 887 states have call successors, (887) [2025-03-04 04:21:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 6773 transitions. [2025-03-04 04:21:20,031 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 6773 transitions. Word has length 193 [2025-03-04 04:21:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:20,032 INFO L471 AbstractCegarLoop]: Abstraction has 5000 states and 6773 transitions. [2025-03-04 04:21:20,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 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:21:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 6773 transitions. [2025-03-04 04:21:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 04:21:20,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:20,034 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:21:20,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1993751509, now seen corresponding path program 1 times [2025-03-04 04:21:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240849746] [2025-03-04 04:21:20,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:20,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 04:21:20,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 04:21:20,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:20,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 04:21:20,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240849746] [2025-03-04 04:21:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240849746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647200096] [2025-03-04 04:21:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:20,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:20,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:20,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:20,922 INFO L87 Difference]: Start difference. First operand 5000 states and 6773 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 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:21:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:21,360 INFO L93 Difference]: Finished difference Result 14802 states and 20163 transitions. [2025-03-04 04:21:21,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:21,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 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 194 [2025-03-04 04:21:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:21,405 INFO L225 Difference]: With dead ends: 14802 [2025-03-04 04:21:21,405 INFO L226 Difference]: Without dead ends: 9803 [2025-03-04 04:21:21,424 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:21:21,425 INFO L435 NwaCegarLoop]: 1720 mSDtfsCounter, 1313 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 2978 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:21,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 2978 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:21:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9803 states. [2025-03-04 04:21:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9803 to 9761. [2025-03-04 04:21:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9761 states, 7273 states have (on average 1.3460745222054173) internal successors, (9790), 7363 states have internal predecessors, (9790), 1724 states have call successors, (1724), 765 states have call predecessors, (1724), 763 states have return successors, (1773), 1705 states have call predecessors, (1773), 1717 states have call successors, (1773) [2025-03-04 04:21:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9761 states to 9761 states and 13287 transitions. [2025-03-04 04:21:21,801 INFO L78 Accepts]: Start accepts. Automaton has 9761 states and 13287 transitions. Word has length 194 [2025-03-04 04:21:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:21,802 INFO L471 AbstractCegarLoop]: Abstraction has 9761 states and 13287 transitions. [2025-03-04 04:21:21,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 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:21:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 9761 states and 13287 transitions. [2025-03-04 04:21:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-04 04:21:21,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:21,851 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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:21:21,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:21:21,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:21,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1686048034, now seen corresponding path program 1 times [2025-03-04 04:21:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:21,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769981897] [2025-03-04 04:21:21,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:22,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 04:21:22,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 04:21:22,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:22,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 04:21:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:22,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769981897] [2025-03-04 04:21:22,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769981897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:22,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126397970] [2025-03-04 04:21:22,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:22,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:22,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:22,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:22,761 INFO L87 Difference]: Start difference. First operand 9761 states and 13287 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 04:21:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:23,335 INFO L93 Difference]: Finished difference Result 19508 states and 26557 transitions. [2025-03-04 04:21:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:23,336 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 254 [2025-03-04 04:21:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:23,374 INFO L225 Difference]: With dead ends: 19508 [2025-03-04 04:21:23,374 INFO L226 Difference]: Without dead ends: 9785 [2025-03-04 04:21:23,402 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:21:23,403 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 3 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:23,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2670 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:21:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2025-03-04 04:21:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 9765. [2025-03-04 04:21:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9765 states, 7277 states have (on average 1.3458842929778756) internal successors, (9794), 7367 states have internal predecessors, (9794), 1724 states have call successors, (1724), 765 states have call predecessors, (1724), 763 states have return successors, (1773), 1705 states have call predecessors, (1773), 1717 states have call successors, (1773) [2025-03-04 04:21:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9765 states to 9765 states and 13291 transitions. [2025-03-04 04:21:23,857 INFO L78 Accepts]: Start accepts. Automaton has 9765 states and 13291 transitions. Word has length 254 [2025-03-04 04:21:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:23,857 INFO L471 AbstractCegarLoop]: Abstraction has 9765 states and 13291 transitions. [2025-03-04 04:21:23,858 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 04:21:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 9765 states and 13291 transitions. [2025-03-04 04:21:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-04 04:21:23,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:23,864 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-03-04 04:21:23,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 04:21:23,865 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:23,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash 132117828, now seen corresponding path program 1 times [2025-03-04 04:21:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:23,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767084488] [2025-03-04 04:21:23,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:24,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-04 04:21:24,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-04 04:21:24,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:24,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-04 04:21:24,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767084488] [2025-03-04 04:21:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767084488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:21:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450817929] [2025-03-04 04:21:24,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:24,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:21:24,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:21:24,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:21:24,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 04:21:25,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-04 04:21:26,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-04 04:21:26,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:26,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:26,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 4151 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:21:26,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:21:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-04 04:21:26,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:21:26,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450817929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:26,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:21:26,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 04:21:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641902649] [2025-03-04 04:21:26,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:26,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:26,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:26,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:21:26,346 INFO L87 Difference]: Start difference. First operand 9765 states and 13291 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:21:30,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:21:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:30,818 INFO L93 Difference]: Finished difference Result 15228 states and 20652 transitions. [2025-03-04 04:21:30,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:30,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 266 [2025-03-04 04:21:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:30,844 INFO L225 Difference]: With dead ends: 15228 [2025-03-04 04:21:30,845 INFO L226 Difference]: Without dead ends: 5497 [2025-03-04 04:21:30,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:21:30,871 INFO L435 NwaCegarLoop]: 1341 mSDtfsCounter, 9 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:30,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2676 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:21:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2025-03-04 04:21:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 5476. [2025-03-04 04:21:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 4067 states have (on average 1.3358741086796164) internal successors, (5433), 4118 states have internal predecessors, (5433), 964 states have call successors, (964), 446 states have call predecessors, (964), 444 states have return successors, (985), 951 states have call predecessors, (985), 957 states have call successors, (985) [2025-03-04 04:21:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7382 transitions. [2025-03-04 04:21:31,154 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7382 transitions. Word has length 266 [2025-03-04 04:21:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:31,155 INFO L471 AbstractCegarLoop]: Abstraction has 5476 states and 7382 transitions. [2025-03-04 04:21:31,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:21:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7382 transitions. [2025-03-04 04:21:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-04 04:21:31,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:31,161 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2025-03-04 04:21:31,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 04:21:31,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 04:21:31,362 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:31,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:31,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2096840290, now seen corresponding path program 1 times [2025-03-04 04:21:31,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:31,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593815921] [2025-03-04 04:21:31,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:31,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-04 04:21:32,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-04 04:21:32,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:32,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-04 04:21:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:32,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593815921] [2025-03-04 04:21:32,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593815921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:21:32,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473501804] [2025-03-04 04:21:32,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:32,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:21:32,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:21:32,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:21:32,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:21:33,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-04 04:21:33,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-04 04:21:33,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:33,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:33,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 4231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 04:21:33,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:21:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 255 proven. 1 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 04:21:33,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:21:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-04 04:21:34,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473501804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:21:34,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:21:34,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 04:21:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132135096] [2025-03-04 04:21:34,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:21:34,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 04:21:34,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:34,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 04:21:34,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:21:34,088 INFO L87 Difference]: Start difference. First operand 5476 states and 7382 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 5 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-03-04 04:21:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:35,034 INFO L93 Difference]: Finished difference Result 10775 states and 14540 transitions. [2025-03-04 04:21:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:21:35,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 5 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 283 [2025-03-04 04:21:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:35,058 INFO L225 Difference]: With dead ends: 10775 [2025-03-04 04:21:35,058 INFO L226 Difference]: Without dead ends: 5548 [2025-03-04 04:21:35,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:21:35,070 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 6 mSDsluCounter, 5324 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:35,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6661 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 04:21:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2025-03-04 04:21:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5548. [2025-03-04 04:21:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5548 states, 4115 states have (on average 1.3319562575941677) internal successors, (5481), 4166 states have internal predecessors, (5481), 988 states have call successors, (988), 446 states have call predecessors, (988), 444 states have return successors, (1009), 975 states have call predecessors, (1009), 981 states have call successors, (1009) [2025-03-04 04:21:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 7478 transitions. [2025-03-04 04:21:35,319 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 7478 transitions. Word has length 283 [2025-03-04 04:21:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:35,319 INFO L471 AbstractCegarLoop]: Abstraction has 5548 states and 7478 transitions. [2025-03-04 04:21:35,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 5 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-03-04 04:21:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 7478 transitions. [2025-03-04 04:21:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-04 04:21:35,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:35,325 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-04 04:21:35,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 04:21:35,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:21:35,526 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:35,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:35,527 INFO L85 PathProgramCache]: Analyzing trace with hash 458914476, now seen corresponding path program 2 times [2025-03-04 04:21:35,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:35,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179779519] [2025-03-04 04:21:35,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:21:35,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:36,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 319 statements into 2 equivalence classes. [2025-03-04 04:21:36,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 319 statements. [2025-03-04 04:21:36,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 04:21:36,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-04 04:21:36,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179779519] [2025-03-04 04:21:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179779519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:36,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158392726] [2025-03-04 04:21:36,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:36,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:36,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:36,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:36,321 INFO L87 Difference]: Start difference. First operand 5548 states and 7478 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 04:21:40,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:21:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:40,573 INFO L93 Difference]: Finished difference Result 5556 states and 7484 transitions. [2025-03-04 04:21:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 319 [2025-03-04 04:21:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:40,604 INFO L225 Difference]: With dead ends: 5556 [2025-03-04 04:21:40,604 INFO L226 Difference]: Without dead ends: 5553 [2025-03-04 04:21:40,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:21:40,608 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 423 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:40,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 2501 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:21:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5553 states. [2025-03-04 04:21:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5553 to 5547. [2025-03-04 04:21:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5547 states, 4115 states have (on average 1.3309842041312272) internal successors, (5477), 4165 states have internal predecessors, (5477), 987 states have call successors, (987), 446 states have call predecessors, (987), 444 states have return successors, (1009), 975 states have call predecessors, (1009), 981 states have call successors, (1009) [2025-03-04 04:21:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5547 states to 5547 states and 7473 transitions. [2025-03-04 04:21:40,830 INFO L78 Accepts]: Start accepts. Automaton has 5547 states and 7473 transitions. Word has length 319 [2025-03-04 04:21:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:40,831 INFO L471 AbstractCegarLoop]: Abstraction has 5547 states and 7473 transitions. [2025-03-04 04:21:40,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 04:21:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5547 states and 7473 transitions. [2025-03-04 04:21:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-04 04:21:40,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:40,840 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:21:40,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 04:21:40,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:40,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash -176101489, now seen corresponding path program 1 times [2025-03-04 04:21:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:40,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87684458] [2025-03-04 04:21:40,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:41,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-04 04:21:41,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-04 04:21:41,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:41,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-04 04:21:42,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:42,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87684458] [2025-03-04 04:21:42,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87684458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:42,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:42,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:21:42,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639440758] [2025-03-04 04:21:42,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:42,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:21:42,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:42,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:21:42,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:21:42,236 INFO L87 Difference]: Start difference. First operand 5547 states and 7473 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:21:46,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:21:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:46,638 INFO L93 Difference]: Finished difference Result 10868 states and 14638 transitions. [2025-03-04 04:21:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:21:46,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 353 [2025-03-04 04:21:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:46,658 INFO L225 Difference]: With dead ends: 10868 [2025-03-04 04:21:46,658 INFO L226 Difference]: Without dead ends: 5545 [2025-03-04 04:21:46,668 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:21:46,669 INFO L435 NwaCegarLoop]: 1338 mSDtfsCounter, 10 mSDsluCounter, 3999 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5337 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:46,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5337 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:21:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2025-03-04 04:21:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 5509. [2025-03-04 04:21:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 4086 states have (on average 1.330396475770925) internal successors, (5436), 4139 states have internal predecessors, (5436), 980 states have call successors, (980), 444 states have call predecessors, (980), 442 states have return successors, (1002), 965 states have call predecessors, (1002), 974 states have call successors, (1002) [2025-03-04 04:21:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 7418 transitions. [2025-03-04 04:21:46,944 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 7418 transitions. Word has length 353 [2025-03-04 04:21:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:46,945 INFO L471 AbstractCegarLoop]: Abstraction has 5509 states and 7418 transitions. [2025-03-04 04:21:46,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:21:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 7418 transitions. [2025-03-04 04:21:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-04 04:21:46,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:46,953 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:21:46,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 04:21:46,953 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:46,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash -538378690, now seen corresponding path program 1 times [2025-03-04 04:21:46,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590478626] [2025-03-04 04:21:46,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:47,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-04 04:21:47,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-04 04:21:47,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-03-04 04:21:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:47,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590478626] [2025-03-04 04:21:47,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590478626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:47,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:47,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:47,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034410999] [2025-03-04 04:21:47,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:47,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:47,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:47,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:47,880 INFO L87 Difference]: Start difference. First operand 5509 states and 7418 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:21:51,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:21:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:52,280 INFO L93 Difference]: Finished difference Result 10768 states and 14507 transitions. [2025-03-04 04:21:52,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:52,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 369 [2025-03-04 04:21:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:52,302 INFO L225 Difference]: With dead ends: 10768 [2025-03-04 04:21:52,302 INFO L226 Difference]: Without dead ends: 5511 [2025-03-04 04:21:52,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:21:52,313 INFO L435 NwaCegarLoop]: 2172 mSDtfsCounter, 1278 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:52,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 3463 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:21:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2025-03-04 04:21:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 5462. [2025-03-04 04:21:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5462 states, 4047 states have (on average 1.3286384976525822) internal successors, (5377), 4102 states have internal predecessors, (5377), 974 states have call successors, (974), 439 states have call predecessors, (974), 440 states have return successors, (975), 960 states have call predecessors, (975), 961 states have call successors, (975) [2025-03-04 04:21:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 7326 transitions. [2025-03-04 04:21:52,488 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 7326 transitions. Word has length 369 [2025-03-04 04:21:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:52,489 INFO L471 AbstractCegarLoop]: Abstraction has 5462 states and 7326 transitions. [2025-03-04 04:21:52,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:21:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 7326 transitions. [2025-03-04 04:21:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-04 04:21:52,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:52,496 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:21:52,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 04:21:52,497 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:52,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2083215046, now seen corresponding path program 1 times [2025-03-04 04:21:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683979441] [2025-03-04 04:21:52,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:53,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-03-04 04:21:53,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-03-04 04:21:53,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:53,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-04 04:21:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:53,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683979441] [2025-03-04 04:21:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683979441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:21:53,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:21:53,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:21:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770837449] [2025-03-04 04:21:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:21:53,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:21:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:21:53,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:21:53,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:21:53,442 INFO L87 Difference]: Start difference. First operand 5462 states and 7326 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-04 04:21:57,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:21:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:21:57,863 INFO L93 Difference]: Finished difference Result 13045 states and 17466 transitions. [2025-03-04 04:21:57,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:21:57,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 370 [2025-03-04 04:21:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:21:57,893 INFO L225 Difference]: With dead ends: 13045 [2025-03-04 04:21:57,893 INFO L226 Difference]: Without dead ends: 7835 [2025-03-04 04:21:57,905 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:21:57,906 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 911 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:21:57,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2819 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:21:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2025-03-04 04:21:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 7671. [2025-03-04 04:21:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7671 states, 5714 states have (on average 1.333391669583479) internal successors, (7619), 5801 states have internal predecessors, (7619), 1309 states have call successors, (1309), 644 states have call predecessors, (1309), 647 states have return successors, (1312), 1291 states have call predecessors, (1312), 1296 states have call successors, (1312) [2025-03-04 04:21:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7671 states to 7671 states and 10240 transitions. [2025-03-04 04:21:58,172 INFO L78 Accepts]: Start accepts. Automaton has 7671 states and 10240 transitions. Word has length 370 [2025-03-04 04:21:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:21:58,173 INFO L471 AbstractCegarLoop]: Abstraction has 7671 states and 10240 transitions. [2025-03-04 04:21:58,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-04 04:21:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 7671 states and 10240 transitions. [2025-03-04 04:21:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-04 04:21:58,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:21:58,179 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:21:58,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 04:21:58,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:21:58,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:21:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash -527062563, now seen corresponding path program 1 times [2025-03-04 04:21:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:21:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628693583] [2025-03-04 04:21:58,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:21:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-04 04:21:58,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-04 04:21:58,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:21:58,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:21:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-04 04:21:59,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:21:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628693583] [2025-03-04 04:21:59,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628693583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:21:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850933023] [2025-03-04 04:21:59,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:21:59,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:21:59,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:21:59,292 INFO L229 MonitoredProcess]: Starting monitored process 5 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:21:59,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 04:22:00,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-04 04:22:01,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-04 04:22:01,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:22:01,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:22:01,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 5007 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 04:22:01,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:22:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 255 proven. 40 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-04 04:22:01,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:22:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-04 04:22:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850933023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:22:01,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:22:01,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 04:22:01,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650119485] [2025-03-04 04:22:01,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:22:01,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 04:22:01,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:22:01,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 04:22:01,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:22:01,998 INFO L87 Difference]: Start difference. First operand 7671 states and 10240 transitions. Second operand has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 10 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (63), 10 states have call predecessors, (63), 10 states have call successors, (63) [2025-03-04 04:22:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:22:02,968 INFO L93 Difference]: Finished difference Result 15186 states and 20290 transitions. [2025-03-04 04:22:02,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 04:22:02,969 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 10 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (63), 10 states have call predecessors, (63), 10 states have call successors, (63) Word has length 369 [2025-03-04 04:22:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:22:03,006 INFO L225 Difference]: With dead ends: 15186 [2025-03-04 04:22:03,006 INFO L226 Difference]: Without dead ends: 7767 [2025-03-04 04:22:03,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 732 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 04:22:03,023 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 3 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3993 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 04:22:03,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3993 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 04:22:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7767 states. [2025-03-04 04:22:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7767 to 7767. [2025-03-04 04:22:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7767 states, 5778 states have (on average 1.329698857736241) internal successors, (7683), 5865 states have internal predecessors, (7683), 1341 states have call successors, (1341), 644 states have call predecessors, (1341), 647 states have return successors, (1344), 1323 states have call predecessors, (1344), 1328 states have call successors, (1344) [2025-03-04 04:22:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7767 states to 7767 states and 10368 transitions. [2025-03-04 04:22:03,423 INFO L78 Accepts]: Start accepts. Automaton has 7767 states and 10368 transitions. Word has length 369 [2025-03-04 04:22:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:22:03,424 INFO L471 AbstractCegarLoop]: Abstraction has 7767 states and 10368 transitions. [2025-03-04 04:22:03,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.90909090909091) internal successors, (197), 11 states have internal predecessors, (197), 10 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (63), 10 states have call predecessors, (63), 10 states have call successors, (63) [2025-03-04 04:22:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7767 states and 10368 transitions. [2025-03-04 04:22:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-04 04:22:03,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:22:03,432 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:22:03,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 04:22:03,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 04:22:03,633 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:22:03,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:22:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1249615685, now seen corresponding path program 2 times [2025-03-04 04:22:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:22:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411081309] [2025-03-04 04:22:03,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:22:03,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:22:04,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 417 statements into 2 equivalence classes. [2025-03-04 04:22:04,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 417 statements. [2025-03-04 04:22:04,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 04:22:04,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:22:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2025-03-04 04:22:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:22:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411081309] [2025-03-04 04:22:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411081309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:22:04,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:22:04,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:22:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278326803] [2025-03-04 04:22:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:22:04,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:22:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:22:04,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:22:04,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:22:04,850 INFO L87 Difference]: Start difference. First operand 7767 states and 10368 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:22:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:22:05,463 INFO L93 Difference]: Finished difference Result 8088 states and 10694 transitions. [2025-03-04 04:22:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:22:05,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 417 [2025-03-04 04:22:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:22:05,495 INFO L225 Difference]: With dead ends: 8088 [2025-03-04 04:22:05,496 INFO L226 Difference]: Without dead ends: 7041 [2025-03-04 04:22:05,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:22:05,505 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 0 mSDsluCounter, 5358 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6701 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:22:05,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6701 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 04:22:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2025-03-04 04:22:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 7041. [2025-03-04 04:22:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7041 states, 5235 states have (on average 1.318815663801337) internal successors, (6904), 5303 states have internal predecessors, (6904), 1192 states have call successors, (1192), 610 states have call predecessors, (1192), 613 states have return successors, (1196), 1178 states have call predecessors, (1196), 1180 states have call successors, (1196) [2025-03-04 04:22:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7041 states to 7041 states and 9292 transitions. [2025-03-04 04:22:05,811 INFO L78 Accepts]: Start accepts. Automaton has 7041 states and 9292 transitions. Word has length 417 [2025-03-04 04:22:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:22:05,811 INFO L471 AbstractCegarLoop]: Abstraction has 7041 states and 9292 transitions. [2025-03-04 04:22:05,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-04 04:22:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7041 states and 9292 transitions. [2025-03-04 04:22:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 04:22:05,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:22:05,821 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:22:05,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 04:22:05,821 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:22:05,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:22:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1133770001, now seen corresponding path program 1 times [2025-03-04 04:22:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:22:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953386857] [2025-03-04 04:22:05,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:22:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:22:06,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 04:22:06,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 04:22:06,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:22:06,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:22:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2025-03-04 04:22:07,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:22:07,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953386857] [2025-03-04 04:22:07,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953386857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:22:07,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:22:07,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:22:07,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832774050] [2025-03-04 04:22:07,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:22:07,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:22:07,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:22:07,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:22:07,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:22:07,452 INFO L87 Difference]: Start difference. First operand 7041 states and 9292 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-04 04:22:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:22:08,057 INFO L93 Difference]: Finished difference Result 9737 states and 12807 transitions. [2025-03-04 04:22:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:22:08,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 430 [2025-03-04 04:22:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:22:08,091 INFO L225 Difference]: With dead ends: 9737 [2025-03-04 04:22:08,091 INFO L226 Difference]: Without dead ends: 7027 [2025-03-04 04:22:08,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:22:08,099 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 0 mSDsluCounter, 5338 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6674 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:22:08,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6674 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 04:22:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2025-03-04 04:22:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 7027. [2025-03-04 04:22:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7027 states, 5225 states have (on average 1.3186602870813398) internal successors, (6890), 5293 states have internal predecessors, (6890), 1192 states have call successors, (1192), 610 states have call predecessors, (1192), 609 states have return successors, (1192), 1174 states have call predecessors, (1192), 1180 states have call successors, (1192) [2025-03-04 04:22:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7027 states to 7027 states and 9274 transitions. [2025-03-04 04:22:08,403 INFO L78 Accepts]: Start accepts. Automaton has 7027 states and 9274 transitions. Word has length 430 [2025-03-04 04:22:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:22:08,404 INFO L471 AbstractCegarLoop]: Abstraction has 7027 states and 9274 transitions. [2025-03-04 04:22:08,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-04 04:22:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7027 states and 9274 transitions. [2025-03-04 04:22:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 04:22:08,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:22:08,417 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:22:08,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 04:22:08,418 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:22:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:22:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1889840730, now seen corresponding path program 1 times [2025-03-04 04:22:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:22:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876258931] [2025-03-04 04:22:08,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:22:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:22:09,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 04:22:09,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 04:22:09,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:22:09,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:22:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2025-03-04 04:22:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:22:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876258931] [2025-03-04 04:22:09,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876258931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:22:09,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:22:09,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:22:09,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70373490] [2025-03-04 04:22:09,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:22:09,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:22:09,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:22:09,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:22:09,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:22:09,356 INFO L87 Difference]: Start difference. First operand 7027 states and 9274 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-04 04:22:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:22:09,745 INFO L93 Difference]: Finished difference Result 13802 states and 18256 transitions. [2025-03-04 04:22:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:22:09,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 477 [2025-03-04 04:22:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:22:09,776 INFO L225 Difference]: With dead ends: 13802 [2025-03-04 04:22:09,776 INFO L226 Difference]: Without dead ends: 7027 [2025-03-04 04:22:09,790 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:22:09,791 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 0 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:22:09,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2660 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:22:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2025-03-04 04:22:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 7027. [2025-03-04 04:22:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7027 states, 5225 states have (on average 1.3152153110047846) internal successors, (6872), 5293 states have internal predecessors, (6872), 1192 states have call successors, (1192), 610 states have call predecessors, (1192), 609 states have return successors, (1192), 1174 states have call predecessors, (1192), 1180 states have call successors, (1192) [2025-03-04 04:22:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7027 states to 7027 states and 9256 transitions. [2025-03-04 04:22:10,079 INFO L78 Accepts]: Start accepts. Automaton has 7027 states and 9256 transitions. Word has length 477 [2025-03-04 04:22:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:22:10,080 INFO L471 AbstractCegarLoop]: Abstraction has 7027 states and 9256 transitions. [2025-03-04 04:22:10,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-04 04:22:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 7027 states and 9256 transitions. [2025-03-04 04:22:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-04 04:22:10,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:22:10,092 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:22:10,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 04:22:10,092 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:22:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:22:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash -227136938, now seen corresponding path program 1 times [2025-03-04 04:22:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:22:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281415538] [2025-03-04 04:22:10,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:22:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:22:10,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-04 04:22:10,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-04 04:22:10,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:22:10,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:22:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2025-03-04 04:22:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:22:11,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281415538] [2025-03-04 04:22:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281415538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:22:11,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:22:11,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:22:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136207447] [2025-03-04 04:22:11,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:22:11,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:22:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:22:11,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:22:11,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:22:11,422 INFO L87 Difference]: Start difference. First operand 7027 states and 9256 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 3 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-04 04:22:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:22:11,931 INFO L93 Difference]: Finished difference Result 9723 states and 12765 transitions. [2025-03-04 04:22:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:22:11,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (39), 3 states have call predecessors, (39), 2 states have call successors, (39) Word has length 480 [2025-03-04 04:22:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:22:11,964 INFO L225 Difference]: With dead ends: 9723 [2025-03-04 04:22:11,964 INFO L226 Difference]: Without dead ends: 7025 [2025-03-04 04:22:11,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:22:11,972 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 0 mSDsluCounter, 5325 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6658 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:22:11,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6658 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:22:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2025-03-04 04:22:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7025. [2025-03-04 04:22:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7025 states, 5223 states have (on average 1.314953092092667) internal successors, (6868), 5291 states have internal predecessors, (6868), 1192 states have call successors, (1192), 610 states have call predecessors, (1192), 609 states have return successors, (1192), 1174 states have call predecessors, (1192), 1180 states have call successors, (1192)