./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bdb144d16ce690b0c83c76766410e2201d517c4cbaa861cb0d7e2bbbb9cb236 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:51:37,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:51:37,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:51:37,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:51:37,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:51:37,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:51:37,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:51:37,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:51:37,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:51:37,308 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:51:37,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:51:37,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:51:37,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:51:37,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:51:37,310 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:51:37,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:51:37,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:51:37,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:51:37,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:51:37,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:51:37,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:51:37,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:51:37,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:51:37,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:51:37,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:51:37,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:51:37,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:51:37,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:51:37,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:51:37,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:51:37,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:51:37,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:51:37,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:51:37,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:51:37,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:51:37,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:51:37,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:51:37,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bdb144d16ce690b0c83c76766410e2201d517c4cbaa861cb0d7e2bbbb9cb236 [2025-01-09 18:51:37,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:51:37,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:51:37,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:51:37,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:51:37,509 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:51:37,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-01-09 18:51:38,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/282715dd1/de325f7e1bc24e17ab8a5a905137769b/FLAG7a13893a7 [2025-01-09 18:51:39,037 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:51:39,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-01-09 18:51:39,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/282715dd1/de325f7e1bc24e17ab8a5a905137769b/FLAG7a13893a7 [2025-01-09 18:51:39,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/282715dd1/de325f7e1bc24e17ab8a5a905137769b [2025-01-09 18:51:39,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:51:39,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:51:39,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:51:39,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:51:39,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:51:39,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:51:39" (1/1) ... [2025-01-09 18:51:39,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ed8296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:39, skipping insertion in model container [2025-01-09 18:51:39,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:51:39" (1/1) ... [2025-01-09 18:51:39,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:51:40,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i[147706,147719] [2025-01-09 18:51:40,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:51:40,255 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:51:40,306 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-01-09 18:51:40,308 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-01-09 18:51:40,308 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-01-09 18:51:40,309 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-01-09 18:51:40,309 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3421] [2025-01-09 18:51:40,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3424] [2025-01-09 18:51:40,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3427] [2025-01-09 18:51:40,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3430] [2025-01-09 18:51:40,311 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-01-09 18:51:40,311 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-01-09 18:51:40,311 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-01-09 18:51:40,311 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-01-09 18:51:40,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i[147706,147719] [2025-01-09 18:51:40,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:51:40,485 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:51:40,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40 WrapperNode [2025-01-09 18:51:40,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:51:40,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:51:40,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:51:40,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:51:40,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,621 INFO L138 Inliner]: procedures = 224, calls = 1326, calls flagged for inlining = 80, calls inlined = 75, statements flattened = 3189 [2025-01-09 18:51:40,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:51:40,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:51:40,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:51:40,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:51:40,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,762 INFO L175 MemorySlicer]: Split 824 memory accesses to 20 slices as follows [2, 5, 5, 1, 29, 647, 16, 15, 15, 12, 26, 3, 5, 8, 1, 6, 3, 14, 8, 3]. 79 percent of accesses are in the largest equivalence class. The 518 initializations are split as follows [2, 5, 5, 0, 0, 451, 0, 8, 8, 0, 0, 3, 5, 8, 0, 6, 3, 3, 8, 3]. The 150 writes are split as follows [0, 0, 0, 1, 29, 63, 16, 3, 0, 2, 26, 0, 0, 0, 0, 0, 0, 10, 0, 0]. [2025-01-09 18:51:40,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:51:40,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:51:40,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:51:40,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:51:40,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (1/1) ... [2025-01-09 18:51:40,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:51:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:51:40,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:51:40,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:51:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_port_mutex_of_lp_struct [2025-01-09 18:51:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_port_mutex_of_lp_struct [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure lp_error [2025-01-09 18:51:40,961 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_error [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:51:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 18:51:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:51:40,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:51:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 18:51:40,963 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 18:51:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure lp_register [2025-01-09 18:51:40,963 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_register [2025-01-09 18:51:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2025-01-09 18:51:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2025-01-09 18:51:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-01-09 18:51:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-01-09 18:51:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure lp_release_parport [2025-01-09 18:51:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_release_parport [2025-01-09 18:51:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:51:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:51:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:51:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:51:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:51:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:51:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:51:40,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:51:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 18:51:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 18:51:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-01-09 18:51:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2025-01-09 18:51:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_port_mutex_of_lp_struct [2025-01-09 18:51:40,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_port_mutex_of_lp_struct [2025-01-09 18:51:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:51:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure lp_set_timeout [2025-01-09 18:51:40,966 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_set_timeout [2025-01-09 18:51:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure lp_reset [2025-01-09 18:51:40,966 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_reset [2025-01-09 18:51:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_25 [2025-01-09 18:51:40,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_25 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:51:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:51:40,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:51:40,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:51:40,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 18:51:40,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 18:51:40,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 18:51:40,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 18:51:40,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 18:51:40,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2025-01-09 18:51:40,969 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-01-09 18:51:40,969 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure parport_write [2025-01-09 18:51:40,969 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_write [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:51:40,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:51:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-01-09 18:51:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lp_mutex [2025-01-09 18:51:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lp_mutex [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2025-01-09 18:51:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure parport_negotiate [2025-01-09 18:51:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_negotiate [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure parport_release [2025-01-09 18:51:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_release [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_console [2025-01-09 18:51:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_console [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:51:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:51:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure parport_set_timeout [2025-01-09 18:51:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_set_timeout [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure parport_claim_or_block [2025-01-09 18:51:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_claim_or_block [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure lp_do_ioctl [2025-01-09 18:51:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_do_ioctl [2025-01-09 18:51:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure lp_claim_parport_or_block [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_claim_parport_or_block [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-01-09 18:51:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-01-09 18:51:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 18:51:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 18:51:40,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __bad_percpu_size [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure lp_detach [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_detach [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lp_mutex [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lp_mutex [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure lp_negotiate [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_negotiate [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure lp_wait_ready [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_wait_ready [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure lp_write [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure lp_write [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2025-01-09 18:51:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-01-09 18:51:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-01-09 18:51:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:51:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:51:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure parport_yield_blocking [2025-01-09 18:51:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_yield_blocking [2025-01-09 18:51:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 18:51:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 18:51:41,495 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:51:41,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:51:41,593 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:51:47,710 INFO L? ?]: Removed 1071 outVars from TransFormulas that were not future-live. [2025-01-09 18:51:47,710 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:51:47,741 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:51:47,746 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 18:51:47,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:51:47 BoogieIcfgContainer [2025-01-09 18:51:47,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:51:47,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:51:47,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:51:47,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:51:47,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:51:39" (1/3) ... [2025-01-09 18:51:47,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e50631e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:51:47, skipping insertion in model container [2025-01-09 18:51:47,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:51:40" (2/3) ... [2025-01-09 18:51:47,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e50631e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:51:47, skipping insertion in model container [2025-01-09 18:51:47,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:51:47" (3/3) ... [2025-01-09 18:51:47,759 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2025-01-09 18:51:47,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:51:47,774 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-01-09 18:51:47,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:51:47,921 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;@5a639e72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:51:47,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:51:47,930 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-01-09 18:51:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 18:51:47,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:51:47,945 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-01-09 18:51:47,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:51:47,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:51:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash 513490188, now seen corresponding path program 1 times [2025-01-09 18:51:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:51:47,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960116231] [2025-01-09 18:51:47,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:51:48,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 18:51:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 18:51:49,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:49,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-01-09 18:51:49,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:51:49,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960116231] [2025-01-09 18:51:49,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960116231] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:51:49,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247177324] [2025-01-09 18:51:49,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:49,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:51:49,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:51:49,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:51:49,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:51:50,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 18:51:50,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 18:51:50,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:50,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:50,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 3610 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 18:51:50,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:51:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-01-09 18:51:50,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:51:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247177324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:51:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:51:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 18:51:50,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101780631] [2025-01-09 18:51:50,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:51:50,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 18:51:50,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:51:50,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 18:51:50,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:51:50,883 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-01-09 18:51:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:51:50,977 INFO L93 Difference]: Finished difference Result 1981 states and 2857 transitions. [2025-01-09 18:51:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 18:51:50,979 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-01-09 18:51:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:51:50,995 INFO L225 Difference]: With dead ends: 1981 [2025-01-09 18:51:50,998 INFO L226 Difference]: Without dead ends: 981 [2025-01-09 18:51:51,008 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-01-09 18:51:51,013 INFO L435 NwaCegarLoop]: 1397 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:51:51,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:51:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-01-09 18:51:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-01-09 18:51:51,098 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-01-09 18:51:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1382 transitions. [2025-01-09 18:51:51,118 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1382 transitions. Word has length 180 [2025-01-09 18:51:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:51:51,121 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1382 transitions. [2025-01-09 18:51:51,121 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-01-09 18:51:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1382 transitions. [2025-01-09 18:51:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 18:51:51,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:51:51,128 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-01-09 18:51:51,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 18:51:51,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 18:51:51,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:51:51,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:51:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash -896238312, now seen corresponding path program 1 times [2025-01-09 18:51:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:51:51,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271754039] [2025-01-09 18:51:51,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:51:52,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 18:51:52,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 18:51:52,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:52,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:51:52,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:51:52,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271754039] [2025-01-09 18:51:52,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271754039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:51:52,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:51:52,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:51:52,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977057503] [2025-01-09 18:51:52,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:51:52,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:51:52,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:51:52,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:51:52,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:51:52,803 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-01-09 18:51:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:51:53,040 INFO L93 Difference]: Finished difference Result 2866 states and 4039 transitions. [2025-01-09 18:51:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:51:53,042 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-01-09 18:51:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:51:53,053 INFO L225 Difference]: With dead ends: 2866 [2025-01-09 18:51:53,054 INFO L226 Difference]: Without dead ends: 1923 [2025-01-09 18:51:53,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:51:53,058 INFO L435 NwaCegarLoop]: 1446 mSDtfsCounter, 1336 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4211 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:51:53,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 4211 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:51:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-01-09 18:51:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1905. [2025-01-09 18:51:53,147 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-01-09 18:51:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2688 transitions. [2025-01-09 18:51:53,159 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2688 transitions. Word has length 180 [2025-01-09 18:51:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:51:53,160 INFO L471 AbstractCegarLoop]: Abstraction has 1905 states and 2688 transitions. [2025-01-09 18:51:53,161 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-01-09 18:51:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2688 transitions. [2025-01-09 18:51:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 18:51:53,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:51:53,166 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-01-09 18:51:53,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:51:53,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:51:53,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:51:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1400690651, now seen corresponding path program 1 times [2025-01-09 18:51:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:51:53,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980521917] [2025-01-09 18:51:53,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:51:53,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 18:51:53,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 18:51:53,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:51:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:51:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980521917] [2025-01-09 18:51:54,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980521917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:51:54,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:51:54,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:51:54,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254671808] [2025-01-09 18:51:54,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:51:54,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:51:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:51:54,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:51:54,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:54,095 INFO L87 Difference]: Start difference. First operand 1905 states and 2688 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-09 18:51:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:51:54,147 INFO L93 Difference]: Finished difference Result 1907 states and 2689 transitions. [2025-01-09 18:51:54,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:51:54,148 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), 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 181 [2025-01-09 18:51:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:51:54,161 INFO L225 Difference]: With dead ends: 1907 [2025-01-09 18:51:54,161 INFO L226 Difference]: Without dead ends: 1904 [2025-01-09 18:51:54,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:54,165 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 1331 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:51:54,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1379 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:51:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2025-01-09 18:51:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1904. [2025-01-09 18:51:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1419 states have (on average 1.3699788583509513) internal successors, (1944), 1445 states have internal predecessors, (1944), 375 states have call successors, (375), 110 states have call predecessors, (375), 109 states have return successors, (367), 366 states have call predecessors, (367), 367 states have call successors, (367) [2025-01-09 18:51:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2686 transitions. [2025-01-09 18:51:54,248 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2686 transitions. Word has length 181 [2025-01-09 18:51:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:51:54,250 INFO L471 AbstractCegarLoop]: Abstraction has 1904 states and 2686 transitions. [2025-01-09 18:51:54,250 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), 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-01-09 18:51:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2686 transitions. [2025-01-09 18:51:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 18:51:54,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:51:54,252 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-01-09 18:51:54,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:51:54,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:51:54,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:51:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1581270733, now seen corresponding path program 1 times [2025-01-09 18:51:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:51:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141609562] [2025-01-09 18:51:54,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:51:54,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 18:51:55,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 18:51:55,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:55,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:51:55,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:51:55,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141609562] [2025-01-09 18:51:55,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141609562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:51:55,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:51:55,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:51:55,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798231709] [2025-01-09 18:51:55,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:51:55,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:51:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:51:55,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:51:55,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:55,202 INFO L87 Difference]: Start difference. First operand 1904 states and 2686 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-01-09 18:51:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:51:55,401 INFO L93 Difference]: Finished difference Result 4313 states and 6033 transitions. [2025-01-09 18:51:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:51:55,402 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-01-09 18:51:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:51:55,414 INFO L225 Difference]: With dead ends: 4313 [2025-01-09 18:51:55,415 INFO L226 Difference]: Without dead ends: 2447 [2025-01-09 18:51:55,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:55,421 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 430 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:51:55,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 2657 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:51:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-01-09 18:51:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2386. [2025-01-09 18:51:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 1787 states have (on average 1.3687744823726917) internal successors, (2446), 1817 states have internal predecessors, (2446), 444 states have call successors, (444), 155 states have call predecessors, (444), 154 states have return successors, (436), 433 states have call predecessors, (436), 436 states have call successors, (436) [2025-01-09 18:51:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3326 transitions. [2025-01-09 18:51:55,533 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3326 transitions. Word has length 184 [2025-01-09 18:51:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:51:55,534 INFO L471 AbstractCegarLoop]: Abstraction has 2386 states and 3326 transitions. [2025-01-09 18:51:55,534 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-01-09 18:51:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3326 transitions. [2025-01-09 18:51:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 18:51:55,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:51:55,536 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] [2025-01-09 18:51:55,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:51:55,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:51:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:51:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash -471997123, now seen corresponding path program 1 times [2025-01-09 18:51:55,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:51:55,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549697641] [2025-01-09 18:51:55,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:51:56,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 18:51:56,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 18:51:56,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:56,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:51:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:51:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549697641] [2025-01-09 18:51:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549697641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:51:56,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:51:56,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:51:56,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269624358] [2025-01-09 18:51:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:51:56,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:51:56,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:51:56,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:51:56,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:56,371 INFO L87 Difference]: Start difference. First operand 2386 states and 3326 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-09 18:51:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:51:56,432 INFO L93 Difference]: Finished difference Result 2388 states and 3327 transitions. [2025-01-09 18:51:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:51:56,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 182 [2025-01-09 18:51:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:51:56,445 INFO L225 Difference]: With dead ends: 2388 [2025-01-09 18:51:56,445 INFO L226 Difference]: Without dead ends: 2385 [2025-01-09 18:51:56,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:56,447 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 1328 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:51:56,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 1377 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:51:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-01-09 18:51:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2025-01-09 18:51:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 1787 states have (on average 1.3682148852825966) internal successors, (2445), 1816 states have internal predecessors, (2445), 443 states have call successors, (443), 155 states have call predecessors, (443), 154 states have return successors, (436), 433 states have call predecessors, (436), 436 states have call successors, (436) [2025-01-09 18:51:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3324 transitions. [2025-01-09 18:51:56,535 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3324 transitions. Word has length 182 [2025-01-09 18:51:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:51:56,536 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3324 transitions. [2025-01-09 18:51:56,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-01-09 18:51:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3324 transitions. [2025-01-09 18:51:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 18:51:56,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:51:56,538 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] [2025-01-09 18:51:56,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:51:56,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:51:56,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:51:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1747263960, now seen corresponding path program 1 times [2025-01-09 18:51:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:51:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352872838] [2025-01-09 18:51:56,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:51:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 18:51:57,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 18:51:57,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:51:57,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:51:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352872838] [2025-01-09 18:51:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352872838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:51:57,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:51:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:51:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95552388] [2025-01-09 18:51:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:51:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:51:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:51:57,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:51:57,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:57,424 INFO L87 Difference]: Start difference. First operand 2385 states and 3324 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-09 18:51:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:51:57,541 INFO L93 Difference]: Finished difference Result 2637 states and 3578 transitions. [2025-01-09 18:51:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:51:57,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 183 [2025-01-09 18:51:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:51:57,555 INFO L225 Difference]: With dead ends: 2637 [2025-01-09 18:51:57,555 INFO L226 Difference]: Without dead ends: 2633 [2025-01-09 18:51:57,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:57,558 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 1016 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:51:57,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 1815 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:51:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-01-09 18:51:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2629. [2025-01-09 18:51:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 1949 states have (on average 1.344279117496152) internal successors, (2620), 1976 states have internal predecessors, (2620), 477 states have call successors, (477), 203 states have call predecessors, (477), 202 states have return successors, (472), 469 states have call predecessors, (472), 472 states have call successors, (472) [2025-01-09 18:51:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3569 transitions. [2025-01-09 18:51:57,694 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3569 transitions. Word has length 183 [2025-01-09 18:51:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:51:57,695 INFO L471 AbstractCegarLoop]: Abstraction has 2629 states and 3569 transitions. [2025-01-09 18:51:57,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-09 18:51:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3569 transitions. [2025-01-09 18:51:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 18:51:57,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:51:57,697 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-01-09 18:51:57,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:51:57,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:51:57,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:51:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1669141920, now seen corresponding path program 1 times [2025-01-09 18:51:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:51:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549009113] [2025-01-09 18:51:57,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:51:58,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 18:51:58,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 18:51:58,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:58,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:51:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:51:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549009113] [2025-01-09 18:51:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549009113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:51:58,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:51:58,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:51:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490156643] [2025-01-09 18:51:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:51:58,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:51:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:51:58,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:51:58,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:51:58,726 INFO L87 Difference]: Start difference. First operand 2629 states and 3569 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-01-09 18:51:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:51:58,954 INFO L93 Difference]: Finished difference Result 5243 states and 7115 transitions. [2025-01-09 18:51:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:51:58,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 184 [2025-01-09 18:51:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:51:58,971 INFO L225 Difference]: With dead ends: 5243 [2025-01-09 18:51:58,972 INFO L226 Difference]: Without dead ends: 2652 [2025-01-09 18:51:58,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:51:58,980 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1370 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:51:58,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 4116 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:51:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2025-01-09 18:51:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2642. [2025-01-09 18:51:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 1962 states have (on average 1.3419979612640163) internal successors, (2633), 1989 states have internal predecessors, (2633), 477 states have call successors, (477), 203 states have call predecessors, (477), 202 states have return successors, (472), 469 states have call predecessors, (472), 472 states have call successors, (472) [2025-01-09 18:51:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3582 transitions. [2025-01-09 18:51:59,086 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 3582 transitions. Word has length 184 [2025-01-09 18:51:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:51:59,087 INFO L471 AbstractCegarLoop]: Abstraction has 2642 states and 3582 transitions. [2025-01-09 18:51:59,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-01-09 18:51:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3582 transitions. [2025-01-09 18:51:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 18:51:59,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:51:59,090 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-01-09 18:51:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:51:59,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:51:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:51:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash -16251786, now seen corresponding path program 1 times [2025-01-09 18:51:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:51:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520419330] [2025-01-09 18:51:59,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:51:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:51:59,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 18:51:59,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 18:51:59,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:51:59,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:51:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:51:59,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:51:59,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520419330] [2025-01-09 18:51:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520419330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:51:59,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:51:59,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:51:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237484443] [2025-01-09 18:51:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:51:59,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:51:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:51:59,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:51:59,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:51:59,927 INFO L87 Difference]: Start difference. First operand 2642 states and 3582 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:52:03,963 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-01-09 18:52:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:04,142 INFO L93 Difference]: Finished difference Result 7617 states and 10327 transitions. [2025-01-09 18:52:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:04,142 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), 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 194 [2025-01-09 18:52:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:04,161 INFO L225 Difference]: With dead ends: 7617 [2025-01-09 18:52:04,161 INFO L226 Difference]: Without dead ends: 5013 [2025-01-09 18:52:04,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:04,168 INFO L435 NwaCegarLoop]: 1391 mSDtfsCounter, 1275 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:04,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 2675 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:52:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2025-01-09 18:52:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 5001. [2025-01-09 18:52:04,384 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-01-09 18:52:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 6775 transitions. [2025-01-09 18:52:04,403 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 6775 transitions. Word has length 194 [2025-01-09 18:52:04,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:04,404 INFO L471 AbstractCegarLoop]: Abstraction has 5001 states and 6775 transitions. [2025-01-09 18:52:04,404 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), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 18:52:04,404 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 6775 transitions. [2025-01-09 18:52:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 18:52:04,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:04,405 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-01-09 18:52:04,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:52:04,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:04,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1398527250, now seen corresponding path program 1 times [2025-01-09 18:52:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:04,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256608218] [2025-01-09 18:52:04,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:04,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:04,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 18:52:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 18:52:05,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:05,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:52:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:05,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256608218] [2025-01-09 18:52:05,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256608218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:05,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:05,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:52:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862677507] [2025-01-09 18:52:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:05,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:52:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:05,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:52:05,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:05,204 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-01-09 18:52:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:05,377 INFO L93 Difference]: Finished difference Result 5003 states and 6776 transitions. [2025-01-09 18:52:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:05,378 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-01-09 18:52:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:05,403 INFO L225 Difference]: With dead ends: 5003 [2025-01-09 18:52:05,403 INFO L226 Difference]: Without dead ends: 5000 [2025-01-09 18:52:05,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:05,409 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:05,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 1371 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:52:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2025-01-09 18:52:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 5000. [2025-01-09 18:52:05,587 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-01-09 18:52:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 6773 transitions. [2025-01-09 18:52:05,616 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 6773 transitions. Word has length 193 [2025-01-09 18:52:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:05,618 INFO L471 AbstractCegarLoop]: Abstraction has 5000 states and 6773 transitions. [2025-01-09 18:52:05,618 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-01-09 18:52:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 6773 transitions. [2025-01-09 18:52:05,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 18:52:05,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:05,621 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-01-09 18:52:05,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:52:05,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:05,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash 404426489, now seen corresponding path program 1 times [2025-01-09 18:52:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:05,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209130253] [2025-01-09 18:52:05,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:06,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 18:52:06,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 18:52:06,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:06,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 18:52:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209130253] [2025-01-09 18:52:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209130253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:52:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709127147] [2025-01-09 18:52:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:52:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:06,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:52:06,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:06,599 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-01-09 18:52:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:06,935 INFO L93 Difference]: Finished difference Result 14802 states and 20163 transitions. [2025-01-09 18:52:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:06,938 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-01-09 18:52:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:06,996 INFO L225 Difference]: With dead ends: 14802 [2025-01-09 18:52:06,996 INFO L226 Difference]: Without dead ends: 9803 [2025-01-09 18:52:07,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:07,014 INFO L435 NwaCegarLoop]: 1758 mSDtfsCounter, 1313 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 3047 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:07,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 3047 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:52:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9803 states. [2025-01-09 18:52:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9803 to 9761. [2025-01-09 18:52:07,415 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-01-09 18:52:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9761 states to 9761 states and 13287 transitions. [2025-01-09 18:52:07,444 INFO L78 Accepts]: Start accepts. Automaton has 9761 states and 13287 transitions. Word has length 194 [2025-01-09 18:52:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:07,445 INFO L471 AbstractCegarLoop]: Abstraction has 9761 states and 13287 transitions. [2025-01-09 18:52:07,446 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-01-09 18:52:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9761 states and 13287 transitions. [2025-01-09 18:52:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 18:52:07,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:07,453 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-01-09 18:52:07,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:52:07,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:07,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:07,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1396473360, now seen corresponding path program 1 times [2025-01-09 18:52:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:07,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716304273] [2025-01-09 18:52:07,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:08,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 18:52:08,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 18:52:08,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:08,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 18:52:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716304273] [2025-01-09 18:52:08,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716304273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:08,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:52:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491620531] [2025-01-09 18:52:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:08,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:52:08,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:08,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:52:08,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:08,209 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-01-09 18:52:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:08,617 INFO L93 Difference]: Finished difference Result 19508 states and 26557 transitions. [2025-01-09 18:52:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:08,618 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-01-09 18:52:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:08,654 INFO L225 Difference]: With dead ends: 19508 [2025-01-09 18:52:08,654 INFO L226 Difference]: Without dead ends: 9785 [2025-01-09 18:52:08,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:08,679 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 3 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:08,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2732 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:52:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2025-01-09 18:52:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 9765. [2025-01-09 18:52:09,160 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-01-09 18:52:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9765 states to 9765 states and 13291 transitions. [2025-01-09 18:52:09,193 INFO L78 Accepts]: Start accepts. Automaton has 9765 states and 13291 transitions. Word has length 254 [2025-01-09 18:52:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:09,197 INFO L471 AbstractCegarLoop]: Abstraction has 9765 states and 13291 transitions. [2025-01-09 18:52:09,197 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-01-09 18:52:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9765 states and 13291 transitions. [2025-01-09 18:52:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-09 18:52:09,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:09,211 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-01-09 18:52:09,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:52:09,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:09,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash -45216279, now seen corresponding path program 1 times [2025-01-09 18:52:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215910306] [2025-01-09 18:52:09,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:09,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:09,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 18:52:10,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 18:52:10,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:10,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 18:52:10,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:10,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215910306] [2025-01-09 18:52:10,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215910306] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:52:10,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790112018] [2025-01-09 18:52:10,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:52:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:52:10,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:52:10,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:52:11,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 18:52:11,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 18:52:11,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:11,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:11,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 4151 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:52:11,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:52:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-01-09 18:52:12,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:52:12,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790112018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:12,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:52:12,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 18:52:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316836559] [2025-01-09 18:52:12,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:12,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:52:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:12,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:52:12,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:52:12,060 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-01-09 18:52:16,101 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-01-09 18:52:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:16,311 INFO L93 Difference]: Finished difference Result 15228 states and 20652 transitions. [2025-01-09 18:52:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:16,311 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-01-09 18:52:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:16,333 INFO L225 Difference]: With dead ends: 15228 [2025-01-09 18:52:16,333 INFO L226 Difference]: Without dead ends: 5497 [2025-01-09 18:52:16,354 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-01-09 18:52:16,355 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 9 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:16,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2738 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:52:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2025-01-09 18:52:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 5476. [2025-01-09 18:52:16,509 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-01-09 18:52:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7382 transitions. [2025-01-09 18:52:16,527 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7382 transitions. Word has length 266 [2025-01-09 18:52:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 5476 states and 7382 transitions. [2025-01-09 18:52:16,528 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-01-09 18:52:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7382 transitions. [2025-01-09 18:52:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-01-09 18:52:16,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:16,533 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-01-09 18:52:16,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 18:52:16,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:52:16,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1140239173, now seen corresponding path program 1 times [2025-01-09 18:52:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442419877] [2025-01-09 18:52:16,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:17,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-01-09 18:52:17,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-01-09 18:52:17,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:17,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-01-09 18:52:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442419877] [2025-01-09 18:52:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442419877] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:52:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510792354] [2025-01-09 18:52:17,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:17,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:52:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:52:17,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:52:17,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 18:52:18,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-01-09 18:52:19,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-01-09 18:52:19,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:19,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:19,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 4231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:52:19,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:52:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 255 proven. 1 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 18:52:19,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:52:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-01-09 18:52:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510792354] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:52:19,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:52:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 18:52:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699187858] [2025-01-09 18:52:19,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:52:19,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 18:52:19,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:19,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 18:52:19,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 18:52:19,791 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-01-09 18:52:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:20,326 INFO L93 Difference]: Finished difference Result 10775 states and 14540 transitions. [2025-01-09 18:52:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:52:20,326 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-01-09 18:52:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:20,348 INFO L225 Difference]: With dead ends: 10775 [2025-01-09 18:52:20,348 INFO L226 Difference]: Without dead ends: 5548 [2025-01-09 18:52:20,358 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-01-09 18:52:20,359 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 6 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4092 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:20,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4092 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 18:52:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2025-01-09 18:52:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5548. [2025-01-09 18:52:20,556 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-01-09 18:52:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5548 states to 5548 states and 7478 transitions. [2025-01-09 18:52:20,577 INFO L78 Accepts]: Start accepts. Automaton has 5548 states and 7478 transitions. Word has length 283 [2025-01-09 18:52:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:20,578 INFO L471 AbstractCegarLoop]: Abstraction has 5548 states and 7478 transitions. [2025-01-09 18:52:20,578 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-01-09 18:52:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 5548 states and 7478 transitions. [2025-01-09 18:52:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 18:52:20,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:20,585 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-01-09 18:52:20,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 18:52:20,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:52:20,786 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:20,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1660818502, now seen corresponding path program 2 times [2025-01-09 18:52:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:20,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448388488] [2025-01-09 18:52:20,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:52:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:21,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 319 statements into 2 equivalence classes. [2025-01-09 18:52:21,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 319 statements. [2025-01-09 18:52:21,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 18:52:21,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-01-09 18:52:21,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:21,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448388488] [2025-01-09 18:52:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448388488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:21,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:52:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416417274] [2025-01-09 18:52:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:21,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:52:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:21,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:52:21,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:21,560 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-01-09 18:52:25,595 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-01-09 18:52:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:25,735 INFO L93 Difference]: Finished difference Result 5556 states and 7484 transitions. [2025-01-09 18:52:25,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:25,736 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-01-09 18:52:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:25,755 INFO L225 Difference]: With dead ends: 5556 [2025-01-09 18:52:25,756 INFO L226 Difference]: Without dead ends: 5553 [2025-01-09 18:52:25,758 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-01-09 18:52:25,758 INFO L435 NwaCegarLoop]: 1485 mSDtfsCounter, 423 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:25,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 2547 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:52:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5553 states. [2025-01-09 18:52:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5553 to 5547. [2025-01-09 18:52:25,917 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-01-09 18:52:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5547 states to 5547 states and 7473 transitions. [2025-01-09 18:52:25,935 INFO L78 Accepts]: Start accepts. Automaton has 5547 states and 7473 transitions. Word has length 319 [2025-01-09 18:52:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:25,935 INFO L471 AbstractCegarLoop]: Abstraction has 5547 states and 7473 transitions. [2025-01-09 18:52:25,935 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-01-09 18:52:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5547 states and 7473 transitions. [2025-01-09 18:52:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 18:52:25,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:25,945 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] [2025-01-09 18:52:25,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:52:25,945 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:25,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1217805243, now seen corresponding path program 1 times [2025-01-09 18:52:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951631790] [2025-01-09 18:52:25,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:26,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 18:52:26,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 18:52:26,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:26,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2025-01-09 18:52:26,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951631790] [2025-01-09 18:52:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951631790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:26,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:52:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127093272] [2025-01-09 18:52:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:26,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:52:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:26,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:52:26,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:26,924 INFO L87 Difference]: Start difference. First operand 5547 states and 7473 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:52:30,957 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-01-09 18:52:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:31,213 INFO L93 Difference]: Finished difference Result 10847 states and 14619 transitions. [2025-01-09 18:52:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:31,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 352 [2025-01-09 18:52:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:31,233 INFO L225 Difference]: With dead ends: 10847 [2025-01-09 18:52:31,234 INFO L226 Difference]: Without dead ends: 5549 [2025-01-09 18:52:31,243 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-01-09 18:52:31,244 INFO L435 NwaCegarLoop]: 2234 mSDtfsCounter, 1278 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 3563 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:31,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 3563 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:52:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2025-01-09 18:52:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 5500. [2025-01-09 18:52:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5500 states, 4076 states have (on average 1.329244357212954) internal successors, (5418), 4128 states have internal predecessors, (5418), 981 states have call successors, (981), 441 states have call predecessors, (981), 442 states have return successors, (982), 970 states have call predecessors, (982), 968 states have call successors, (982) [2025-01-09 18:52:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5500 states to 5500 states and 7381 transitions. [2025-01-09 18:52:31,410 INFO L78 Accepts]: Start accepts. Automaton has 5500 states and 7381 transitions. Word has length 352 [2025-01-09 18:52:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:31,411 INFO L471 AbstractCegarLoop]: Abstraction has 5500 states and 7381 transitions. [2025-01-09 18:52:31,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:52:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5500 states and 7381 transitions. [2025-01-09 18:52:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-09 18:52:31,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:31,421 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] [2025-01-09 18:52:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:52:31,421 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:31,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:31,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1229121370, now seen corresponding path program 1 times [2025-01-09 18:52:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049966028] [2025-01-09 18:52:31,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:32,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 18:52:32,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 18:52:32,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:32,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-01-09 18:52:32,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:32,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049966028] [2025-01-09 18:52:32,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049966028] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:52:32,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352288382] [2025-01-09 18:52:32,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:32,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:52:32,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:52:32,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:52:32,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 18:52:34,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-09 18:52:34,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-09 18:52:34,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:34,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:34,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 4916 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 18:52:34,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:52:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 255 proven. 40 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-01-09 18:52:34,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:52:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-01-09 18:52:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352288382] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:52:35,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:52:35,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-09 18:52:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353606021] [2025-01-09 18:52:35,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:52:35,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 18:52:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:35,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 18:52:35,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-09 18:52:35,169 INFO L87 Difference]: Start difference. First operand 5500 states and 7381 transitions. Second operand has 11 states, 11 states have (on average 16.181818181818183) internal successors, (178), 11 states have internal predecessors, (178), 10 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (59), 10 states have call predecessors, (59), 10 states have call successors, (59) [2025-01-09 18:52:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:36,083 INFO L93 Difference]: Finished difference Result 10847 states and 14574 transitions. [2025-01-09 18:52:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 18:52:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.181818181818183) internal successors, (178), 11 states have internal predecessors, (178), 10 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (59), 10 states have call predecessors, (59), 10 states have call successors, (59) Word has length 352 [2025-01-09 18:52:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:36,103 INFO L225 Difference]: With dead ends: 10847 [2025-01-09 18:52:36,103 INFO L226 Difference]: Without dead ends: 5596 [2025-01-09 18:52:36,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 698 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-01-09 18:52:36,113 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 3 mSDsluCounter, 5440 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6806 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:36,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6806 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 18:52:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2025-01-09 18:52:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5596. [2025-01-09 18:52:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 4140 states have (on average 1.3241545893719806) internal successors, (5482), 4192 states have internal predecessors, (5482), 1013 states have call successors, (1013), 441 states have call predecessors, (1013), 442 states have return successors, (1014), 1002 states have call predecessors, (1014), 1000 states have call successors, (1014) [2025-01-09 18:52:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 7509 transitions. [2025-01-09 18:52:36,320 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 7509 transitions. Word has length 352 [2025-01-09 18:52:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:36,321 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 7509 transitions. [2025-01-09 18:52:36,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.181818181818183) internal successors, (178), 11 states have internal predecessors, (178), 10 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (59), 10 states have call predecessors, (59), 10 states have call successors, (59) [2025-01-09 18:52:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 7509 transitions. [2025-01-09 18:52:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-01-09 18:52:36,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:36,330 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] [2025-01-09 18:52:36,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 18:52:36,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 18:52:36,531 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:36,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1364906690, now seen corresponding path program 2 times [2025-01-09 18:52:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:36,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978400084] [2025-01-09 18:52:36,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 18:52:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:37,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 400 statements into 2 equivalence classes. [2025-01-09 18:52:37,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 400 statements. [2025-01-09 18:52:37,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 18:52:37,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2025-01-09 18:52:37,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978400084] [2025-01-09 18:52:37,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978400084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:37,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:37,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:52:37,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893971485] [2025-01-09 18:52:37,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:37,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:52:37,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:37,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:52:37,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:52:37,411 INFO L87 Difference]: Start difference. First operand 5596 states and 7509 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:52:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:37,614 INFO L93 Difference]: Finished difference Result 5827 states and 7755 transitions. [2025-01-09 18:52:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:52:37,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 400 [2025-01-09 18:52:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:37,636 INFO L225 Difference]: With dead ends: 5827 [2025-01-09 18:52:37,637 INFO L226 Difference]: Without dead ends: 5300 [2025-01-09 18:52:37,641 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-01-09 18:52:37,642 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 0 mSDsluCounter, 5482 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6856 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:37,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6856 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:52:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2025-01-09 18:52:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 5300. [2025-01-09 18:52:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5300 states, 3913 states have (on average 1.3158701763352927) internal successors, (5149), 3958 states have internal predecessors, (5149), 950 states have call successors, (950), 435 states have call predecessors, (950), 436 states have return successors, (952), 941 states have call predecessors, (952), 938 states have call successors, (952) [2025-01-09 18:52:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 7051 transitions. [2025-01-09 18:52:37,798 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 7051 transitions. Word has length 400 [2025-01-09 18:52:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:37,799 INFO L471 AbstractCegarLoop]: Abstraction has 5300 states and 7051 transitions. [2025-01-09 18:52:37,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 18:52:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 7051 transitions. [2025-01-09 18:52:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-01-09 18:52:37,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:37,808 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:52:37,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 18:52:37,808 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:37,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1891674577, now seen corresponding path program 1 times [2025-01-09 18:52:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:37,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887966012] [2025-01-09 18:52:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:38,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-01-09 18:52:38,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-01-09 18:52:38,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:38,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2025-01-09 18:52:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887966012] [2025-01-09 18:52:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887966012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:38,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:38,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:52:38,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663733484] [2025-01-09 18:52:38,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:38,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:52:38,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:38,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:52:38,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:52:38,866 INFO L87 Difference]: Start difference. First operand 5300 states and 7051 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 18:52:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:39,016 INFO L93 Difference]: Finished difference Result 7378 states and 9788 transitions. [2025-01-09 18:52:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:52:39,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 408 [2025-01-09 18:52:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:39,034 INFO L225 Difference]: With dead ends: 7378 [2025-01-09 18:52:39,035 INFO L226 Difference]: Without dead ends: 5292 [2025-01-09 18:52:39,038 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-01-09 18:52:39,039 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 0 mSDsluCounter, 5462 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6829 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:39,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6829 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:52:39,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2025-01-09 18:52:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 5292. [2025-01-09 18:52:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 3907 states have (on average 1.3158433580752495) internal successors, (5141), 3954 states have internal predecessors, (5141), 950 states have call successors, (950), 435 states have call predecessors, (950), 434 states have return successors, (948), 937 states have call predecessors, (948), 938 states have call successors, (948) [2025-01-09 18:52:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 7039 transitions. [2025-01-09 18:52:39,189 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 7039 transitions. Word has length 408 [2025-01-09 18:52:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:39,190 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 7039 transitions. [2025-01-09 18:52:39,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 18:52:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 7039 transitions. [2025-01-09 18:52:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-01-09 18:52:39,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:39,199 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, 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] [2025-01-09 18:52:39,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 18:52:39,199 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:39,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash 859714010, now seen corresponding path program 1 times [2025-01-09 18:52:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:39,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846982600] [2025-01-09 18:52:39,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:39,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:39,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-01-09 18:52:39,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-01-09 18:52:39,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:39,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-01-09 18:52:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:40,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846982600] [2025-01-09 18:52:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846982600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:40,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:52:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492662977] [2025-01-09 18:52:40,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:40,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:52:40,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:40,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:52:40,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:40,158 INFO L87 Difference]: Start difference. First operand 5292 states and 7039 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-01-09 18:52:44,191 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-01-09 18:52:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:44,568 INFO L93 Difference]: Finished difference Result 12410 states and 16445 transitions. [2025-01-09 18:52:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:44,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 420 [2025-01-09 18:52:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:44,596 INFO L225 Difference]: With dead ends: 12410 [2025-01-09 18:52:44,596 INFO L226 Difference]: Without dead ends: 7367 [2025-01-09 18:52:44,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:44,606 INFO L435 NwaCegarLoop]: 1738 mSDtfsCounter, 915 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:44,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 2902 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:52:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2025-01-09 18:52:44,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 7127. [2025-01-09 18:52:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7127 states, 5298 states have (on average 1.3178557946394867) internal successors, (6982), 5363 states have internal predecessors, (6982), 1209 states have call successors, (1209), 620 states have call predecessors, (1209), 619 states have return successors, (1209), 1194 states have call predecessors, (1209), 1197 states have call successors, (1209) [2025-01-09 18:52:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7127 states to 7127 states and 9400 transitions. [2025-01-09 18:52:45,022 INFO L78 Accepts]: Start accepts. Automaton has 7127 states and 9400 transitions. Word has length 420 [2025-01-09 18:52:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:45,026 INFO L471 AbstractCegarLoop]: Abstraction has 7127 states and 9400 transitions. [2025-01-09 18:52:45,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-01-09 18:52:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7127 states and 9400 transitions. [2025-01-09 18:52:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-01-09 18:52:45,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:45,058 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, 3, 3, 3, 3, 3, 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] [2025-01-09 18:52:45,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 18:52:45,058 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:45,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1379034868, now seen corresponding path program 1 times [2025-01-09 18:52:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:45,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058780145] [2025-01-09 18:52:45,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:45,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-09 18:52:45,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-09 18:52:45,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:45,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2025-01-09 18:52:45,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:45,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058780145] [2025-01-09 18:52:45,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058780145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:45,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:45,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:52:45,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164562143] [2025-01-09 18:52:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:45,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:52:45,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:45,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:52:45,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:45,939 INFO L87 Difference]: Start difference. First operand 7127 states and 9400 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 18:52:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:46,163 INFO L93 Difference]: Finished difference Result 14005 states and 18510 transitions. [2025-01-09 18:52:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:52:46,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 462 [2025-01-09 18:52:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:46,186 INFO L225 Difference]: With dead ends: 14005 [2025-01-09 18:52:46,186 INFO L226 Difference]: Without dead ends: 7127 [2025-01-09 18:52:46,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:52:46,199 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 0 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:46,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2722 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:52:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7127 states. [2025-01-09 18:52:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7127 to 7127. [2025-01-09 18:52:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7127 states, 5298 states have (on average 1.3144582861457155) internal successors, (6964), 5363 states have internal predecessors, (6964), 1209 states have call successors, (1209), 620 states have call predecessors, (1209), 619 states have return successors, (1209), 1194 states have call predecessors, (1209), 1197 states have call successors, (1209) [2025-01-09 18:52:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7127 states to 7127 states and 9382 transitions. [2025-01-09 18:52:46,406 INFO L78 Accepts]: Start accepts. Automaton has 7127 states and 9382 transitions. Word has length 462 [2025-01-09 18:52:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:46,407 INFO L471 AbstractCegarLoop]: Abstraction has 7127 states and 9382 transitions. [2025-01-09 18:52:46,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 18:52:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7127 states and 9382 transitions. [2025-01-09 18:52:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-01-09 18:52:46,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:46,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, 3, 3, 3, 3, 3, 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] [2025-01-09 18:52:46,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 18:52:46,417 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:46,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:46,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1316659099, now seen corresponding path program 1 times [2025-01-09 18:52:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:46,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369296295] [2025-01-09 18:52:46,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:46,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:47,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-01-09 18:52:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-01-09 18:52:47,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:47,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1255 trivial. 0 not checked. [2025-01-09 18:52:47,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:47,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369296295] [2025-01-09 18:52:47,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369296295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:47,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:47,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:52:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127336509] [2025-01-09 18:52:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:47,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:52:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:47,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:52:47,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:52:47,535 INFO L87 Difference]: Start difference. First operand 7127 states and 9382 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 18:52:51,575 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-01-09 18:52:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:51,819 INFO L93 Difference]: Finished difference Result 14002 states and 18428 transitions. [2025-01-09 18:52:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:52:51,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 465 [2025-01-09 18:52:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:51,850 INFO L225 Difference]: With dead ends: 14002 [2025-01-09 18:52:51,850 INFO L226 Difference]: Without dead ends: 7085 [2025-01-09 18:52:51,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:52:51,864 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 10 mSDsluCounter, 4081 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5446 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:51,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5446 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:52:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2025-01-09 18:52:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 7027. [2025-01-09 18:52:52,056 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-01-09 18:52:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7027 states to 7027 states and 9256 transitions. [2025-01-09 18:52:52,081 INFO L78 Accepts]: Start accepts. Automaton has 7027 states and 9256 transitions. Word has length 465 [2025-01-09 18:52:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:52,082 INFO L471 AbstractCegarLoop]: Abstraction has 7027 states and 9256 transitions. [2025-01-09 18:52:52,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-01-09 18:52:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 7027 states and 9256 transitions. [2025-01-09 18:52:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 18:52:52,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:52,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, 3, 3, 3, 3, 3, 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] [2025-01-09 18:52:52,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 18:52:52,093 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:52,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:52,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1638244547, now seen corresponding path program 1 times [2025-01-09 18:52:52,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:52,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791888879] [2025-01-09 18:52:52,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:52,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:52,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 18:52:52,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 18:52:52,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:52,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2025-01-09 18:52:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791888879] [2025-01-09 18:52:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791888879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:52:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755584479] [2025-01-09 18:52:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:53,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:52:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:53,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:52:53,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:52:53,336 INFO L87 Difference]: Start difference. First operand 7027 states and 9256 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 3 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 18:52:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:53,587 INFO L93 Difference]: Finished difference Result 9723 states and 12765 transitions. [2025-01-09 18:52:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:52:53,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 3 states have call predecessors, (39), 2 states have call successors, (39) Word has length 483 [2025-01-09 18:52:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:53,619 INFO L225 Difference]: With dead ends: 9723 [2025-01-09 18:52:53,619 INFO L226 Difference]: Without dead ends: 7025 [2025-01-09 18:52:53,627 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-01-09 18:52:53,629 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 0 mSDsluCounter, 5449 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6813 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:53,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6813 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:52:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2025-01-09 18:52:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 7025. [2025-01-09 18:52:53,948 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) [2025-01-09 18:52:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 9252 transitions. [2025-01-09 18:52:53,968 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 9252 transitions. Word has length 483 [2025-01-09 18:52:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:53,969 INFO L471 AbstractCegarLoop]: Abstraction has 7025 states and 9252 transitions. [2025-01-09 18:52:53,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 5 states have internal predecessors, (163), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 3 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 18:52:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 9252 transitions. [2025-01-09 18:52:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 18:52:53,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:53,978 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:52:53,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 18:52:53,979 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:53,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash -335558995, now seen corresponding path program 1 times [2025-01-09 18:52:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:53,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3736934] [2025-01-09 18:52:53,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:54,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 18:52:54,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 18:52:54,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:54,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2025-01-09 18:52:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3736934] [2025-01-09 18:52:55,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3736934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:55,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:52:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675894843] [2025-01-09 18:52:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:55,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:52:55,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:55,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:52:55,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:52:55,167 INFO L87 Difference]: Start difference. First operand 7025 states and 9252 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 3 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 18:52:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:52:55,402 INFO L93 Difference]: Finished difference Result 13930 states and 18373 transitions. [2025-01-09 18:52:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:52:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 3 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 491 [2025-01-09 18:52:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:52:55,428 INFO L225 Difference]: With dead ends: 13930 [2025-01-09 18:52:55,429 INFO L226 Difference]: Without dead ends: 7157 [2025-01-09 18:52:55,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:52:55,442 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 23 mSDsluCounter, 2761 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:52:55,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4160 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:52:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7157 states. [2025-01-09 18:52:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7157 to 7109. [2025-01-09 18:52:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7109 states, 5287 states have (on average 1.3141668242859845) internal successors, (6948), 5353 states have internal predecessors, (6948), 1212 states have call successors, (1212), 610 states have call predecessors, (1212), 609 states have return successors, (1214), 1196 states have call predecessors, (1214), 1200 states have call successors, (1214) [2025-01-09 18:52:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 9374 transitions. [2025-01-09 18:52:55,656 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 9374 transitions. Word has length 491 [2025-01-09 18:52:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:52:55,656 INFO L471 AbstractCegarLoop]: Abstraction has 7109 states and 9374 transitions. [2025-01-09 18:52:55,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 3 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-01-09 18:52:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 9374 transitions. [2025-01-09 18:52:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 18:52:55,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:52:55,664 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:52:55,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 18:52:55,664 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:52:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:52:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1715425003, now seen corresponding path program 1 times [2025-01-09 18:52:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:52:55,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051131457] [2025-01-09 18:52:55,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:52:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:52:56,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 18:52:56,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 18:52:56,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:52:56,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:52:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-01-09 18:52:56,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:52:56,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051131457] [2025-01-09 18:52:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051131457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:52:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:52:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:52:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807559941] [2025-01-09 18:52:56,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:52:56,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:52:56,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:52:56,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:52:56,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:52:56,997 INFO L87 Difference]: Start difference. First operand 7109 states and 9374 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 3 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43)